Searcharxiv⌕ Search

arXiv subjects

Max A. Alekseyev

Publications and source records attributed to Max A. Alekseyev.

At least 19 recordsLinked to original sources
arXiv2026

Congruence Jumping in Polynomial Divisibility Systems: Arithmetic Structure and Solution Sets

Let $A$ and $B$ be polynomials with integer coefficients. We study nonzero integer solutions of $$y\mid A(x),\qquad x\mid B(y),$$ using quotient transformations that may change the polynomial pair. We call this process \emph{congruence jumping}. We establish a general reciprocal-polynomial rule governing such jumps, without coprimality, monicity, or unit assumptions, and give exact criteria for when the resulting polynomial states can be normalized integrally. Companion-surface identities provide a mechanism for constructing infinite integral quotient chains, including an explicit mixed-degree example. The quadratic case is considerably more rigid. We obtain a quantitative denominator bound for finite chains, classify the exceptional nonconstant one-sided infinite chains with nonintegral conic parameter, and show that changing quadratic states reduce to ordinary Vieta dynamics on a fixed conic. We further construct a genuinely nonunit recurrent four-cycle with infinitely many positive integral points and show that its dynamics admits a uniform Pell-type linearization. A motivating nonunit divisibility system is analyzed through Pell orbits and changing-state ladders. Finally, an independent relation-lattice criterion reduces certain solution sets to a finite divisor search.

math.NT↗
arXiv2026

Toeplitz multiplication and graded factorization of determinant recurrences

We study how determinant recurrences of banded Toeplitz matrices behave when their Laurent symbols are multiplied. Two classical structures underlie the problem. Clean banded Toeplitz determinants have a root-product description of their recurrences, while a product of two finite Toeplitz sections differs from the finite section of the product by finite-rank corner corrections. We connect these structures by identifying multiplication-induced boundary defects with exterior-degree sectors of the determinant recurrence. To each polynomial core we associate recurrence polynomials for all exterior degrees. Multiplication of cores becomes a graded convolution via composed products, while complementary degrees are related by a scaled reciprocal duality. On the matrix side, one-sided factors produce a defect filtration whose successive pieces are exactly these sectors. For general two-sided factors, independently weighting the two corner corrections gives an interval filtration: increasing either defect order adds one adjacent sector, and the cumulative recurrences are generically minimal. The multiplication-induced same-corner minors used in these filtrations lie in the standard row-column state module, whereas cross-corner imbalance corresponds instead to Laurent recentering. Opposite Laurent recenterings realize the individual sectors directly, and for several factors the admissible recenterings form an explicit lattice polytope. The pentadiagonal case gives the basic $1+4+1$ decomposition. The resulting framework gives a factor-level description of how finite-section boundary effects generate the recurrence spectrum of structured banded Toeplitz products.

math.RA↗
arXiv2026

Symmetry reductions and recurrence degrees for banded Toeplitz determinants and permanents

This paper studies symmetry-induced reductions of scalar recurrence complexity for balanced banded Toeplitz determinants and permanents. Three mechanisms emerge: determinant state and spectral compression, exceptional permanent--determinant conversion, and symmetries of permanent state spaces. For symmetric determinants, straightening reduces the row-column states from $\binom{2m}{m}$ to the Catalan number $C_{m+1}$; primitive symplectic weight compression then leaves $(3^m+1)/2$ distinct autonomous modes. Skew symmetry has a parallel compound/Hodge explanation: the middle exterior representation splits into two Hodge halves of dimension $\binom{2m}{m}/2$, the one-step compound transfer exchanges the halves, and its two-step restriction has $3^{m-1}$ generic ternary modes. Thus the full skew bound is $2\cdot3^{m-1}$. Widom--Hankel arguments prove generic scalar minimality in both symmetry classes, and every even skew Toeplitz determinant admits an explicit half-size square factorization. For the zero-diagonal pentadiagonal support, a Pólya--Kasteleyn signing converts every permanent to a determinant. Among consecutive zero-diagonal two-sided bands, universal entrywise conversion---and separately Toeplitz diagonal-wise conversion---occurs only in the Hessenberg families and this pentadiagonal case. Paired renewal identities recover all restored-diagonal determinant and permanent layers. For permanents, transposition gives the open symmetric bound $(\binom{2m}{m}+2^m)/2$, while cyclic defect-sector pairing gives $(4^m+\binom{2m}{m})/2$. Skew-symmetry forces odd-size vanishing and corresponding even-subsequence bounds. In semibandwidth two the open symmetric bound is generically sharp; higher-semibandwidth permanent minimality is left separate from the symmetry reductions proved here.

math.RA↗
arXiv2026

Constructive recurrences for determinants and permanents of banded Toeplitz matrices

For fixed nonnegative integers $m_1,m_2$, let $A_n=(a_{j-i})_{i,j=1}^n$ be the leading $n\times n$ section of a Toeplitz matrix with lower and upper semibandwidths $m_1$ and $m_2$. We give two constructive Laplace-expansion methods for scalar recurrences of $\det A_n$ and $\perm A_n$. The increasing-rows method eliminates a fixed family of boundary cofactors and gives recurrence order at most $d=\binom{m_1+m_2}{m_1}$ for both sequences. The row-column method closes normalized boundary minors recursively and packages them in a sparse transfer matrix. Its reachable states are classified exactly: level $j$ is indexed by a pair of $j$-subsets of $[m_1]$ and $[m_2]$. Hence the transfer dimension is $d$, and we obtain an explicit formula for the number of nonzero transitions. For determinants, the complementary cofactors of the increasing-rows construction are coordinates of the classical compound companion representation. The independently constructed row-column transfer has the Widom characteristic polynomial and is generically similar to the compound transfer. Thus the order $d$ recurrence is generically minimal for the unrestricted fixed-band determinant family. For permanents the same state graph gives the binomial upper bound, without a general minimality claim. The pentadiagonal case recovers Sweet's order-six determinant recurrence and its permanent analogue, while the one-superdiagonal family gives closed scalar recurrences and rational generating functions. Position-dependent band weights preserve the finite state graph but replace the constant transfer by a cocycle. For cyclic determinants, Fourier diagonalization produces all subset products of the symbol roots and a generically minimal annihilator of degree $2^{m_1+m_2}$, corresponding to the passage from one exterior degree to the full exterior algebra.

math.RA↗
arXiv2026

Cycle-Structure Generating Functions for Special Breakpoint Graphs

Breakpoint graphs originate in comparative genomics, where their alternating cycles encode relationships between genomes. We study a constrained class of three-colored breakpoint graphs associated with permutations and develop cycle-refined generating functions for two extremal families. These families have a natural topological interpretation: their canonical surfaces are, respectively, the sphere and the projective plane. The spherical family is characterized by noncrossing configurations, while the projective-plane family admits a different decomposition involving a distinguished family of Möbius ladders. The resulting generating-function equations retain the full cycle structure but nevertheless admit substantial reductions. This leads to explicit Catalan-weighted evaluations, polynomiality results for refined cycle statistics, and a connection between a natural diagonal specialization and noncrossing trees. The two topological families exhibit markedly different combinatorial mechanisms, providing complementary examples of how local transformations of breakpoint graphs can control refined permutation enumerations. As a further application, the same Catalan-weighted sums arise in asymptotic unitary-Weingarten expansions for entanglement of random Gaussian states in linear optics. The combinatorial results determine the leading and constant-order moment polynomials entering the Rényi entropy expansion, with the projective-plane contribution giving the finite-size constant correction.

math.CO↗
arXiv2026

Möbius Covariance and Coefficient Duality: From Bernoulli Series to Enumerative Applications

A coefficient duality first encountered for formal Bernoulli series is shown to be equivalent to a general Möbius covariance law for formal power series. We obtain a structural characterization, an eigenspace interpretation, and a weighted form of this duality. The Catalan convolution and Chebyshev identities from the motivating Bernoulli setting extend to arbitrary Möbius-covariant families and yield a general Ramanujan-type summation formula encompassing consecutive half-integer powers. The framework also recovers classical Bernoulli and Euler recurrences and produces recurrence families for colored matchings and generalized central trinomial coefficients, with further realizations from reflection-symmetric Appell sequences and Gorenstein Hilbert series.

math.CO↗
arXiv2026

Classification of integral modular data up to rank 13

This paper classifies the modular data of integral modular fusion categories up to rank 13, and integral half-Frobenius fusion rings up to rank 12. We establish that every perfect case within these bounds is trivial. Furthermore, we refine the non-pointed odd-dimensional modular data at ranks below 25 to exactly three items, all of rank 17, FPdim 225, and type [[1,3],[3,8],[5,6]], filling existing literature gaps. For rank 25, we narrow the perfect case to three open types. Our core insight is that Egyptian fractions, typically used to list possible types, can be chosen with squared denominators. We develop several type criteria as initial filters. To construct the fusion rings, we solve dimension and associativity equations utilizing custom-built features in Normaliz. S-matrices are generated by self-transposing the character table, and T-matrices are derived by solving the Anderson-Moore-Vafa equations, concluding with the verification of extended modular data axioms. From rank 13 onward, types are restricted by modular-specific properties involving universal grading, congruence representations of the modular group, and Galois action. This establishes critical arithmetic constraints: up to rank 21, a prime divisor of the global FPdim cannot exceed the rank, and up to rank 15 (non-pointed case), it cannot exceed half the rank. Ultimately, we reduce the rank 14 classification to 35 possible types, 8 of which are non-perfect.

math.QA↗
arXiv2026

Generalization of Ramanujan's formula for sums of half-integer powers of consecutive integers via formal Bernoulli series

Faulhaber's formula expresses the sum of the first $n$ positive integers, each raised to an integer power $p\geq 0$, as a polynomial in $n$ of degree $p+1$. Ramanujan expressed this sum for $p\in\{\frac12,\frac32,\frac52,\frac72\}$ as the sum of a polynomial in $\sqrt{n}$ and a certain infinite series. In the present work, we explore the connection to Bernoulli polynomials, and by generalizing those to formal series, we extend the Ramanujan result to all positive half-integers $p$.

math.NT↗
arXiv2026

Computing bounded solutions to linear Diophantine equations with the sum of divisors

We propose an efficient computational method for finding all solutions $n\leq U$ to the Diophantine equation $aσ(n) = bn + c$, where integer coefficient $a,b,c$ and an upper bound $U$ are given. Our method is implemented in SageMath computer algebra system within the framework of recursively enumerated sets and natively benefits from MapReduce parallelization. We used it to discover new solutions to many published equations and close gaps in between the known large solutions, including but not limited to hyperperfect and $f$-perfect numbers, as well as to significantly lift the existence bounds in open questions about quasiperfect and almost-perfect numbers.

math.NT↗
arXiv2025

Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations

We address the problem of finding sets of integers of a given size with a maximum number of pairs summing to powers of $2$. By fixing particular pairs, this problem reduces to finding a labeling of the vertices of a given graph with pairwise distinct integers such that the endpoint labels for each edge sum up to a power of $2$. We propose an efficient algorithm for this problem, which at its core relies on another algorithm that, given two sets of linear homogeneous polynomials with integer coefficients, computes all variable assignments to powers of $2$ that nullify polynomials from the first set but not from the second. With the proposed algorithms, we determine the maximum size of graphs of order $n$ that admit such a labeling for all $n\leq 21$, and construct the maximum admissible graphs for $n\leq 20$. We also identify the minimal forbidden subgraphs of order $\leq 11$, whose presence prevents the graphs from having such a labeling.

math.CO↗
arXiv2025

Classifying integral Grothendieck rings up to rank 5 and beyond

In this paper, we define a Grothendieck ring as a fusion ring categorifiable into a fusion category over the complex field. An integral fusion ring is called Drinfeld if all its formal codegrees are integers dividing the global Frobenius--Perron dimension. Every integral Grothendieck ring is necessarily Drinfeld. Using the fact that the formal codegrees of integral Drinfeld rings form an Egyptian fraction summing to 1, we derive a finite list of possible global FPdims for small ranks. Applying Normaliz, we classify all fusion rings with these candidate FPdims, retaining only those admitting a Drinfeld structure. To exclude Drinfeld rings that are not Grothendieck rings, we analyze induction matrices to the Drinfeld center, classified via our new Normaliz feature. Further exclusions and constructions involve group-theoretical fusion categories and Schur multipliers. Our main result is a complete classification of integral Grothendieck rings up to rank 5, extended to rank 7 in odd-dimensional and noncommutative cases using Frobenius--Schur indicators and Galois theory. Moreover, we show that any noncommutative, odd-dimensional, integral Grothendieck ring of rank at most 22 is pointed of rank 21. We also classify all integral 1-Frobenius Drinfeld rings of rank 6, identify the first known non-Isaacs integral fusion category (which turns out to be group-theoretical), classify integral noncommutative Drinfeld rings of rank 8, and integral 1-Frobenius MNSD Drinfeld rings of rank 9. Finally, we determine the smallest-rank exotic simple integral fusion rings: rank 4 in general, rank 6 in the Drinfeld case, and rank 7 in the 1-Frobenius Drinfeld case.

math.QA↗
arXiv2024

A family of permutationally invariant quantum codes

We construct a new family of permutationally invariant codes that correct $t$ Pauli errors for any $t\ge 1$. We also show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes as particular cases, which also admit transversal gates. In many cases, the codes in the new family are shorter than the best previously known explicit permutationally invariant codes for Pauli errors and deletions. Furthermore, our new code family includes a new $((4,2,2))$ optimal single-deletion-correcting code. As a separate result, we generalize the conditions for permutationally invariant codes to correct $t$ Pauli errors from the previously known results for $t=1$ to any number of errors. For small $t$, these conditions can be used to construct new examples of codes by computer.

quant-ph↗
arXiv2024

Enumeration of Payphone Permutations

The desire for privacy significantly impacts various aspects of social behavior as illustrated by people's tendency to seek out the most secluded spot when multiple options are available. In particular, this can be seen at rows of payphones, where people tend to occupy an available payphone that is most distant from those already occupied. Assuming that there are n payphones in a row and that n people occupy payphones one after another as privately as possible, the resulting assignment of people to payphones defines a permutation, which we will refer to as a payphone permutation. In the present study, we consider different variations of payphone permutations and enumerate them.

math.CO↗
arXiv2022

On Kaprekar's Junction Numbers

A base-b junction number u has the property that there are at least two ways to write it as u = v + s(v), where s(v) is the sum of the digits in the expansion of the number v in base b. For the base-10 case, Kaprekar in the 1950's and 1960's studied the problem of finding K(n), the smallest u such that the equation u=v+s(v) has exactly n solutions. He gave the values K(2)=101, K(3)=10^13+1, and conjectured that K(4)=10^24+102. In 1966 Narasinga Rao gave the upper bound 10^1111111111124+102 for K(5), as well as upper bounds for K(6), K(7), K(8), and K(16). In the present work, we derive a set of recurrences which determine K(n) for any base b and in particular imply that these conjectured values of K(n) are correct. The key to our approach is an apparently new recurrence for F(u), the number of solutions to u=v+s(v). We illustrate our method by computing the values of K(n) for n <= 16 and bases b <= 10, and show that for each base K(n) grows as a tower of height proportional to log_2(n). Rather surprisingly, the values of K(n) for the base-5 problem are determined by the classical Thue-Morse sequence, which leads us to define generalized Thue-Morse sequences for other bases.

math.NT↗
arXiv2021

Three Cousins of Recaman's Sequence

Although 10^230 terms of Recaman's sequence have been computed, it remains a mystery. Here three distant cousins of that sequence are described, one of which is also mysterious. (i) {A(n), n >= 3} is defined as follows. Start with n, and add n+1, n+2, n+3, ..., stopping after adding n+k if the sum n + (n+1) + ... + (n+k) is divisible by n+k+1. Then A(n)=k. We determine A(n) and show that A(n) <= n^2 - 2n - 1. (ii) {B(n), n >= 1} is a multiplicative analog of {A(n)}. Start with n, and successively multiply by n+1, n+2, ..., stopping after multiplying by n+k if the product n(n+1)...(n+k) is divisible by n+k+1. Then B(n)=k. We conjecture that log^2 B(n) = (1/2 + o(1)) log n loglog n. (iii) The third sequence, {C(n), n >= 1}, is the most interesting, because the most mysterious. Concatenate the decimal digits of n, n+1, n+2, ... until the concatenation n||n+1||...||n+k is divisible by n+k+1. Then C(n)=k. If no such k exists we set C(n)=-1. We have found k for all n <= 1000 except for two cases. Some of the numbers involved are quite large. For example, C(92) = 218128159460, and the concatenation 92||93||...||(92+C(92)) is a number with about 2*10^12 digits. We have only a probabilistic argument that such a k exists for all n.

math.NT↗
arXiv2019

Orienting Ordered Scaffolds: Complexity and Algorithms

Despite the recent progress in genome sequencing and assembly, many of the currently available assembled genomes come in a draft form. Such draft genomes consist of a large number of genomic fragments (scaffolds), whose order and/or orientation (i.e., strand) in the genome are unknown. There exist various scaffold assembly methods, which attempt to determine the order and orientation of scaffolds along the genome chromosomes. Some of these methods (e.g., based on FISH physical mapping, chromatin conformation capture, etc.) can infer the order of scaffolds, but not necessarily their orientation. This leads to a special case of the scaffold orientation problem (i.e., deducing the orientation of each scaffold) with a known order of the scaffolds. We address the problem of orientating ordered scaffolds as an optimization problem based on given weighted orientations of scaffolds and their pairs (e.g., coming from pair-end sequencing reads, long reads, or homologous relations). We formalize this problem using notion of a scaffold graph (i.e., a graph, where vertices correspond to the assembled contigs or scaffolds and edges represent connections between them). We prove that this problem is NP-hard, and present a polynomial-time algorithm for solving its special case, where orientation of each scaffold is imposed relatively to at most two other scaffolds. We further develop an FPT algorithm for the general case of the OOS problem.

q-bio.GN↗
arXiv2018

On Enumeration of Dyck--Schröder Paths

We address the problem of enumerating paths in square lattices, where allowed steps include (1,0) and (0,1) everywhere, and (1,1) above the diagonal y=x. We consider two such lattices differing in whether the (1,1) steps are allowed along the diagonal itself. Our analysis leads to explicit generating functions and an efficient way to compute terms of many sequences in the Online Encyclopedia of Integer Sequences, proposed by Clark Kimberling almost two decades ago.

math.CO↗