Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 23 April

Numerical Analysis

Stable and asymptotic preserving space-time discretizations of a linear kinetic transport equation in diffusive scaling

We develop an unconditionally energy-stable tensor-product space-time discretization framework for the solution of a linear kinetic transport equation in one space dimension. The kinetic equation is a simplified model of radiative transfer formulated as a hyperbolic balance law in diffusive scaling for a particle distribution function of the independent variables space, time and velocity. Our numerical discretization is based on the well-known technique of micro-macro decomposition which results in a system of balance laws for equilibrium and non-equilibrium quantities and facilitates preservation of the asymptotic limit for vanishing scaling parameters at the discrete level. We prove fully discrete stability and asymptotic preservation for general spatial and temporal discretizations having the summation-by-parts property. A new provably energy-stable Dirichlet boundary treatment for the micro-macro decomposed system is developed based on the introduction of simultaneous approximation terms. Numerical results show convergence for smooth problems and demonstrate energy stability of the proposed boundary treatment.
Read the full abstract

All authors Anita Gjesteland, Sigrun Ortleb, Salim Elghawi, David C. Del Rey Fernández

Probability · Cross-listed from cs.GL

A Brief History of Fréchet Distances: From Curves and Probability Laws to FID

This note provides a chronological account of Fréchet distances, starting with Maurice Fréchet's 1906 doctoral thesis on distances in abstract sets and tracing the Fréchet distance between polygonal curves and its algorithmic computation in the 1990s. It then continues with his 1957 paper on a coupling-based distance between probability laws with a brief glimpse of Wasserstein distance and optimal transport. We further attempt to draw connections between the distributional, coupling-based facet of Fréchet distances on probability laws and the geometric facet on curves. The note ends with a modern use case, the Fréchet Inception Distance (FID) in the era of deep generative model evaluation, interpretable as the Wasserstein-2 distance between multivariate Gaussians in a learned feature space. An appendix includes \TeX{}ified faithful English translations of Fréchet's 1906 thesis and 1957 paper, and Lévy's 1950 note for reader convenience.
Read the full abstract

Group Theory

On the induction functor from group algebras to distribution algebras

Let $G$ be a reductive algebraic group scheme defined over ${\mathbb F}_{p}$ and $k$ be an algebraically closed field of characteristic $p$. There are two associated families of finite group schemes, the $r$-th Frobenius kernels, denoted by $G_r$, and the fixed points of the iterated Frobenius map, the finite groups of Lie type, denoted by $G(\mathbb{F}_q).$ Bendel, Nakano and Pillen initiated the investigation of the induction functor $\operatorname{ind}_{G(\mathbb{F}_q)}^G-$. Using filtrations and truncation, large amounts of data coming from the algebraic group and the Frobenius kernels can be transferred to the finite group. This paper looks at connections between a fundamental theorem of Chastkofsky and Jantzen and the induction functor via the cohomology and representation theory of $G$.
Read the full abstract

Probability · Cross-listed from q-fin.RM

Modeling dependency between operational risk losses and macroeconomic variables using Hidden Markov Models

Predicting future operational risk losses gives rise to a significant challenge due to the heterogeneous and time-dependent structures present in real-world data. Furthermore, stress test exercises require examining the relationship with operational losses. To capture such relationship, we propose to use an extension of Hidden Markov Models to multivariate observations. This model introduces a third auxiliary variable designed to accommodate the economic covariates in the time-series data. We detail the unique aspects of operational risk data and describe how model calibration is achieved via the Expectation-Maximization (EM) algorithm. Additionally, we provide the calibration results for the various risk-event types and analyze the relevance of the inclusion of the macroeconomic covariates.
Read the full abstract

All authors Nikeethan Selvaratnam, Dorinel Bastide, Clément Fernandes, Wojciech Pieczynski

Representation Theory

Twisted Kazhdan-Lusztig conjecture for $p$-adic general linear group

We use enhanced Langlands parameters to obtain a classification for irreducible representations of twisted $p$-adic general linear groups in unramified principal series. We give the definition of standard representations and prove the twisted Kazhdan-Lusztig conjecture for the multiplicities in the Grothendieck group. We mainly follow Lusztig's work in the connected case using graded Hecke algebra. We show that the parametrization is compatible with the Whittaker-normalized one.
Read the full abstract

Analysis of PDEs

Calderón-Zygmund estimates for parabolic $p$-Laplacian systems with non-divergence form right-hand sides

We establish local Calderón-Zygmund type estimates for weak solutions to nonlinear parabolic systems with $p$-growth and VMO coefficients. In particular, we prove that if the right-hand side belongs locally to $L^{\mu s}$, where the exponent $\mu$ depends explicitly on $p$, $N$, and a prescribed target exponent $s>p$, then the spatial gradient of the solution enjoys improved integrability $Du \in L^s_{\rm{loc}}$. The result provides a sharp transfer of integrability from the data to the gradient, consistent with the natural parabolic scaling, and recovers the optimal exponents in the linear case $p=2$. The proof combines intrinsic scaling techniques with a Calderón-Zygmund type iteration scheme.
Read the full abstract

All authors Pêdra Andrade, Verena Bögelein, Frank Duzaar, Kristian Moring

Group Theory

Representation growth of quasi-semisimple profinite groups

The representation zeta function of a profinite group $G$ encodes the distribution of continuous irreducible complex representations of $G$ as a function of the dimension. Its abscissa of convergence $\alpha(G)$ describes the polynomial degree of representation growth of $G$. Within the class of quasi-semisimple profinite groups, we characterise those of polynomial representation growth (PRG) and we prove that whether such a group $G$ has PRG or not only depends on its semisimple part $G/\mathrm{Z}(G)$. Moreover, we show that, for quasi-semisimple profinite groups $G$ that have uniformly bounded Lie ranks, the degree of growth satisfies $\alpha(G) = \alpha(G/\mathrm{Z}(G))$. We provide a technique to produce, for any prescribed positive real number $\varrho$, quasi-semisimple profinite groups $G$ with PRG of degree $\alpha(G) = \varrho$. Our method allows for considerable flexibility regarding the inclusion of finite simple groups of Lie type as composition factors of $G$. Furthermore, we can arrange for the groups $G$ of prescribed representation growth to be profinite completions of suitable finitely generated discrete groups $\Gamma$ so that the group $\Gamma$ has the same representation zeta function as $G$.
Read the full abstract

Numerical Analysis

A superconvergent hybridizable discontinuous Galerkin method for the convective Cahn–Hilliard equation

We propose a hybridizable discontinuous Galerkin (HDG) method combined with convex-concave splitting for the temporal discretization of the convective Cahn-Hilliard equation. The convection term is discretized explicitly without stabilization, yielding three key advantages: (1) unconditional stability, (2) preservation of the optimal convergence rate for piecewise constant approximations, and (3) a symmetric system after local elimination, enabling efficient solver via minimal residual methods. We establish optimal convergence rates in the $L^2$ norm for both the scalar and flux variables for any polynomial degree $k \geq 0$. To achieve optimal $L^2$-norm estimates, we introduce a specialized HDG elliptic projection operator and analyze its approximation properties. Within the HDG framework, local elimination is employed to reduce the degrees of freedom associated with the globally coupled unknowns, and the scalar variables exhibit superconvergence. Finally, numerical experiments validate the theoretical convergence rates and demonstrate the effectiveness of the proposed method.
Read the full abstract

All authors Gang Chen, Daozhi Han, Jiaxuan Liu, Yangwen Zhang, Dujin Zuo

Number Theory

Residues of a tropical zeta function for convex domains

We define an $\operatorname{SL}_n(\mathbb{Z})$-invariant tropical zeta function of a convex domain. In dimension 2 it admits boundary Dirichlet-series representation with summands indexed by Farey pairs. For $C^3$ strictly convex domains, it extends meromorphically to $\Re(s)>3/5$, holomorphic there except for a simple pole at $s=2/3$, with residue universally proportional to equiaffine perimeter. A Tauberian argument yields the $t^{1/3}$ wave-front lattice-perimeter asymptotic for $t\rightarrow 0$. In addition, for a special domain $L$, which is a limit shape of lattice polygons in a square, with its tropical zeta function being expressed in terms of Witten SU(3) zeta function, we compute the exact coefficient in the asymptotic expansion of the integer-averaged lattice point counting for the leading term $N^{1/2}$.
Read the full abstract

2604.21709 · 23 Apr · 116 pages, 13 figures and schematic diagrams. Main theorem: for smooth strictly convex planar domains, the tropical zeta function continues meromorphically to Re(s)>3/5 with simple pole at s=2/3; residue gives equiaffine perimeter. Includes Tauberian asymptotic for lattice perimeter of tropical wave fronts, and a detailed demonstration of a novel scheme for lattice point counting

Numerical Analysis

Segment convergence for super-linear stochastic functional differential equations by the truncated Euler-Maruyama method

Most existing literature focuses on pointwise convergence (i.e., convergence at a fixed time point) of numerical solutions for Stochastic functional differential equations (SFDEs). In contrast, this paper investigates the strong segment convergence (i.e., the strong order of convergence of the numerical segment process). For SFDEs with super-linear drift and diffusion coefficients, we employ the explicit truncated Euler-Maruyama (EM) scheme. First, we establish the uniform moment boundedness of the truncated EM solution over a finite time interval. Second, we derive the $L^2$-error estimate between the continuous numerical segment and the step numerical segment. Finally, we prove the strong convergence order of the numerical segment generated by the truncated EM. The results can be used to analyze invariant measures and ergodicity of numerical segment, and have important applications in practical problems such as path-dependent financial options. We also provide a numerical example to support the theoretical results.
Read the full abstract

Representation Theory

Lusztig constants and endoscopy

We prove that on a semisimple Lie algebra $\mathfrak{g}$ over a finite field of large characteristic, if a complex-valued invariant function $f$ and its Fourier transform $\hat f$ are both supported in the nilpotent cone of $\mathfrak{g}$, then $\hat f = \gamma^{-1}f$ for an explicit quadratic Gauss sum $\gamma$. Consequently, we determine a fourth root of unity appearing in various formulae of generalised Gel'fand–Graev characters, known as Lusztig constant, previously known in special cases due to works of Kawanaka, Digne–Lehrer–Michel, Waldspurger and Geck. As consequence, we show the validity of a conjecture of Letellier on the compatibility of Fourier transform with Deligne–Lusztig induction.
Read the full abstract

Algebraic Topology · Cross-listed from cs.CL

Fixation Sequences as Time Series: A Topological Approach to Dyslexia Detection

Persistent homology, a method from topological data analysis, extracts robust, multi-scale features from data. It produces stable representations of time series by applying varying thresholds to their values (a process known as a filtration). We develop novel filtrations for time series and introduce topological methods for the analysis of eye-tracking data, by interpreting fixation sequences as time series, and constructing “hybrid models” that combine topological features with traditional statistical features. We empirically evaluate our method by applying it to the task of dyslexia detection from eye-tracking-while-reading data using the Copenhagen Corpus, which contains scanpaths from dyslexic and non-dyslexic L1 and L2 readers. Our hybrid models outperform existing approaches that rely solely on traditional features, showing that persistent homology captures complementary information encoded in fixation sequences. The strength of these topological features is further underscored by their achieving performance comparable to established baseline methods. Importantly, our proposed filtrations outperform existing ones.
Read the full abstract

Numerical Analysis

Structure-preserving approximation for non-isothermal phase-field models in melt flow

This work presents a conforming finite-element scheme for the non-isothermal Allen-Cahn-Navier-Stokes system, incorporating periodic, closed, and thermal boundary conditions. The system comprises the incompressible Navier-Stokes equations coupled with the non-isothermal Allen-Cahn equation, which includes a non-conserved phase-field equation and a temperature equation. The proposed numerical scheme preserves entropy production exactly and maintains total energy conservation up to a negative numerical dissipation. Convergence tests in both space and time are conducted, and representative examples are provided to demonstrate the scheme's effectiveness.
Read the full abstract

Optimization and Control · Cross-listed from cs.RO

SLAM as a Stochastic Control Problem with Partial Information: Optimal Solutions and Rigorous Approximations

Simultaneous localization and mapping (SLAM) is a foundational state estimation problem in robotics in which a robot accurately constructs a map of its environment while also localizing itself within this construction. We study the active SLAM problem through the lens of optimal stochastic control, thereby recasting it as a decision-making problem under partial information. After reviewing several commonly studied models, we present a general stochastic control formulation of active SLAM together with a rigorous treatment of motion, sensing, and map representation. We introduce a new exploration stage cost that encodes the geometry of the state when evaluating information-gathering actions. This formulation, constructed as a nonstandard partially observable Markov decision process (POMDP), is then analyzed to derive rigorously justified approximate solutions that are near-optimal. To enable this analysis, the associated regularity conditions are studied under general assumptions that apply to a wide range of robotics applications. For a particular case, we conduct an extensive numerical study in which standard learning algorithms are used to learn near-optimal policies.
Read the full abstract

Logic

Model theory of class-sized logics

We study compactness and Löwenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary quantifiers and boolean connectives are banned. While model-theoretic properties fail for unrestricted class logics, this drastically changes in our more restricted setting. We show that model-theoretic properties of class logics characterise a wide array of large cardinals, and that some of them can even be obtained in ZFC. In particular, we give a characterisation of Weak Vopěnka's Principle and Ord is Woodin by downwards Löwenheim-Skolem properties, and a characterisation of Shelah cardinals by a compactness property of class-sized logics. We further strengthen many known results about properties of set-sized logics by studying how they transfer to class-sized extensions.
Read the full abstract

Optimization and Control

Optimal control of therapies related to an oxytaxis glioblastoma model

We propose and analyze an optimal control problem associated with a Keller-Segel type parabolic system with chemoattraction, modeling the glioblastoma growth in a bi-dimensional bounded domain, influenced by the presence of oxygen where the controls are two different (chemotherapy and antiangiogenic) therapies. The model considers the random diffusion of tumor cells and oxygen, the movement of cells towards the oxygen gradient (oxytaxis), and reaction terms describing the interaction between cells and oxygen. We establish a mathematical framework to analyze the existence and uniqueness of weak-strong solution of the model and subsequently we analyze an optimal control problem considering a cost functional that minimizes both the tumor growth and the oxygen concentration. We prove the existence of a global optimal solution and derive necessary first-order optimality conditions. Finally, we propose a methodology for approximating the optimal therapies. We use the gradient of the reduced cost functional through the adjoint scheme, and minimize the cost functional implementing the Adam gradient optimization method. Some numerical experiments are provided to demonstrate the effectiveness of the proposed scheme.
Read the full abstract

Information Theory

Hierarchical Joint Source-Channel Coding with Constrained Information Leakage

This paper studies the hierarchical joint source-channel coding with information leakage constraint in the first-phase reconstruction and distortion constraints. The receiver's access to the data varies and is evaluated by the quality of the side information. Due to the consideration of channel capacity limitation or the efficiency of the system performance, the encoder may send some additional information in Phase 1 that can only be decoded in Phase 2 with higher-quality side information. While this can optimize the overall performance, the additional information causes excessive information leakage. We provide general inner and outer bounds for the conditions such that a given distortion-leakage pair $(D_1,D_2,L)$ is achievable, together with a capacity-achieving condition.
Read the full abstract

Probability

Discontinuous transition in 2D Potts: II. Wetting and Brownian watermelon

The $q$-state Potts model is an archetypical model for various types of phase transitions. We consider it on the square grid and focus on the regime where it undergoes a discontinuous transition, that is $q>4$. At the transition point $T_c(q)$, there are exactly $q+1$ extremal Gibbs measures (pure phases): $q$ ordered (monochromatic) and one disordered (free). This work establishes for the first time the wetting phenomenon in a precise geometric form and in the entire regime of discontinuity $q>4$: at $T_c(q)$, between two ordered phases a disordered layer emerges and, in the diffusive scaling, its boundaries converge to a pair of Brownian motions conditioned not to intersect. This is starkly different from the subcritical ($T<T_c(q)$) behaviour. At $T_c(q)$, previous results (Bricmont–Lebowitz '87, Messager–Miracle-Sole–Ruiz–Shlosman '91) were limited to the construction and properties of the surface tension for large enough $q$. In a companion work, arXiv:2502.04129, we provide a detailed study of the Potts model under order-disorder Dobrushin conditions. That work also develops a “renewal picture” à la Ornstein-Zernike for a suitable percolation model, which plays a central part in our study of the Potts interfaces. The latter is the random-cluster representation of an Ashkin–Teller model (ATRC), and is related to the Potts model via a chain of couplings going through the six-vertex model. In the current work, we extend the analysis to a pair of interacting order-disorder interfaces forming the separation between the two ordered phases, and couple them to a pair of well-behaved random walks conditioned not to intersect. The construction of the coupling is based on rigorously deriving entropic repulsion between the two interfaces. We also prove convergence of interfaces in the FK-percolation model at $p_c(q)$ when $q>4$.
Read the full abstract

Combinatorics

Spectral Perspectives on FAT Graph Colorings

We investigate Fair and Tolerant (FAT) graph colorings, a coloring framework in which each vertex is allowed to share its color with a prescribed fraction of its neighbors, while the remaining neighbors are required to be distributed evenly among the other coloring classes. In particular, we determine the FAT chromatic number for all complete multipartite graphs, and we analyze the behavior of FAT colorings under several graph operations. Although spectral methods form the primary focus, several combinatorial arguments are included to complement the results.
Read the full abstract

Probability

Large deviations for non-irreducible Markov chains on Euclidean spaces

We establish the weak large deviations principle for empirical measures of Markov chains on $\mathbb R^d$ under mild assumptions. In particular, no irreducibility is assumed and the initial measure may be arbitrary. The proof is entirely self-contained and relies on subadditivity. In the absence of irreducibility, examples show that the rate function is not convex in general.
Read the full abstract

Algebraic Geometry

Normal Functions, Even Theta Characteristics and the Theta Divisor

Let $[C]$ be a point in the moduli space of curves $\mathcal{M}_g$, with $g>1$, lying outside a countable union of closed nowhere–dense subsets of an analytic parameter space for $\mathcal M_g$. Let $G \,\subset\, J(C)$ be a connected compact subgroup of real dimension $1$ of the Jacobian of $C$, and let $L$ be an even theta characteristic on $C$. We prove that $\{\zeta \, \in\, G\ \big\vert\,\ H^0(C,\, L \otimes \zeta)\,\not=\, 0 \}\, =\, \emptyset$ if and only if $L \otimes \zeta_G$ is an even theta characteristic on $C$, where $\zeta_G$ is the unique non-trivial point of $G$ of order two.
Read the full abstract

Algebraic Geometry

Triangulations and Maximal Cross-Ratio Degrees

The cross-ratio degree problem is about counting rational curves with $n$ marked points satisfying $n-3$ cross-ratio conditions. This problem has a tropical analogue which provides the same number, as shown by a correspondence theorem. In general, there are no closed formulas for this counting problem. In the special case of cross-ratio conditions given by triangulations, a formula was found by Silversmith via techniques of algebraic geometry. We study the cross-ratio problem given by triangulations in the tropical world. In addition to computing the cross-ratio degree by tropical means, we provide concrete solutions for the counting problem in arbitrary settings, thus answering the question by Silversmith. We also use the tropical recursive algorithm by Goldner to provide a new computational tool to compute cross-ratio degrees. With this, we can find the maximal cross-ratio degrees for $n=9,$ $n=10$ and $n=12,$ where the latter case also makes use of results about Kapranov degrees. Previously, these numbers were only known up to $n=8.$
Read the full abstract

Numerical Analysis

Optimal transfer operators for nonsymmetric two-grid methods

Algebraic Multigrid (AMG) methods have been proven to be effective solvers for large-scale linear algebraic systems $Ax = b$ with Hermitian positive definite (HPD) matrix $A$. For such problems the convergence in the $A$-norm is well understood, but for nonsymmetric indefinite systems fewer results exist. Recently, convergence results for more general $B$-norms induced by certain HPD matrices were established. There, orthogonal projections built by compatible transfer operators are used. Here, we present a theoretical framework for the convergence of nonsymmetric algebraic two-grid methods for arbitrary $B$-inner products and induced $B$-norms which naturally includes the HPD case and all recent results for the nonsymmetric case. For this purpose, we consider two different two-grid error operators with the first one being the natural generalization of the error operator in the HPD case. The second operator has been studied before and is simpler, but requires the additional assumption of normality in some inner product of the smoothing step $M^{-1}A$ to achieve convergence. We prove new convergence results, generalize some previous results and explain the differences and similarities of both operators together with the necessity of the normality. Moreover, we establish optimal compatible interpolation and restriction operators for both two-grid methods that minimize the error norm.
Read the full abstract

Optimization and Control

Robust mean field control: stochastic maximum principle and variational mean field games

We introduce a class of robust control problems formulated in min-max form, in which the principal agent is viewed as a central planner facing Nature. The agent's cost is a nonlinear function of all its possible realizations, encompassing in particular the mean field regime where the cost depends on the distribution of the states. In parallel, Nature favors the occurrence of outcomes that are least favorable to the agent, at an entropic cost. We establish existence and uniqueness of solutions under appropriate assumptions, including suitable convexity-concavity conditions, and derive a related stochastic maximum principle. We further address a corresponding class of robust variational mean field games in which the interaction term is subject to ambiguity, and prove existence and uniqueness of solutions.
Read the full abstract

Mathematical Physics

The KMS and GNS Spectral Gap of Quantum Markov Semigroups

We establish a relation between the exponential decay rates of quantum Markov semigroups with respect to different inner products. More precisely, it was conjectured by Fagnola, Poletti, Sasso and Umanità that for a Gaussian quantum Markov semigroup, the exponential decay rate with respect to the KMS inner product is bounded below by the exponential decay rate for the GNS inner product. We show that this is indeed the case and not limited to Gaussian quantum Markov semigroups, but holds for quantum Markov semigroups with a faithful normal invariant state on arbitrary von Neumann algebras. Additionally, the KMS inner product can be replaced by a whole class of inner products induced by operator monotone functions.
Read the full abstract

Representation Theory

The Representation Type of the Descent Algebras

Schocker classified the representation type of the descent algebra of type $\mathbb{A}$ over any field of characteristic zero. In an earlier paper, the authors extended this classification for type $\mathbb{A}$ to fields of positive characteristic. In this paper, we complete the classification for all other types except for $\mathbb{E}_8$. The proof for type $\mathbb{B}$ is entirely theoretical, while some small cases in type $\mathbb{D}$ and the exceptional types require computer computation to determine their Ext-quivers.
Read the full abstract

Optimization and Control

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.
Read the full abstract

Information Theory

Spatiotemporal 2-D Polar Codes over Non-Uniform MIMO Channels: A Reliability-Aware Construction Approach

With the increasing demand for ultra-reliable and low-latency communication (URLLC), spatiotemporal two-dimensional (2-D) channel coding has received growing interest. By leveraging the spatial degrees of freedom in massive multiple-input multiple-output (MIMO) systems, it shortens the time-domain blocklength, thereby reducing latency and enhancing reliability. However, existing spatiotemporal coding schemes typically assume uniform reliability across spatial streams. This assumption does not hold in practical MIMO channels, where the underlying propagation environment generally leads to unequal spatial-eigenmode gains and reliabilities, making the conventional Gaussian-approximation-based construction for 2-D polar codes less effective. This paper investigates spatiotemporal 2-D polar coding over non-uniform MIMO channels, where the spatial domain exhibits inherently heterogeneous signal-to-noise ratios (SNRs). We propose a reciprocal channel approximation (RCA)-based reliability-aware 2-D polar coding framework that accurately characterizes such heterogeneous SNRs without relying on log-likelihood-ratio distribution assumptions. Simulation results demonstrate that the proposed RCA-based spatiotemporal 2-D polar coding scheme achieves clear performance gains and strong robustness, confirming its effectiveness in jointly exploiting temporal and spatial polarization for URLLC in practical MIMO systems.
Read the full abstract

All authors Yaqi Li, Shuohan Zhang, Xiaohu You, Jiamin Li

General Mathematics

Curve Closest to Sphere

We propose a solution to the tenth of Professor Clark Kimberling's unsolved problems found on https://faculty.evansville.edu/ck6/integer/unsolved.html. We are required to find the parametric equations of a simple and closed curve $C$ on the unit sphere $S$ with arc-length $4 \pi$, that minimizes the mean arc-distance from $S$ to $C$. We give explicit definitions of the mean arc-distance from $C$ to $S$, $M$ and the mean arc-distance from $S$ to $C$, $\tilde{M}$. We show that these two quantities are not the same. We show that for all closed and simple curves $C$ of arc-length $4 \pi$ on $S$, $M$ is constant and is equal to $2 \pi^{2}$. Therefore all such curves minimize $M$. We show that in contrast, $\tilde{M}$ varies for different closed and simple curves $C$ of arc-length $4 \pi$ on $S$. We find such a curve that minimizes $\tilde{M}$.
Read the full abstract

Combinatorics

On the hamiltonicity problem of bicirculants: a reduction to cyclic Haar graphs

A bicirculant is a regular graph that admits an automorphism having two vertex-orbits of the same size. A bicirculant can be described as follows. Given an integer $m \ge 1$ and sets $R, S, T \subseteq \mathbb Z_m$ such that $R=-R$, $T=-T$, $0 \not\in R \cup T$ and $0 \in S$, the graph $B(m;R,S,T)$ has vertex set $V=\{u_0,\dots,u_{m-1},v_0,\dots,v_m-1\}$ and edge set $E=\{u_iu_{i+j}| \ i \in\mathbb Z_m, j \in R\} \cup \{v_iv_{i+j}| \ i \in\mathbb Z_m, j \in T\} \cup\{u_iv_{i+j}| \ i \in\mathbb Z_m, j \in S\}.$ Bicirculant graphs with $R=T=\emptyset$ are known as cyclic Haar graphs. In 2025 we conjectured that the only non-hamiltonian graphs among regular connected bicirculants of degree more than one are the generalized Petersen graphs $G(m,2)$ with $m \equiv 5 \pmod 6$. Recently we have verified the conjecture for bicirculants with $|S|\le 2$ and for bicirculants with $|R|=|T|$ odd. In this paper we show that the conjecture holds for all bicirculants with $|S| \le 3$ and for all bicirculants with $|S| \ge 4$ and $m/\gcd(m, S)$ even. As a byproduct of our results, we prove that every connected bicirculant graph on $2m$ vertices with $|S| \ge 4$ is hamiltonian for even $m< 9\, 240$, and for odd $m< 3\,465$. Finally, we show that the existence of a hamilton cycle in every connected cyclic Haar graph of valence at least $4$ implies that every connected bicirculant graph of valence at least $4$ is hamiltonian.
Read the full abstract