Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Sunday 22 March

Dynamical Systems

Rationality and computability of the covering radius for sofic shifts

The covering radius of a shift space is a quantity of interest for information-theoretic applications of data transmission over noisy channels. We prove that the covering radius of a primitive sofic shift is a rational number, and describe an algorithm to compute the covering radius from a labeled graph presentation.
Read the full abstract

Differential Geometry

On CR manifolds of CR dimension 1

We classify all maximal symmetry models of CR dimension 1, depending on their Bloom-Graham and Tanaka types, give coordinate realization to some of those models and prove a general extension principle.

Analysis of PDEs

Traveling wave solutions to a general incompressible Navier-Stokes-Fourier system with free boundary

We study traveling wave solutions to the free boundary problem associated to a generalized Navier-Stokes Fourier system, which models a viscous, incompressible, heat-conducting fluid. The fluid is assumed to occupy a horizontally infinite strip-like domain with flat rigid bottom and moving upper surface. The fluid is acted upon by gravity as well as external sources of bulk force and boundary stress and an external heat source. Additionally, we allow for temperature-dependent viscosity and capillary coefficients, the latter of which gives rise to Marangoni stresses on the free surface. We develop a small data well-posedness theory in Sobolev spaces that shows that if the sources of force, stress, and heat are small, then there exists a unique solution depending continuously on these data.
Read the full abstract

Algebraic Topology

Cocycles and positive functionals in higher cohomology

We establish and explore the correspondence between positive functionals and cocycles in higher unitary cohomology. We generalize the classical cocycle version of the Gelfand-Naimark-Segal construction to higher degrees and apply it to characterize vanishing of higher unitary cohomology as an extension property for positive functionals. We also prove that under mild conditions the algebraic spectral gap for the one sided Laplacian characterizes cohomological vanishing instead of reducedness of unitary cohomology
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Tiny but uniform improvements of adaptive BH procedures via compound e-values

After the seminal Benjamini–Hochberg (BH) procedure for controlling the false discovery rate (FDR) was proposed, dozens of papers have attempted to improve its power by adapting to the unknown proportion of nulls. We observe that most null-proportion estimates are simply compound e-values in disguise, and thus most adaptive FDR procedures can be interpreted as instances of the e-weighted BH (ep-BH) procedure of Ignatiadis, Wang, and Ramdas [2024], i.e., the BH procedure weighted by compound e-values. This lens helps us show that most existing procedures are inadmissible, and we provide uniform improvements to them. While the improvements are small in practice, they still come for free (without additional assumptions), and help unify the literature. We also use our "leave-one-out ep-BH method" to design a new method with finite-sample FDR control for the simultaneous t-test setting.
Read the full abstract

Algebraic Geometry

The intrinsic approach to moduli theory

Moduli theory has captured the imagination of algebraic geometers for at least two centuries. Up until the end of the 20th century, moduli spaces were constructed and studied by rigidifying the moduli problem using extrinsic data and applying geometric invariant theory. Over the last several decades, there has been a paradigm shift toward studying moduli problems intrinsically using the language of algebraic stacks. We highlight recent advances in this direction that have incorporated ideas from geometric invariant theory to develop a structure theory for algebraic stacks. In the ideal situation, it allows one to decompose an algebraic stack into simpler strata and construct moduli spaces corresponding to each stratum. In addition to surveying some previous applications of the theory, we take a forward-looking perspective on the field and identify questions for future research.
Read the full abstract

Probability · Cross-listed from cs.CC

Critical window for approximate counting in dense Ising models

We study the complexity of approximating the partition function of dense Ising models in the critical regime. Recent work of Chen, Chen, Yin, and Zhang (FOCS 2025) established fast mixing at criticality, and even beyond criticality in a window of width $N^{-1/2}$. We complement these algorithmic results by proving nearly tight hardness bounds, thus yielding the first instance of a sharp scaling window for the computational complexity of approximate counting. Specifically, for the dense Ising model we show that approximating the partition function is computationally hard within a window of width $N^{-1/2+\varepsilon}$ for any constant $\varepsilon>0$. Standard hardness reductions for non-critical regimes break down at criticality due to bigger fluctuations in the underlying gadgets, leading to suboptimal bounds. We overcome this barrier via a global approach which aggregates fluctuations across all gadgets rather than requiring tight concentration guarantees for each individually. This new approach yields the optimal exponent for the critical window.
Read the full abstract

Mathematical Physics

Homogenization of point interactions

We consider a non-relativistic quantum particle in $\mathbb{R}^d$, $d=2$ or $d = 3$, interacting with singular zero-range potentials concentrated on a large collection of points. We analyze the homogenization regime where the intensities of the singular potentials and the distances between the points simultaneously go to zero as their number grows, while the total interaction strength remains finite. Assuming that the singular potentials have negative scattering lengths and are uniformly distributed, we prove the strong resolvent convergence as $N \to \infty$ of the family of operators to a Schrödinger operator with a regular electrostatic potential. The result is obtained via $\Gamma$-converge of the associated quadratic forms. Moreover, in presence of an external trapping potential, the convergence is lifted to uniform resolvent sense.
Read the full abstract

Differential Geometry

Asymptotic Geometry of Four-Dimensional Steady Solitons

In this paper we study the behavior of the scalar curvature at infinity on complete noncompact steady gradient Ricci solitons. In dimension four, we assume that the canonical Ricci flow induced by the soliton is a weak $\kappa$-solution and that the soliton is not isometric to the Bryant soliton. In this setting, we identify the two edges of the soliton and prove that the scalar curvature decays at a linear rate away from these edges. Moreover, if the scalar curvature vanishes at infinity, then a stronger inequality holds and the asymptotic cone is a ray. In particular, our results apply to the four-dimensional steady solitons constructed by Lai.
Read the full abstract

Numerical Analysis

Arbitrarily High-Order Convergence of Wavelet-based Galerkin Scheme for 1D Elliptic Interface Problems

The solution $u$ of an elliptic interface problem in a domain $\Omega$ is often smooth away from the interface $\Gamma\subset \Omega$, but its gradient is discontinuous across $\Gamma$. Consequently, $u$ has low global regularity and generally does not belong to $H^{3/2}(\Omega)$. This paper studies 1D elliptic interface problems using wavelet methods. We propose a Galerkin method based on compactly supported biorthogonal wavelet bases on bounded intervals with approximation order $m$, for any integer $m \ge 2$. Our approach involves incorporating wavelet basis functions from higher scale levels to capture the singularity in the neighbourhood of the interface $\Gamma$. A principal contribution of this paper is a rigorous convergence analysis establishing the optimal orders $m-1$ in the $H^1(\Omega)$-norm and $m$ in the $L^2(\Omega)$-norm. The proof combines careful decay estimates for dual wavelet coefficients associated with wavelets supported away from the interface $\Gamma$ and with those supported in its neighborhood, wavelet characterizations of Sobolev spaces, and standard convergence arguments from the finite element method (FEM). Various numerical experiments are provided to verify the theoretical findings, including a special two-dimensional elliptic interface problem with vertical interface lines.
Read the full abstract

Analysis of PDEs

Quantitative unique continuation for elliptic equations with Hölder continuous potentials

We study quantitative unique continuation for second order elliptic equations with lower-order terms of Hölder regularity via a weighted frequency function method. We establish quantitative three-ball inequalities and corresponding vanishing-order bounds for Schrödinger equations with Hölder potentials and Hölder gradient terms, and corresponding results for elliptic equations with variable leading coefficients. Our results are quantitative with explicit dependence of Hölder norms in the three-ball inequalities. These fill in the gap for quantitative unique continuation between bounded potentials and $C^1$ potentials.
Read the full abstract

Probability

A Constructive Approach to $q$-Gaussian Distributions: $\alpha$-Divergence as Rate Function and Generalized de Moivre-Laplace Theorem

The Large Deviation Principle (LDP) and the Central Limit Theorem (CLT) are central pillars of probability theory. While their formulations are established under the i.i.d. assumption, the probabilistic foundation for power-law distributions has primarily evolved through descriptive models or variational principles, rather than a constructive derivation comparable to the classical binomial process. This paper establishes a constructive probabilistic framework for power-law distributions, proceeding from the nonlinear differential equation $dy/dx = y^q$ without assuming a specific distribution a priori. We build the algebraic and combinatorial foundations, which lead to a generalized binomial distribution based on finite counting. We prove the LDP for this generalized binomial distribution in the regime $0 < q < 1$, demonstrating that the $\alpha$-divergence is identified as the rate function, and clarify the breakdown of this macroscopic scaling for heavier tails ($q > 1$). This result connects our constructive framework to the structures of information geometry. Furthermore, we prove a generalized de Moivre-Laplace theorem, showing that the generalized binomial distribution converges to a heavy-tailed limit distribution (the $q$-Gaussian distribution). We derive that the scaling law follows the order of $n^{q/2}$ as a consequence of the underlying nonlinearity. These analytical results are numerically verified for distinct values of $q \in (0, 2)$. This framework provides a constructive basis that unifies the shift-invariant exponential family and the rescaling-invariant power-law family.
Read the full abstract

Combinatorics

Structural Redundancy in Subspace Network Coding via Atomic Decompositions

Random linear network coding (RLNC) provides a powerful framework for non-coherent communication, where reliable transmission requires correcting errors and erasures induced by network mixing and motivates the use of subspace codes. In this work, we introduce an atomic perspective on subspace coding by formalizing the notion of minimal atomic decompositions in the lattice L(V ) of subspaces of a finite-dimensional vector space over a finite field. We study the function N that assigns to each subspace the number of its minimal atomic decompositions and establish its key structural properties. Leveraging N, we define a new distance metric on L(V ) that refines classical subspace comparisons by capturing atomic-level overlap. We then introduce the Atomic Operator Channel, a transmission model for RLNC in which codewords are conveyed through atomic decompositions and corruption is modeled via atomic insertions and erasures. Within this framework, we prove a minimum-distance decoding guarantee for the induced metric. In the constant-dimension setting, we show that the classical unique-decodability condition under the subspace distance remains sufficient for unique decoding under the atomic metric.
Read the full abstract

Numerical Analysis

A Practical Mode-parallel Implementation of the (H-)Tucker Decomposition via Randomization

In the last decades, tensors have emerged as the right tool to represent multidimensional data in a compact yet informative manner. Moreover, it is well-known that by performing low-rank factorizations of such tensors one is often able to effectively unveil possible hidden structure in data, mainly due to unexpected dependencies among the different variables encoded in the given tensor. However, computing these factorizations is extremely energy-consuming and memory-demanding, especially for high-dimensional tensors, namely those with a large number of modes. In this paper we focus on two state-of-the-art tensor decompositions: the Tucker and H-Tucker decompositions. We propose novel numerical strategies able to perform these factorizations in a mode-parallel fashion, that is the operations required by the algorithm along all modes are performed in parallel. This is in contrast to what is achieved by many procedures available in the literature that parallelize some of the operations along each mode, e.g., tensor-times-matrix steps, while still visiting one mode at the time in a sequential manner. Our strategies make use of cutting-edge randomization techniques comprising fiber sampling and randomized range-finding steps. In case of Tucker decomposition, we provide upper bounds on the expected value of the error provided sufficiently large sampling parameters have been adopted. A panel of numerical results showcases the potential of our approach in reducing both the running time and the storage demand of computing Tucker and H-Tucker decompositions. Moreover, experiments carried out in HPC environments illustrate the good scaling of our mode-parallel approach.
Read the full abstract

All authors Martina Iannacito, Sascha Portaro, Davide Palitta, Claudio Arlandini, Domitilla Brandoni

Optimization and Control · Cross-listed from cs.CE

Hybrid Quantum-Classical Branch-and-Price for Intra-Day Electric Vehicle Charging Scheduling via Partition Coloring

The rapid deployment of electric vehicles (EVs) in public parking facilities and fleet operations raises challenging intra-day charging scheduling problems under tight charger capacity and limited dwell times. We model this problem as a variant of the Partition Coloring Problem (PCP), where each vehicle defines a partition, its candidate charging intervals are vertices, and temporal and resource conflicts are represented as edges in a conflict graph. On this basis, we design a branch-and-price algorithm in which the restricted master problem selects feasible combinations of intervals, and the pricing subproblem is a maximum independent set problem. The latter is reformulated as a quadratic unconstrained binary optimization (QUBO) model and solved by quantum-annealing-inspired algorithms (QAIA) implemented in the MindQuantum framework, specifically the ballistic simulated branching (BSB) and simulated coherent Ising machine (SimCIM) methods, while the master problem is solved by Gurobi. Computational experiments on a family of synthetic EV charging instances show that the QAIA-enhanced algorithms match the pure Gurobi-based branch-and-price baseline on small and medium instances, and clearly outperform it on large and hard instances. In several cases where the baseline reaches the time limit with non-zero optimality gaps, the QAIA-based variants close the gap and prove optimality within the same time budget. These results indicate that integrating QAIA into classical decomposition schemes are a promising direction for large-scale EV charging scheduling and related PCP applications.
Read the full abstract

All authors Peng Sun, Liang Zhong, Qing-Guo Zeng, Li Wang

Operator Algebras

Polynomials in $c$-free random variables with applications to free denoising

We study distributions of polynomials in conditionally free (c-free) random variables, a notion of independence for two-state noncommutative probability spaces introduced by Bozejko, Leinert and Speicher. To this end we establish recursive relations between the joint Boolean cumulants of c-free random variables, analogous to previously found recursions for Boolean cumulants of free random variables. The algebraic reformulation of these recursions on the free associative algebra provides an effective formal machinery for the computation of the moment generating functions and thus the distributions of arbitrary self-adjoint polynomials in c-free random variables. As an application of a recent observation, our approach can be used to determine conditional expectations of the form $E[a|P(a,b)]$, where $P(a,b)$ is a self-adjoint polynomial in free (in the sense of Voiculescu) random variables $a,b$. We illustrate this with an example where $P(a,b)=i[a,b]$. Finally we define orthogonal projections that formally play the role of conditional expectations in the framework of c-freeness and share some properties with the conditional expectations of free variables. In particular they can be used to re-derive by purely algebraic methods the formula of Popa and Wang for the $\Sigma$-transform for the c-free multiplicative convolution.
Read the full abstract

Combinatorics · Cross-listed from cs.CC

Classification of Non-redundancy of Boolean Predicates of Arity 4

Given a constraint satisfaction problem (CSP) predicate $P \subseteq D^r$, the non-redundancy (NRD) of $P$ is maximum-sized instance on $n$ variables such that for every clause of the instance, there is an assignment which satisfies all but that clause. The study of NRD for various CSPs is an active area of research which combines ideas from extremal combinatorics, logic, lattice theory, and other techniques. Complete classifications are known in the cases $r=2$ and $(|D|=2, r=3)$. In this paper, we give a near-complete classification of the case $(|D|=2, r=4)$. Of the 400 distinct non-trivial Boolean predicates of arity 4, we implement an algorithmic procedure which perfectly classifies 397 of them. Of the remaining three, we solve two by reducing to extremal combinatorics problems – leaving the last one as an open question. Along the way, we identify the first Boolean predicate whose non-redundancy asymptotics are non-polynomial.
Read the full abstract

Functional Analysis

Functions of pairs of commuting self-adjoint operators under relatively bounded perturbations

We study the behaviour of functions of pairs of commuting self-adjoint operators under perturbations by relatively bounded operators. We obtain analogs of our earlier results for functions of a single self-adjoint operator under relatively bounded perturbations. The main tool is double operator integrals
Read the full abstract

Classical Analysis and ODEs

Bidiagonal Factorization of Banded Recursion Matrices for Mixed-Type Multiple Orthogonal Polynomials

Given a banded matrix $\mathscr{T}_N$ with $p$ subdiagonals and $q$ superdiagonals arising from the Gauss–Borel factorization $\mathscr{M}_N = \mathscr{L}_N^{-1}\mathscr{U}_N^{-1}$ of a moment matrix, this paper constructs explicitly its bidiagonal factorization \[ \mathscr{T}_N = L_1 \cdots L_p\, U_q \cdots U_1. \] Bidiagonal factorizations of this type are central to the study of oscillatory banded matrices and to the spectral Favard theorem for multiple orthogonal polynomials The factorization is obtained via Christoffel transformations of the moment matrix. Provided that the perturbed moment matrices $\mathscr{M}_{N,(b,0)}$ and $\mathscr{M}_{N,(0,a)}$ admit a Gauss–Borel factorization, each bidiagonal factor is a quotient of the corresponding Gauss–Borel factors: \[ U_b = \mathscr{U}_{N,(b,0)}^{-1}\mathscr{U}_{N,(b-1,0)}, \qquad L_a = \mathscr{L}_{N,(0,a-1)}\mathscr{L}_{N,(0,a)}^{-1}. \] Explicit Christoffel-type formulas for the entries of the bidiagonal factors are then derived in terms of certain tau-determinants evaluated at the origin: \[ U_{b,n} = -\frac{\tau^B_{b-1,n}\,\tau^B_{b,n+1}} {\tau^B_{b-1,n+1}\,\tau^B_{b,n}}, \qquad L_{a,n+1} = -\frac{\tau^A_{a-1,n+2}\,\tau^A_{a,n}} {\tau^A_{a-1,n+1}\,\tau^A_{a,n+1}}. \] As an illustration, the theory is applied to the recurrence matrices of multiple Hahn orthogonal polynomials. For two weights the tetradiagonal case is handled via contiguous hypergeometric relations; for three weights, i.e. the pentadiagonal case, the direct hypergeometric representations are required. In both cases fully explicit bidiagonal factorizations are obtained.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Shape modes of $\mathbb{C}P^1$ vortices

In this paper we investigate the existence of internal modes of vortices in the gauged $\mathbb{C}P^1$ sigma model. We develop a clean geometric formalism that highlights the symmetries of the Jacobi operator, obtained from the second variation of the energy functional. The formalism and subsequent results fundamentally rely on the Bogomol'nyi decomposition of the energy functional, and can therefore be extended to other models with such a decomposition. We prove the existence of at least one shape mode for a general $\mathbb{C}P^1$ vortex solution on $\mathbb{R}^2$, and find numerically the shape modes and corresponding frequencies of a radially symmetric vortex. A surprising result is that the shape mode eigenvalues are very close to the scattering threshold, suggesting weakly bound shape modes could be characteristic of the $\mathbb{C}P^1$ model.
Read the full abstract

Geometric Topology

Crystallizations of generalized lens spaces

We present some natural crystallizations of the generalized lens spaces $L(p, q_1, \dots, q_n)$ for integers $p\geq 2$, $n\geq 1$ and integers $q_1, \dots, q_n$ relatively prime to $p$. These crystallizations are quotients of triangulations of the sphere $S^{2n+1}$.

Mathematical Physics · Cross-listed from hep-th

Dynamical symmetries of the Calogero-Coulomb model

We construct the dynamical symmetry of the quantum Calogero model with particle exchange in a confining Coulomb field. This symmetry is governed by the algebra $so(N+1,2)$, deformed by exchange (Dunkl) operators, with its invariant sector generated by the Dunkl angular momentum tensor and the modified Laplace-Runge-Lenz vector. The equidistant analogue of the Hamiltonian, with a linear spectrum, is expressed in terms of the conformal subalgebra $so(1,2)$. In addition, the wave functions of the Calogero-Coulomb Hamiltonian are classified into infinite-dimensional lowest-weight $so(1,2)$ multiplets.
Read the full abstract

Functional Analysis

On the Convergence of Numerical Index via Operator Openings and Ultraproducts

The numerical index of a Banach space is a geometric constant relating the numerical radius of bounded linear operators to their standard operator norm. In this paper, we study the continuity of the numerical index under two distinct notions of subspace convergence. First, we establish a full limit theorem in the operator opening topology: if $\{X_n\}_{n \in \mathbb{N}}$ and $X$ are closed subspaces of a Banach space $Y$ with $X_n \to X$ in the operator opening, then $\lim_{n \to \infty} n(X_n) = n(X)$. Second, we develop ultraproduct methods for the numerical index, proving that the numerical radius is exactly preserved by ultraproduct operators, i.e., $v((T_n)_{\mathcal{U}}) = \lim_{\mathcal{U}} v(T_n)$. As a consequence, we show that $n(X_{\mathcal{U}}) \le n(X)$ for every ultrapower $\mathcal{U}$.
Read the full abstract

Combinatorics

Parabolic distance in $\mathbb F_q^2$: a sharp exponent and new results

We study the parabolic variant of the Erd\H os–Falconer distance problem in finite fields. That is, if $q$ is odd, we seek size thresholds beyond which any subset $E\subset \mathbb F_q^2$ will determine many distinct parabolic distances. This problem has a rich history because the parabolic distance functional shares many properties with the standard distance functional, but exhibits many distinct behaviors. Here we begin with rather standard Fourier analytic arguments, but diverge into additive combinatorics to handle the central obstructions. We provide a suite of positive results and corresponding sharpness examples.
Read the full abstract

All authors Dao Nguyen Van Anh, Steven Senger, Dung The Tran, Le Anh Vinh

Combinatorics · Cross-listed from quant-ph

A Quantum Encoding of Traveling Salesperson Tours via Route Generation, Cost Phases, and a Reversible Valid-Permutation Oracle

For a traveling salesperson problem (TSP) of $n$ cities, we present a compact quantum encoding based on a time-register representation of tours. A candidate route is represented as a sequence of $n-1$ city labels over discrete time steps, with one fixed start city and the remaining cities encoded in binary registers. We describe three ingredients of the construction: uniform route generation over the route register, a reversible validity oracle, and a phase oracle that encodes the total tour cost. The validity oracle checks both that the non-start city labels form a permutation and, for incomplete graphs, that every directed edge used by the route exists. The cost oracle then accumulates the start-edge, intermediate-transition, and return-edge costs into a tour-dependent phase for valid routes. This yields a coherent superposition of candidate routes with feasibility and tour-length information embedded directly in the quantum state. The complete construction uses $\mathcal{O}(n\log n)$ qubits, while a naive implementation requires $\mathcal{O}(n^3\log_2 n)$ CX gates and $\mathcal{O}\!\left(n^3[\log_2 n+\log_2(1/\epsilon)]\right)$ $T$ gates, where $\epsilon$ denotes the target approximation precision. The encoding is compatible with amplitude amplification or spectral filtering techniques such as the quantum singular value transform (QSVT) or Grover's algorithm. However, due to the exponentially small fraction of valid tours, the overall complexity remains exponential even when combined with amplitude amplification.
Read the full abstract

Analysis of PDEs

Regularized Brascamp-Lieb inequalities via Optimal Transport and Study of Equality Cases

We consider regularized Brascamp-Lieb inequalities using the theory of optimal transportation, more precisely an anisotropic version of Caffarelli's contraction theorem. Furthermore, we provide a full picture concerning the issues of finiteness of the Brascamp-Lieb constant and of the existence of Gaussian extremizers, and completely determine all optimizers. The characterization of equality cases requires several new ideas to deal with difficulties, which do not appear for the non-regularized Brascamp-Lieb datum. Finally, we give applications retrieving Brascamp-Lieb-type inequalities with respect to the Gaussian measure and a regularized hypercontractivity inequality.
Read the full abstract

Number Theory

Proof of Sun's conjectures on hyperbolic cosine series via the Eisenstein–Lambert method

We prove two conjectures of Zhi-Wei Sun concerning hyperbolic cosine Lambert series. The first one is the evaluation, for integers $m\geq 0$, of \[ S_m=\sum_{n=1}^\infty\left( \frac{n^{2m}}{\cosh(\pi n)-1} -\frac{(2^{2m+1}-(-1)^{m(m+1)/2}2^{m+1}+4)n^{2m}}{\cosh(2\pi n)-1} +\frac{2^{2m+2}n^{2m}}{\cosh(4\pi n)-1} \right). \] We prove that \[ S_0=\frac1{12},\qquad S_1=\frac1{2\pi^2},\qquad S_m=0\quad (m>1). \] The second one is the quadratic identity \[ \sum_{n=1}^\infty \left( \frac{4}{(\cosh(\pi n)-1)^2} -\frac{55}{(\cosh(2\pi n)-1)^2} +\frac{16}{(\cosh(4\pi n)-1)^2} \right) = \frac{77-234/\pi}{72}. \] The proof uses an elementary level-four identity for Lambert series and its consequences for Eisenstein series. After differentiating this identity and evaluating it at $i/2$, the first conjecture follows from the modular transformation law for $E_{2m}$, with the cases $m=0$ and $m=1$ treated separately by the quasimodular transformation law for $E_2$. The second conjecture follows by rewriting the corresponding squared-kernel series as $(E_4+10E_2-11)/360$ and evaluating only the resulting linear combinations of $E_2$ and $E_4$ at $i/2$, $i$, and $2i$.
Read the full abstract

Combinatorics

Maximum packings in graphs forbidding given rainbow cycles

For graphs $F$ and $G$, $F$-multicolor Turán number of $G$, denoted by $\mathrm{ex}_F(n,G)$, is the maximum number of edge-disjoint copies of $F$ in an $n$-vertex graph such that there is no copy of $G$ whose edges come from distinct copies of $F$. We study this parameter mainly for cycle pairs and determine, up to asymptotic order, when $\mathrm{ex}_{C_k}(n,C_\ell)$ attains the three natural thresholds: the upper bound, the lower bound, and the $n^{2-o(1)}$ regime. In particular, for every odd $k\ge 5$ and every $t\ge 1$, where $C_k(t)$ denotes the $t$-blow-up of $C_k$, we prove $\mathrm{ex}_{C_k(t)}(n,C_{k-2})=n^2/(kt)^2+o(n^2),$ and establish a corresponding stability theorem. We further show that if $F$ and $G$ have the same odd girth $k$ and there exist homomorphisms from both $F$ and $G$ to $C_k$, then $\mathrm{ex}_F(n,G)=n^{2-o(1)}$; in particular, $\mathrm{ex}_{C_k}(n,C_k)=n^{2-o(1)}$ for odd $k$. In addition, we prove $\mathrm{ex}_{C_{2k+1}}(n,C_{2\ell+1})=O\!\left(n^{1+1/\lceil \ell/k\rceil}\right)$ for $\ell>k$ and $\mathrm{ex}_F(n,G)=O(\mathrm{ex}(n,G))$ for bipartite $G$. We particularly establish $\mathrm{ex}_{C_4}(n,C_4)=\frac{\sqrt{2}}{8}n^{3/2}+O(n)$, and give a sufficient condition under which the lower bound cannot be attained.
Read the full abstract

Number Theory

On mixed $b$-concatenations of Fibonacci and Lucas numbers that are Lucas numbers

Let $(F_n)_{n\ge0}$ and $(L_n)_{n\ge0}$ denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base $b$ mixed concatenations of a Fibonacci number and a Lucas number. Mathematically, we study of two Diophantine equations $L_n=b^dL_m+F_k$ and $L_n=b^dF_m+L_k$, where $d$ is the number of digits of $F_k$ or $L_k$ in base $b$. To tackle these equations, we combine tools from Diophantine approximation on non-zero linear forms in logarithms and reduction methods based on continued fractions. This allows us to prove that only finitely many such Lucas numbers exist.
Read the full abstract