Peer Revenue Past citations are no guarantee of future returns

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 12 May

Statistics Theory · Cross-listed from cs.LG

MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound

Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incremental learning due to two coupled miscalibrations: (i) their split criterion grows unreliable as the class count K expands, and (ii) the absence of knowledge transfer at split time. Both failures share a common root: the range of Information Gain intrinsically scales with log2 K. Consequently, any Hoeffding-style confidence radius derived from it must inevitably grow with the class count, making a K-independent split criterion structurally impossible, taking away the potential benefits of applying streaming decision trees to continual learning. To fix this issue, we present MIST (McDiarmid Incremental Streaming Tree), which resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure. On standard and stress-test tabular streams, MIST is competitive with global parametric methods on near-Gaussian benchmarks and uniquely robust on non-Gaussian geometry where SOTA benchmarks collapse.
Read the full abstract

All authors Phu-Hoa Pham, Chi-Nguyen Tran, Nguyen Lam Phu Quy, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh

Algebraic Topology

Quillen-McCord theorem for persistence finite posets

In this paper, we establish a persistence version of the Quillen-McCord theorem for persistence finite posets. Given a map $f \colon P \rightarrow Q$ between persistence finite posets $P$ and $Q$ with weakly $\varepsilon$-contractible homotopy fibers, we provide an upper bound for the homotopy commutative interleaving distance between $P$ and $Q$.
Read the full abstract

Information Theory · Cross-listed from eess.SP

Unification of Signal Transform Theory

We unify the discrete Fourier transform (DFT), discrete cosine transform (DCT), Walsh-Hadamard, Haar wavelet, Karhunen-Loève transform (KLT), and several others along with their continuous counterparts (Fourier transform, Fourier series, spherical harmonics, fractional Fourier transform) under one representation-theoretic principle: each is the eigenbasis of every covariance invariant under a specific finite or compact group, with columns constructed from the irreducible matrix elements of the group via the Peter-Weyl theorem. The unification rests on the Algebraic Diversity (AD) framework, which identifies the matched group of a covariance as the foundational object of second-order signal processing. The data-dependent KLT emerges as the trivial-matched-group limit; classical transforms emerge as the cyclic, dihedral, elementary Abelian, iterated wreath, and hybrid wreath cases, with composition rules for direct, wreath, and semidirect products. The dihedral case is split by action: the Hartley basis is the matched transform of the dihedral group on the $M$-cycle (symmetric circulants), while the DCT belongs to the dihedral group on the even-reflected extension, with the finite-window AR(1) covariance an approximation to that class. A polynomial-time algorithm, the DAD-CAD relaxation cast as a double-commutator generalized eigenvalue problem, discovers the matched group of any empirical covariance without expert judgment, with noise-aware variants via the commutativity residual $\delta$ and algebraic coloring index $\alpha$. The fractional Fourier transform is treated as the metaplectic $SO(2)$ case, and a structural principle relates matched group size inversely to transform resolution. Modern applications (massive-MIMO, graph neural networks, transformer attention, 3D vision, brain connectivity, single-cell genomics, quantum informatics) are sketched with their matched groups.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Learning Weakly Communicating Average-Reward CMDPs: Strong Duality and Improved Regret

We study infinite-horizon average-reward constrained Markov decision processes (CMDPs) under the weakly communicating assumption. Our contributions are twofold. First, we establish strong duality for weakly communicating average-reward CMDPs over stationary policies with finite state and action spaces. Despite the absence of a linear programming formulation and the resulting nonconvexity under the weakly communicating setting, we show that strong duality still holds by carefully exploiting the geometric structure of the occupation measure set. Second, building on this result, we propose a primal–dual clipped value iteration algorithm for learning weakly communicating average-reward linear CMDPs. Our algorithm achieves regret and constraint violation bounds of $\widetilde{\mathcal{O}}(T^{2/3})$, improving upon the best known bounds, where $T$ denotes the number of interactions. Our approach extends clipped value iteration to the constrained setting and adapts it to a finite-horizon approximation, which stabilizes the dual variable and is crucial for achieving improved regret bounds. To analyze this, we develop a novel approach based on strong duality that enables the decomposition of the composite Lagrangian regret into separate bounds on regret and constraint violation.
Read the full abstract

Algebraic Geometry

K-theory of Gieseker variety and type A cyclotomic Hecke algebra

We give an algebraic description of the equivariant K-theory of Gieseker varieties. Our main result identifies the equivariant K-theory of the Gieseker space with the Jucys–Murphy center of the cyclotomic Hecke algebra, over the equivariant K-theory of a point. The construction is inspired by the proof of the Hikita–Nakajima conjecture for Gieseker spaces given by the first and third authors. We discuss consequences for the center of cyclotomic Hecke algebras and for specializations to q=1 and to roots of unity. In particular, we relate K-theory of affine type A quiver varieties with the centers of the corresponding blocks of specialized cyclotomic Hecke algebras. This last result strengthens the correspondences obtained by the second author in earlier work.
Read the full abstract

Algebraic Geometry

The equivariant Milnor-Witt motive of $\overline{\mathcal{M}}_{1,2}$

We provide a decomposition of the equivariant Milnor-Witt motive for the moduli space of stable curves $\overline{\mathcal{M}}_{1,2}$. As a result, the equivariant Chow-Witt ring $\widetilde{CH}^*(\overline{\mathcal{M}}_{1,2})$ is fully determined.

Mathematical Physics

When Certainty Emerges from Stochasticity: Hidden Attractor of Deterministic Motion

Macroscopic deterministic motion is traditionally interpreted as a result of statistical averaging. In this paper, we show that it is a strict geometric attractor of the contact flow. We reveal a contact constraint mechanism where the exponential amplification of probability gradients is exactly counterbalanced by the decay of second-order contact stiffness, forcing the macroscopic-microscopic coupling to vanish. This coupling acts as a Jacobi field, which decays in dissipative systems to enable deterministic focusing. We construct the contact potential via an invariant-measure construction, unifying the treatment of point attractors, limit cycles, and chaotic systems. Unlike the Mori-Zwanzig projection, this approach strictly conserves information, showing that determinism arises from the geometric reorganisation of information rather than its loss.
Read the full abstract

Rings and Algebras

Uniqueness Theorems for Twisted Steinberg Algebras

Given an ample Hausdorff groupoid $G$, a unital commutative ring $R$, and a discrete twist $(\Sigma,i,q)$, we establish a generalised uniqueness theorem for the twisted Steinberg algebra $A_R(G;\Sigma)$. By applying this theorem when $G$ is effective, we establish a Cuntz-Krieger uniqueness theorem as a corollary. We also prove a generalised graded uniqueness theorem for $A_R(G;\Sigma)$.
Read the full abstract

Analysis of PDEs

Averaging principle for a slow-fast stochastic nonlinear fractional Schrödinger equation

We establish an averaging principle for a structural multiscale stochastic nonlinear fractional Schrödinger system on the one-dimensional torus driven by a multiplicative Wiener noise. The slow component is governed by a fractional Schrödinger operator with a general polynomial nonlinearity, while the fast component evolves on a shorter time scale and exhibits dissipative diffusion, nonlinear interactions, and stochastic forcing. Under suitable dissipative assumptions, we have shown that, as the scale separation parameter tends to zero, the slow component converges strongly to an effective stochastic fractional Schrödinger equation. The effective drift is obtained by averaging the coupling term with respect to the unique invariant measure of the frozen fast dynamics. The proof relies on uniform a priori estimates, ergodicity of the fast equation, Hölder time regularity of the slow component obtained via a vanishing viscosity method, and a Khasminskii-type time discretization argument adapted to fractional dispersive operators. The analysis is technically challenging due to limited smoothing of the fractional Schrödinger semigroup and the presence of general polynomial nonlinearities, which are handled through refined estimates and viscosity approximation.
Read the full abstract

Differential Geometry

Structure of Torus Fibration Under the First Betti Number Restriction

We study torus bundles with affine structure groups. First, we establish a rigidity result under constraints on the first Betti numbers: If $ \text{b}_{1}(M)-\text{b}_{1}(N)=\dim M-\dim N $ holds for a torus bundle $M$ with an affine structure group over a closed manifold $N$, then $M$ can be classified. Second, we obtain some necessary and sufficient conditions for the topological splitting of principal torus bundles. These results improve the understanding of the geometry of collapsing sequences under the first Betti number constraints, thereby extending the prior work by Huang-Wang.
Read the full abstract

Information Theory · Cross-listed from cs.LG

VNDUQE: Information-Theoretic Novelty Detection using Deep Variational Information Bottleneck

Detecting out-of-distribution (OOD) samples is critical for safe deployment of neural networks in safety-critical applications. While maximum softmax probability (MSP) provides a simple baseline, it lacks theoretical grounding and suffers from miscalibration. We propose VNDUQE (VIB-based Novelty Detection and Uncertainty Quantification for Nondestructive Evaluation), which investigates novelty detection through the Deep Variational Information Bottleneck (VIB), which explicitly constrains information flow through learned representations. We train VIB models on MNIST with held-out digit classes and evaluate OOD detection using information-theoretic metrics: KL divergence and prediction entropy. Our results reveal complementary detection signals: KL divergence achieves perfect detection (100% AUROC on noise) on far-OOD samples (noise, domain shift), while prediction entropy excels at near-OOD detection (94.7% AUROC on novel digit classes). A parallel detection strategy combining both metrics achieves 95.3% average AUROC and 92% true positive rate at 5% false positive rate, which is a 32 percentage point improvement over baseline MSP (85.0% AUROC, 60.1% TPR). Compression via the information bottleneck principle ($\beta=10^{-3}$) reduces Expected Calibration Error by 38%, demonstrating that information-theoretic constraints produce fundamentally more reliable uncertainty estimates. These findings directly support active learning with expensive computational oracles, where well-calibrated novelty detection enables principled threshold selection for oracle queries.
Read the full abstract

Information Theory

The Entropy of Floating-Point Numbers

Here we present an analytic approximation for the entropy of floating-point numbers, along with bounds on the error of this approximation. It is well-known that the differential entropy is tightly linked to the discrete entropy of a uniformly quantized random variable. Our approximation uncovers a different quantity that provides this link for floating-point quantization. Additionally, we prove that the entropy of a floating-point quantized random variable is approximately unchanged under scaling. Closed-form expressions for the floating-point entropy of common distributions are provided and compared to exact results.
Read the full abstract

All authors Sultan M. Daniels, Samuel H. D'Ambrosia, Michael R. DeWeese, Anant Sahai

Information Theory

Recent Advances in Spatially Coupled Codes: Overview and Outlook

The concept of spatial coupling is among the most significant breakthroughs in coding theory over the past decade. The excellent waterfall and error floor performance of spatially coupled codes has positioned them as promising coding candidates for future communication and data storage systems. This article presents an overview of recent advances in spatially coupled codes. In particular, we first review several representative examples of recently proposed spatially coupled codes and highlight their unique features that make them appealing for different applications. Next, we discuss the useful properties of spatially coupled codes and how to design good spatially coupled codes. The article concludes with some future research directions and open problems.
Read the full abstract

All authors Min Qiu, Xiaowei Wu, Peng Kang, Lei Yang, Jinhong Yuan

Probability

A noisy min-max game on trees

We study a noisy version of a min-max type zero-sum game on the $d$-ary tree. Each edge of the tree is assigned an i.i.d.\ cookie, distributed uniformly on $\{+1,-1\}$. The game is played as follows: starting at the root, two players alternate turns in choosing a child to move to, with the game ending after each player took $n$ turns. Both players have full knowledge of the cookies on the whole tree. The cookies along the traversed edges are picked up and placed in a shared cookie jar. The first player's payoff is the sum of the cookies in the cookie jar, while the second player pays that sum. The value $V_n$ of the $n$-round game is the largest signed sum which can be guaranteed by the first player. We analyze the value $V_n$ and show that as $n \to \infty$, the value is tight for $d=2$, converges in distribution for $d \ge 3$, and converges almost surely for $d \ge 15$. Along the way, we prove various tightness and double exponential tail decay results. The analysis is a mix of percolation-type arguments for large $d$, and iterations on distributions combined with interval arithmetic for small $d$. For $d=2$ we prove the existence of a continuum of fixed points for this iteration, highlighting surprising qualitative differences with the case $d \ge 3$. The question of convergence for $d=2$ remains open.
Read the full abstract

Number Theory

Explicit determination of a class of permutation rational functions in any characteristic

In this paper, we make use of the classification results of low-degree permutation rational functions together with their geometric properties to investigate rational functions that induce permutations on the multiplicative subgroup mu_q+1, where q is a prime power. By carefully analyzing the structural conditions under which such rational functions permute muq+1, we obtain an explicit description of a broad class of permutation rational functions of small degree. As a direct application of these findings, we explicitly determine many permutation quadrinomials over Fq2 that are induced by degree-3 rational functions permuting muq+1. Our approach not only unifies and extends several existing results in the literature but also provides a concrete geometric perspective for characterizing permutation polynomials over Fq2.
Read the full abstract

Optimization and Control

Efficient and provably convergent end-to-end training of deep neural networks with linear constraints

Training a deep neural network with the outputs of selected layers satisfying linear constraints is required in many contemporary data-driven applications. While this can be achieved by incorporating projection layers into the neural network, its end-to-end training remains challenging due to the lack of rigorous theory and efficient algorithms for backpropagation. A key difficulty in developing the theory and efficient algorithms for backpropagation arose from the nonsmoothness of the solution mapping of the projection layer. To address this bottleneck, we introduce an efficiently computable HS-Jacobian to the projection layer. Importantly, we prove that the HS-Jacobian is a conservative mapping for the projection operator onto the polyhedral set, enabling its seamless integration into the nonsmooth automatic differentiation framework for backpropagation. Therefore, many efficient algorithms, such as Adam, can be applied for end-to-end training of deep neural networks with linear constraints. Particularly, we establish convergence guarantees of the HS-Jacobian based Adam algorithm for training linearly constrained deep neural networks. Extensive experiment results on several important applications, including finance, computer vision, and network architecture design, demonstrate the superior performance of our method compared to other existing popular methods.
Read the full abstract

Information Theory

A Decoding Algorithm for Composite Errors Consisting of Deletions and Insertions in Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes

This paper focuses on Hagiwara codes, which are quantum deletion-correcting codes constructed by the quantum Reed-Solomon codes. Although Hagiwara codes can correct composite errors consisting of deletions and insertions, an efficient decoding algorithm to such errors remains an open problem. In this paper, we provide a decoding algorithm to such errors for Hagiwara codes.
Read the full abstract

Numerical Analysis

A splitting scheme for the wave maps equation at low regularity

We prove convergence of a filtered Lie splitting scheme for the wave maps equation with low regularity initial data in dimension 3. The convergence analysis is performed in discrete Bourgain spaces, as has proved fruitful for the low regularity analysis of the equation in the continuous setting. An important difficulty here is that the analysis of wave maps at low regularity requires the use of the null structure of the system, this structure thus has to be preserved at the discrete level to get an effective stable low regularity scheme. Since the null structure involves time derivatives, the scheme has to be designed carefully. The presence of time derivatives in the nonlinearity then constitutes the most significant source of numerical error. Nonetheless, we are able to prove convergence of the scheme for all subcritical initial data in $H^s$, $s>d/2$.
Read the full abstract

Information Theory · Cross-listed from cs.AI

FibQuant: Universal Vector Quantization for Random-Access KV-Cache Compression

Long-context inference is increasingly a memory-traffic problem. The culprit is the key–value (KV) cache: it grows with context length, batch size, layers, and heads, and it is read at every decoding step. Rotation-based scalar codecs meet this systems constraint by storing a norm, applying a shared random rotation, and quantizing one coordinate at a time. They are universal and random-access, but they discard the geometry created by the normalization step. After a Haar rotation, a block of $k$ consecutive coordinates is not a product source; it is a spherical-Beta source on the unit ball. We introduce FibQuant, a universal fixed-rate vector quantizer that keeps the same normalize–rotate–store interface while replacing scalar tables by a shared radial–angular codebook matched to this canonical source. The codebook combines Beta-quantile radii, Fibonacci\,/\,Roberts–Kronecker quasi-uniform directions, and multi-restart Lloyd–Max refinement. We prove that the resulting vector code strictly improves on its scalar product specialization at matched rate, with a high-rate gain that separates into a cell-shaping factor and a density-matching factor. The same construction gives a dense rate axis, including fractional-bit and sub-one-bit operating points, without calibration or variable-length addresses. On GPT-2 small KV caches, FibQuant traces a memory–fidelity frontier from $5\times$ compression at $0.99$ attention cosine similarity to $34\times$ at $0.95$. End-to-end on TinyLlama-1.1B, it is within $0.10$ perplexity of fp16 at $4\times$ compression and has $3.6\times$ lower perplexity than scalar TurboQuant at $b = 2$ ($8\times$ compression), where scalar random-access quantization begins to fail.
Read the full abstract

Optimization and Control

A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization

We study bilevel optimization with a fixed polyhedral lower feasible set. Such problems are challenging for two reasons: active-set changes can make the upper objective nonsmooth, and existing hypergradient methods typically require lower-Hessian inversions or equivalent linear solves, which are computationally expensive. To address these issues, we adopt a logarithmic barrier smoothing of the lower problem to obtain a differentiable approximation of the constrained bilevel objective, and develop a proxy-gradient algorithm for the resulting barrier-smoothed surrogate. The algorithm uses only gradients of the upper and lower objectives; its only second-order object is the explicit logarithmic barrier Hessian determined by the fixed polyhedral constraints. Barrier smoothing restores differentiability, but Euclidean smoothness constants are not uniformly bounded near the boundary. We therefore develop a local Dikin-geometry analysis in which the barrier-metric provides an oracle-free curvature scale near the moving lower centers. This leads to barrier-aware schedules that keep the iterates inside locally well-behaved regions. For the barrier-smoothed objective, we prove stationarity rates of $\widetilde{O}(K^{-2/3})$ in the deterministic setting and $\widetilde{O}(K^{-2/5})$ under upper-level-only bounded stochastic noise after $K$ outer iterations, together with quantitative bias control as the barrier parameter decreases.
Read the full abstract

Algebraic Geometry

Geometric Construction of the McKay-Slodowy Correspondence

Let $G\subseteq \operatorname{SL}_2(\mathbb{C})$ be a finite group and let $H\trianglelefteq G$ be a normal subgroup. The McKay correspondence for $H$ says there is a one-to-one correspondence between nontrivial irreducible representations of $H$ and irreducible components of the exceptional locus of the minimal resolution of $\mathbb{C}^2/H$. We prove that this correspondence for $H$ is $G$-equivariant, and it induces a one-to-one correspondence between induced representations and push-forwards of exceptional curves. We also identify the intersection pairing of curves with the inner product of representations under this correspondence.
Read the full abstract

Combinatorics

A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs $C_{32}(R)$

This article is the $3^{rd}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10} and is a continuation of Part 2. Here, we obtain all 384 pairs of Type-2 isomorphic circulant graphs of order 32.

Information Theory

Beyond Polynomials: Optimal Locally Recoverable Codes from Good Rational Functions

Locally recoverable codes (LRCs) play an important role in distributed and cloud storage systems. The celebrated Tamo–Barg construction of optimal LRCs is based on the notion of good polynomials. In this paper, we introduce the notion of good rational functions as a natural generalization of good polynomials and develop a more general framework for constructing optimal LRCs. Since the attainable code lengths depend on the number of fibers of maximal size, we study this quantity using algebraic function field theory and Galois theory, identifying it with the number of totally split rational places in the associated function field extension. By analyzing the Galois closure, we establish an exact counting formula and derive sharp upper bounds for the number of ramified places and the genus, leading to explicit lower bounds for the number of totally split rational places. When the extension is Galois, we further characterize the number of totally split rational places in terms of the action of the Galois group on the projective line. Explicit constructions of good rational functions in both Galois and non-Galois settings are also presented. These rational functions yield optimal LRCs with lengths exceeding those attainable from good polynomials of the same degree, demonstrating the advantage of our framework over the classical Tamo–Barg construction.
Read the full abstract

All authors Hengfeng Liu, Sihem Mesnager, Chunming Tang, Xuemin Zheng

Optimization and Control

Exactness of the DNN Relaxation for Random Standard Quadratic Programs

We study the doubly nonnegative (DNN) relaxation of the standard quadratic optimization problem \[ \min\{x^\top Qx:\ x\in\Delta^{n-1}\},\qquad \Delta^{n-1}:=\{x\in\mathbb{R}_+^n:\ \mathbb{1}^\top x=1\}, \] for random symmetric matrices with independent diagonal and off-diagonal entries. Let $m_n:=\min_{1\le i\le n} Q_{ii}$ and set $M:=Q-m_nE$, where $E$ is the all-ones matrix. The negative off-diagonal entries of $M$ define a defect graph $G_n^-$. Under entrywise independence, absolute continuity, and the tail-decay condition $n^5\mathbb{E}[F_O(m_n)^4]\to 0$, where $F_O$ is the off-diagonal distribution function, we prove that with probability tending to one every defect component has size at most $4$. On this event, the shifted DNN value decomposes over defect components. Since the DNN and completely positive cones coincide in dimensions at most four, each local relaxation is exact. A finite KKT-candidate argument gives local uniqueness, and absolute continuity rules out ties, so the global DNN optimizer is unique and rank one. The graph estimate uses the fact that every connected component of size at least five contains a tree on exactly five vertices. For Gaussian orthogonal ensemble data, we prove the explicit bound \[ \mathbb{P}\bigl(\text{the DNN optimizer is unique and rank one}\bigr) \ge 1-K\frac{(\ln n)^2}{n^3}. \] On the same event, the exact optimizer can be recovered in $O(n^2)$ time by constructing the defect graph and solving constant-size local KKT systems. We also verify the tail condition for variance-tuned Gaussian Wigner models, heavy-tailed laws, and finite-lower-endpoint laws.
Read the full abstract

Spectral Theory · Cross-listed from cs.MA

Predictive Maps of Multi-Agent Reasoning: A Successor-Representation Spectrum for LLM Communication Topologies

Practitioners deploying multi-agent large language model (LLM) systems must currently choose between communication topologies such as chain, star, mesh, and richer variants without any pre-inference diagnostic for which topology will amplify drift, converge to consensus, or remain robust under perturbation. Existing evaluation answers these questions only post hoc and only for the task measured. We introduce a structural diagnostic for multi-agent LLM communication graphs based on the successor representation $M = (I - \gamma P)^{-1}$ of the row-stochastic communication operator, and we connect three of its spectral quantities, the spectral radius $\rho(M)$, the spectral gap $\Delta(M)$, and the condition number $\kappa(M)$, to three distinct failure modes. We derive closed-form spectra for the chain, star, and mesh under row-stochastic normalization, and validate the predictions on a 12-step structured state-tracking task with Qwen2.5-7B-Instruct over 100 independent trials. The condition number is a perfect rank-order predictor of empirical perturbation robustness ($r_s = 1.0$); the spectral gap partially predicts consensus dynamics ($r_s = 0.5$); and the spectral radius is perfectly inverted with respect to cumulative error ($r_s = -1.0$). We trace this inversion to a regime in which linear spectra are blind to non-contracting bias drift, and we propose an affine-noise extension of the predictive map that recovers the empirical ordering. We read this as a first step toward representational, drift-aware structural diagnostics for multi-agent LLM systems, sitting alongside classical spectral and consensus theory.
Read the full abstract

Numerical Analysis

Resolving the Gibbs Phenomenon in Fractional Fourier Series via Inverse Polynomial Reconstruction

The fractional Fourier series generalizes the classical Fourier series by introducing a rotation angle $\alpha$ in the time-frequency plane, but inherits the Gibbs phenomenon for piecewise smooth functions. Unlike the classical setting, the chirp modulation factor renders the fractional partial sum complex-valued, corrupting both real and imaginary components simultaneously and making direct adaptation of classical remedies insufficient. The Inverse Polynomial Reconstruction Method (IPRM) resolves the Gibbs phenomenon by enforcing that the Fourier coefficients of a Gegenbauer polynomial expansion match the given spectral data, rather than projecting the corrupted partial sum onto a polynomial basis. This paper extends the IPRM to fractional Fourier series for the first time. The fractional transformation matrix is derived and its conditioning is shown to be governed by an $\alpha$-independent Gram matrix, which reveals the dependence on the Gegenbauer parameter $\lambda$ and the polynomial degree $m$, while being entirely insensitive to the transform angle. An $L^{\infty}$ error estimate is established, guaranteeing exponential convergence for analytic functions. Numerical experiments on piecewise analytic test functions demonstrate complete elimination of the Gibbs phenomenon and confirm the theoretical predictions.
Read the full abstract

Probability

Convex order under majorization for projections of ell-p balls

Let $n\ge1$ and $1\le p\le2$, and let $X$ be uniformly distributed on the unit ball $B_p^n$ of $\ell_p^n$. We prove that if $(a_1^2,\ldots,a_n^2)$ majorizes $(b_1^2,\ldots,b_n^2)$, then $\langle b,X\rangle^2$ is dominated by $\langle a,X\rangle^2$ in convex order. For $p<2$ this gives a nontrivial comparison of the complete squared-projection laws, whereas at $p=2$ it reduces to equality by rotational invariance. The result strengthens known majorization inequalities for individual power moments and provides a single distributional source for several familiar projection inequalities. Its proof combines a two-dimensional hinge-function comparison with a preservation theorem for Beta–Rademacher perturbations, which lifts elementary majorization transfers through the Dirichlet representation of the uniform measure on $B_p^n$. The comparison is stable under a common independent radial scaling and therefore extends to $\ell_p$-radial measures with nonincreasing radial density. Consequences include simultaneous inequalities for moments, hinge functions, and Laplace transforms, together with Schur-convexity of Gaussian-regularized central-section densities. The range is sharp in the stated direction: for $p>2$, a support obstruction already occurs between a coordinate direction and a two-coordinate direction.
Read the full abstract

Combinatorics

Weyl Groups and the Modified Kostant Game

This paper presents a generalization of the Kostant game, a combinatorial framework originally for generating positive roots in Lie algebras. By introducing an arbitrary multi-vertex modification, we prove that the resulting game configurations naturally biject with the minimal length representatives of parabolic quotients W/W_J. This yields a dynamical and algorithmic perspective on reduced words. Finally, we apply this framework to derive a novel root counting identity, formalize the Coxeter-theoretic foundation for combinatorial approaches to the Mukai conjecture, establish the regularity of reduced word languages via finite state automata, and dynamically construct Standard Young Tableaux.
Read the full abstract

Combinatorics

Analytic Properties of Necklace Polynomials

The necklace polynomials \[ M_n(x)=\frac1n\sum_{d\mid n}\mu(d)x^{n/d} \] play a central role in discrete mathematics: they count aperiodic necklaces, enumerate monic irreducible polynomials over finite fields, and give the dimensions of homogeneous components of free Lie algebras. Despite their inherently discrete origins, we show that treating $M_n(x)$ as a function of a real variable $x$ unlocks surprising structural properties that answer natural enumerative questions. In this paper, we study $M_n(x)$ as a real-variable function and establish several new analytical and monotonicity properties. We prove that the normalized functions $M_n(x)/x^n$ and their higher normalized derivatives are strictly increasing on $[1,\infty)$. As a consequence, we show that the proportion of irreducible polynomials of fixed degree over $\mathbf F_q$ increases with $q$. We also establish strict growth with respect to the degree $n$ for $x\ge2$. In addition, we determine a sharp threshold for log-convexity: the sequence $\{M_n(x)\}_{n\ge2}$ is uniformly log-convex if and only if $x>8$. These results reveal unexpected analytic structure underlying necklace polynomials and show how real-variable methods can yield new information about discrete enumeration problems. For instance, it is shown that adding one more bead to a sufficiently long necklace will approximately increase the total number of primitive, rotationally distinct configurations by a factor of the number of available colors.
Read the full abstract

All authors Sunil K. Chebolu, Ján Mináč, Tung T. Nguyen, Nguyen Duy Tân

Combinatorics

A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs $C_n(R)$ w.r.t. $m$ = 2

This article is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be Adam's isomorphic if there exist some $a\in \mathbb{Z}_n^*$ such that $S = a R$ under arithmetic reflexive modulo $n$ \cite{ad67}. In 1970, Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$. The author \cite{v96} further modify the definition to $m$ and $m^3$ are divisors of $\gcd(n, r)$ and $n$, respectively, and $r\in R$. Using the modified definition \ref{d16}, we present our study on Type-2 isomorphism of circulant graphs $C_n(R)$ w.r.t. $m$ = 2. We reprove that $(i)$ $C_{16}(1,2,7)$ and $C_{16}(2,3,5)$ are Type-2 isomorphic w.r.t. $m$ = 2; $(ii)$ For $n \geq 2$, $k \geq 3$, $1 \leq 2s-1 \leq 2n-1$, $n \neq 2s-1$, $R$ = $\{2, 2s-1, 4n-(2s-1)\}$ and $S$ = $\{2, 2n-(2s-1), 2n+2s-1\}$, $C_{8n}(R)$ and $C_{8n}(S)$ are Type-2 isomorphic w.r.t. $m$ = 2, $n,s\in\mathbb{N}$; and $(iii)$ For $n \geq 2$, $1 \leq 2s-1 < 2s'-1 \leq [\frac{n}{2}]$, $0 \leq t \leq [\frac{n}{2}]$, $R$ = $\{2,2s-1, 2s'-1\}$ and $n,s,s'\in \mathbb{N}$, if $\theta_{n,2,t}(C_n(R))$ and $C_n(R)$ are isomorphic circulant graphs of Type-2 w.r.t. $m$ = 2 for some $t$, then $n \equiv 0~(mod ~ 8)$, $2s-1+2s'-1$ = $\frac{n}{2}$, $2s-1 \neq \frac{n}{8}$, $t$ = $\frac{n}{8}$ or $\frac{3n}{8}$, $1 \leq 2s-1 \leq \frac{n}{4}$ and $n \geq 16$ where $\theta_{n,m,t}$ is a transformation used to define Type-2 isomorphism of a circulant graph. At the end, we present a VB program POLY215.EXE which shows how Type-2 isomorphism w.r.t. $m$ = 2 of $C_{8n}(R)$ takes place for $R = \{2, 2s-1, 4n-(2s-1)\}$, $n \geq 2$ and $n,s\in {\mathbb N}$.
Read the full abstract