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)

Wednesday 13 May

Logic

The modal theory of linear orders

I study the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. I prove modality elimination for embeddings and monotone maps, show that condensations make scatteredness modally definable, and compute exact propositional modal validities in the main cases.
Read the full abstract

General Mathematics

Directed Q-Analysis and Directed Higher-Order Connectivity on Digraphs: A Quantitative Approach

Traditional graph analysis focuses on nodes and edges, that is, pairwise relationships. Yet many real-world networks, including biological, social, and communication networks, involve higher-order relationships in which multiple nodes interact simultaneously. This has led many to develop network topology analysis methods based on higher-order structures and higher-order connectivity, seeking to reveal complex interactions beyond node pairs. Many of the latter address only undirected networks. To overcome this, we lay out a mathematical formalism resting on directed clique complexes constructed from directed graphs (their "higher-order structures" or "simplicial structures”), stressing the interrelations between directed cliques (their "directed higher-order connectivities”), leading towards a more complete directed Q-analysis that allows quantifying, characterizing, and comparing similarities involving simplicial structures.
Read the full abstract

All authors Heitor Baldo, Luiz A. Baccalá, André Fujita, Koichi Sameshima

Combinatorics

Counterexamples to a Conjecture on Laplacian Ratios of Trees

For a graph \(G\) with no isolated vertices, its Laplacian ratio is defined as \[ \pi(G)=\frac{\operatorname{per}(L(G))}{\prod_{v\in V(G)} d(v)}, \] where \(L(G)\) is the Laplacian matrix of \(G\), \(d(v)\) is the degree of \(v\), and \(\operatorname{per}\) denotes the permanent. Brualdi and Goldwasser asked for the maximum value of \(\pi(T)\) among trees \(T\) with a fixed number of vertices. Wu, Dong and Lai recently proposed a conjectural answer to this problem. We give infinite families of counterexamples to their conjecture.
Read the full abstract

Information Theory

Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds

We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices. Finally, simulation results for short- to medium-length UB codes (block lengths ranging from a few hundred to approximately $10^3$) demonstrate competitive performance relative to existing GB and bivariate bicycle (BB) codes despite the additional algebraic restriction.
Read the full abstract

Information Theory

Multiple-Bases Belief Propagation List Decoding for Quantum LDPC Codes

In this paper, we propose a belief-propagation (BP)-based decoder, termed the Multiple-Bases Belief-Propagation List Decoder (MBBP-LD), for quantum low-density parity-check (QLDPC) codes. The key idea is to generate structured decoding diversity by constructing multiple redundant parity-check representations via cycle-free subtree decompositions of the Tanner graph, and running BP decoding in parallel across these representations. This extends the classical Multiple-Bases Belief-Propagation (MBBP) framework to the quantum setting while preserving the linear-time complexity and efficiency of standard BP decoding, and avoids the need for super-linear post-processing. Simulation results demonstrate that MBBP-LD improves upon existing BP-based decoders, including BP with ordered statistics decoding (BP-OSD) and belief propagation with guided decimation (BPGD) across several QLDPC codes, while requiring substantially fewer total BP iterations. For bivariate bicycle codes $[[144,12,12]]$ and $[[288,12,18]]$, MBBP-LD achieves up to $20\%$ reduction in error rate compared to BPGD and up to $30\%$ compared to BP-OSD in the low- and moderate-error regimes. For the larger B1 code $[[882, 24, 18 \leq d \leq 24]]$, MBBP-LD attains comparable or improved performance relative to BPGD while maintaining BP-like decoding latency under parallel implementation.
Read the full abstract

Group Theory

Boundary dynamics, triple transitivity, and mixed identities in weakly hyperbolic groups

We study the interplay between the algebraic and dynamical properties of groups that admit a general type action on a $\delta$-hyperbolic space such that the induced action on the limit set in the Gromov boundary is faithful. We divide the class of such groups into two subclasses based on a dynamical criterion: groups whose induced action on the limit set is topologically free, and those whose action is not. We prove that satisfying the criterion is equivalent to a purely algebraic property of being mixed identity free, generalizing results of P. Fima, F. Le Maître, S. Moon, and Y. Stalder from groups acting on trees to groups acting on arbitrary hyperbolic spaces. As one corollary, we obtain that the reduced $C^*$-algebra of such groups is selfless, using the results of N. Ozawa. For the subclass of groups whose action on the limit set is not topologically free, we prove the rigidity result for all $3$-transitive faithful actions and bound the transitivity degree by $3$, generalizing the result of A. Le Boudec and N. Matte Bon. As an application, we show that non-affine simple Kac-Moody groups over finite fields are MIF, answering the question of J. Belk, F. Fournier-Facio, J. Hyde, and M. Zaremsky.
Read the full abstract

Number Theory

Presentations of Galois groups of unramified extensions of global fields and its predicted distribution

Motivated by the work of Liu, we study certain canonical quotients of $G_{\emptyset}^T(K)$ – the Galois group of the maximal unramified extension of a global field $K$ that is split completely at a finite nonempty set of places in $T$ – for $\Gamma$-extensions $K/Q$, and prove they have presentations of a particular form. This presentation leads us to the construction of a new random group model as in the work of Liu, Wood, and Zureick-Brown that predicts the distribution of $G_{\emptyset}^T(K)$ as we vary among $\Gamma$-extensions $K/Q$ with prescribed local conditions at places in $T$, giving a generalization of the non-abelian Cohen-Lenstra-Martinet Heuristics. The key generalization is that $Q$ can be an arbitrary global field, while this comes at a cost of introducing a prime-to-$|\text{Cl}_T(Q)|$ condition in addition to avoiding roots of unity, $|\Gamma|$, and the characteristic if $Q$ is a function field.
Read the full abstract

Numerical Analysis

Classification of Double Saddle-Point Systems

We offer a classification of a broad and practically relevant class of symmetric double saddle-point system. At the core of the paper is the division of the associated matrices into “block-arrow” and “block-tridiagonal” forms. We describe relevant applications, invertibility conditions, spectral properties, and block preconditioners. Our discussion is kept within a general framework rather than tailored to specific applications.
Read the full abstract

Mathematical Physics

Nonlinear Multiphysics Modeling of Batch Digester Discharge Dynamics with Rheology-Driven Hydraulic Transport and Drainability Coupling

Batch digester blowdown operations exhibit highly nonlinear hydraulic transport dynamics due to evolving slurry consistency and rheological uncertainty. This work presents a nonlinear dynamic model and a robust Sliding Mode Control (SMC) strategy for discharge-flow regulation in industrial batch digester systems. The proposed framework incorporates non-Newtonian slurry rheology, consistency-dependent hydraulic resistance, drainability effects, channeling phenomena, and nonlinear hydraulic transport behavior.
Read the full abstract

Optimization and Control

Stochastic global optimization of continuous functions via random walks on Grassmannians

We introduce a stochastic global optimization method based on random walks on Grassmannian manifolds. To minimize a continuous objective $\ell:\mathbb{R}^d\rightarrow\mathbb{R}$, the method repeatedly samples random $k$-dimensional linear subspaces (with $k\ll d$), solves the resulting low-dimensional restrictions of these problems to these subspaces using an arbitrary black-box optimizer, and updates the iterate (which monotonically improves upon the previous iterate). Unlike classical optimization analyses that rely on convexity, smoothness, Lipschitz bounds, or Polyak-Lojasiewicz-type conditions, our convergence guarantees depend only on the geometric distribution of restricted minima across the $k$-dimensional subspaces passing through a given point in $\mathbb{R}^d$. We identify a gap parameter – an analogue of a spectral gap for random walks – that controls the rate at which the iterates approach the global minimum value. Finally, we argue that the same analysis yields a blind-spot robustness property: sufficiently narrow, deep dips of the loss function (small-measure regions where $\ell$ spikes downward) have limited influence on the algorithm's trajectory, since they are unlikely to be encountered by random subspace sampling.
Read the full abstract

All authors Kartik Gupta, Stephen D. Miller, Pradeep Ravikumar, Ramarathnam Venkatesan

Combinatorics

Counting symmetric unimodular triangulations

The objects of study are triangulations of the dilated standard triangle in the plane. Motivated by work on T-curves (Geiselmann et al., 2026), the focus lies on unimodular triangulations with a fixed symmetry axis. Lower and upper bounds are given, in combination with full enumerations of a few small cases.
Read the full abstract

Probability

The Mean-Field Limit of Online Stochastic Vector Balancing

We study an online vector balancing problem, in which $n$ independent Gaussian random vectors $\boldsymbol{\zeta}(1),\dots,\boldsymbol{\zeta}(n) \sim \mathcal{N}(0, I_n)$, each of dimension $n$, arrive one at a time. The goal is to choose signs $\varepsilon(1),\dots,\varepsilon(n) \in \{\pm 1\}$ with $\varepsilon(k)$ depending only on $\boldsymbol{\zeta}(1),\dots,\boldsymbol{\zeta}(k)$, so as to minimize the expected $\ell^{\infty}$ norm of the signed sum $\frac{1}{\sqrt{n}}\sum_{k = 1}^n \varepsilon(k) \boldsymbol{\zeta}(k)$. Prior work showed that the optimal value $V^n$ is $O(1)$, at least for Rademacher $\boldsymbol{\zeta}(k)$'s, by constructing specific algorithms. Our main contribution is to determine the exact limit $V^{\infty} = \lim_{n\to\infty} V^n$ as the value of a nonstandard stochastic control problem of mean-field type: find the narrowest terminal interval into which a Brownian motion can be adaptively steered under a uniform-in-time $L^2$ constraint on the drift. The proof of the lower bound $V^{\infty} \leq \liminf_{n \to \infty} V^n$ uses probabilistic compactness arguments, and is very flexible. In fact, we show that the lower bound is universal, in that it holds as long as the entries of the $\boldsymbol{\zeta}(k)$ vectors are i.i.d. with mean zero, variance 1, and finite fourth moment. The proof of the upper bound $\limsup_{n \to \infty} V^n \leq V^{\infty}$ is more delicate, relying on dynamic programming principles and a priori bounds obtained from a coupling procedure involving the Föllmer drift, which makes explicit use of the Gaussian structure. In addition to our main convergence result, we provide some analysis and asymptotics for the limiting mean-field control problem.
Read the full abstract

All authors Christian Fiedler, Joe Jackson, Daniel Lacker, Jonathan Niles-Weed

Combinatorics

A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 $\&$ -2 isomorphic circulant graphs

Elspas and Turner \cite{eltu} raised a question on the isomorphism of $C_{16}(1,3,7)$ and $C_{16}(2,3,5)$ and Vilfred \cite{v96} gave its answer by defining Type-2 isomorphism of $C_n(R)$ w.r.t. $m$ $\ni$ $m$ = $\gcd(n, r) > 1$ and also modified to $m$ and $m^3$ divides $\gcd(n, r)$ and $n$, respectively, $r\in R$ and $r,n\in\mathbb{N}$ and studied such graphs \cite{v13,v20, v2-1}. Using a $C^{++}$ computer program, the authors obtained families of Type-2 isomorphic $C_{n}(R)$ w.r.t. $m$ = 2,3,5,7 for $n\in\mathbb{N}$ as well as $C_{np^3}(R)$ w.r.t. $m$ = $p$ where $p$ is a prime and $n\in\mathbb{N}$. In this paper, we present the $C^{++}$ program and also a VB program POLY415.EXE which is used to show how Type-1 and Type-2 isomorphisms of a circulant graph take place as well as for checking and finding Type-1 and Type-2 circulant graphs of a given order. This article is the $9^{th}$ part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}.
Read the full abstract

Mathematical Physics · Cross-listed from physics.soc-ph

How opinions shape epidemics: a graphon-based kinetic approach

Understanding the mutual influence between social behavior and physical health is crucial for designing effective epidemic mitigation strategies. Individual interactions drive the evolution of opinions, which in turn shape how infectious diseases are perceived and consequently how they spread within a population, for instance through the adoption or rejection of preventive measures. At the same time, the distribution and dynamics of physical contacts play a fundamental role in determining transmission patterns. To this end, we develop a mathematical framework to analyze the coupled dynamics of opinion formation, disease transmission, and physical contacts by employing graphon-based networks, which capture heterogeneous and large-scale connectivity patterns typical of realistic social structures. The epidemic compartmental model further incorporates a kinetic description of microscopic level physical contacts, allowing for a consistent multiscale representation of interaction patterns. Starting from a microscopic description governed by interpersonal compromise and intrinsic self-thinking processes, we derive a kinetic compartmental epidemic model on graphons via a mean-field limit. This formulation allows us to investigate the joint evolution of the disease state and the opinion distribution, with a particular focus on the role of social networks and physical contacts. Numerical experiments demonstrate that the graphon-kinetic approach provides a comprehensive representation of the coupled opinion-epidemic dynamics, revealing new possibilities for controlling disease spread by shaping population opinion patterns.
Read the full abstract

All authors Abu Safyan Ali, Elisa Calzola, Giacomo Dimarco, Lorenzo Pareschi, Thomas Rey

Combinatorics

On Tournament Anti-Sidorenko Orientations of Trees

An oriented graph $\vec{H}$ is said to be tournament anti-Sidorenko if the homomorphism density of $\vec{H}$ in any tournament $\vec{T}$ is bounded above by the homomorphism density of $\vec{H}$ in a large uniformly random tournament. We prove the following: (1) Every oriented path with at least three arcs and exactly one non-leaf source or sink vertex is tournament anti-Sidorenko. (2) An oriented path is tournament anti-Sidorenko if the distance between any leaf vertex and any source or sink vertex is at least two and the distance between any pair of non-leaf source or sink vertices is a multiple of four. (3) Every spider with exactly three legs admits a tournament anti-Sidorenko orientation. The first result proves a conjecture posed by He, Mani, Nie, Tung and Wei. The third resolves a problem from the same paper, in fact establishing a substantially more general statement, and provides evidence in support of a conjecture of Fox, Himwich, Mani and Zhou. The second yields the first family of tournament anti-Sidorenko oriented paths which is exponentially large with respect to the number of arcs.
Read the full abstract

Dynamical Systems

Stochastic Mackey-Glass Equations and Other Negative Feedback Systems: Existence of Invariant Measures

We study equations like the Mackey-Glass equations and Nicholson's blowflies equation, each perturbed by a (small) multiplicative noise term. Solutions to these stochastic negative feedback systems persist globally and are bounded above in probability under mild assumptions. A non-trivial invariant measure is proved to exist if and only if there is at least one initial condition for which the solution remains bounded away from zero in probability. The noise driving the dynamical system is allowed to be a square integrable Lévy process with finite intensity. Existence of invariant measures is obtained via the Krylov-Bogoliubov method. In addition to our theoretical results, we present numerical simulations identifying the invariant measures obtained via the Krylov-Bogoliubov method and illustrating their connection to the system's long-term behaviour.
Read the full abstract

Group Theory

The category of centralizer lattices of groups

We formalize the concept of a centralizer-respecting homomorphism, surjective homomorphisms which are equivariant with respect to taking the centralizer of a subgroup. There is a functor from the category of centralizer-respecting homomorphisms to the category of centralizer lattices. Finally, we conclude with some theorems about centralizer-respecting homomorphisms that show that the category of centralizer-respecting homomorphisms has many interesting maps.
Read the full abstract

Logic

What can Topology tell us about Logical Complexity?

In the 1980s, category theorists introduced the Lawvere-Tierney $(\leq_{\mathrm{LT}})$ order in the Effective Topos, known to effectively embed the Turing degrees. Understanding its structure is a longstanding open problem in the area. In particular, there was an informal sense that the $\leq_{\mathrm{LT}}$-order reflects certain shifts in combinatorial complexity, but a precise characterisation remained elusive for some time. Recent work by the authors has substantially clarified the picture. In arXiv:2602.08138, the authors introduced a game-theoretic (”gamified”) version of the Katětov order on filters over $\omega$ – essentially, this is the usual Katětov order now closed under well-founded iterations of Fubini powers. The first major theorem of the paper was to show that a computable variant of the gamified Katětov order is isomorphic to the original $\leq_{\mathrm{LT}}$-order. This was a surprising discovery, and opens up many challenging questions regarding the interplay between combinatorial and computable complexity, which informed the rest of the paper's investigations. This note gives an informal survey of some of these interactions explored in arXiv:2602.08138, and announces some forthcoming results. The guiding perspective is that different notions of complexity arising in different areas of logic can be seen to be controlled by the same mechanism – once placed in the right topological framework.
Read the full abstract

Numerical Analysis

Goal-Oriented Time Adaptivity for Linear Port-Hamiltonian Differential-Algebraic Equations of Index~1

Port-Hamiltonian systems provide a highly-structured framework for modeling of physical systems. By definition, they encode a balance equation relating energy changes to supplied and dissipated energy. Capturing this energy balance in discrete approximations is a fundamental challenge and often has been achieved by designing particular schemes such as discrete gradient methods. In this work, we propose an approach that controls the energy balance violation for port-Hamiltonian differential algebraic equations via time adaptivity using a posteriori grid refinement techniques based on the dual weighted residual method. In particular, we show how one may leverage the port-Hamiltonian structure to efficiently compute the error estimators using a dissipativity-exploiting block-Jacobi approximation. We illustrate the efficacy of the method by means of simulations of electrical circuit models.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Improved Speed via Regional Fulfillment

In e-retail, order fulfillment speed has become one of the most important metrics affecting customer satisfaction. While common wisdom dictates that maintaining a large global fulfillment network maximizes efficiency via economies of scale, recent evidence has shown that breaking up the network into smaller regions can yield significant speed improvements. In this paper, we consider a simple abstract model of order fulfillment by which we explain this phenomenon. We characterize fulfillment assignments satisfying an equilibrium condition based on the greedy fulfillment strategy, and quantify how the resulting fulfillment delay can be decreased by regionalizing the network. Finally, we provide some algorithmic results for computing low delay assignments, and some simulations supporting our equilibrium framework.
Read the full abstract

Combinatorics

The 2-Quasi-Regularizability Conjecture and Independence Polynomials of Wp Graphs

Hoang, Levit, Mandrescu and Pham asked for structural conditions ensuring that the independence polynomial of a $\W_p$ graph is log-concave, or at least unimodal, and conjectured that a connected $\W_2$ graph is $2$-quasi-regularizable if and only if $n(G)\ge 3\alpha(G)$ (2026). We prove the conjecture. The key point is a local expansion theorem: if $G$ is connected and belongs to $\W_2$, then every non-maximum independent set $A$ satisfies \[ |N_G(A)|\ge 2|A|. \] Thus the only possible obstruction to $2$-quasi-regularizability in a connected $\W_2$ graph comes from maximum independent sets, where the condition is exactly $n(G)-\alpha(G)\ge 2\alpha(G)$. We also give coefficient criteria for log-concavity and unimodality of independence polynomials of $\W_p$ graphs. These criteria combine the standard two-sided coefficient inequalities, as collected by Hoang–Levit–Mandrescu–Pham, with $\lambda$-quasi-regularizability. The new $p=2$ threshold proved here inserts the missing case into the same framework and yields explicit log-concavity and unimodality regions for connected $\W_2$ graphs.
Read the full abstract

Functional Analysis

Geometric duality, perfect graphs, and the Sierpiński space

In their classical paper On the stopping time Banach space, Bang and Odell, among a plethora of results concerning the dyadic stopping time space and its dual, presented the first non-trivial example of the duality phenomenon between combinatorial Banach spaces. We give a full characterization of such pairs $(\mc{F}_0, \mc{F}_1)$ of families of finite sets: This duality holds iff there is a perfect graph $G$ on $\NN$ such that $\mc{F}_0$ consists of all finite cliques of $G$ and $\mc{F}_1$ consists of all finite anti-cliques of $G$. As it turns out, Lovász' famous perfect graph theorem is an immediate corollary of this result. Among the many examples of such pairs of families, we investigate a particularly interesting one, when $G$ is the Sierpiński graph, and study general methods of embedding combinatorial and classical sequence spaces in the generated space, including the Schreier and $\ell_p$ spaces.
Read the full abstract

Optimization and Control

Quantitative Soft-to-Hard Terminal Constraint Convergence for the Heat Equation

We investigate an optimal control problem for the one-dimensional heat equation with a prescribed terminal state. To approximate the hard terminal constraint, we consider quadratic terminal penalization and analyze the convergence of the optimal controls and terminal states as the penalty parameter \(\alpha\to\infty\). We develop a unified spectral treatment of terminal reachability, minimum-energy control, and quadratic-penalty convergence. Using modal decompositions, we characterize finite-energy admissible terminal targets and construct the corresponding minimum-energy hard-constrained control. For admissible targets, we establish strong convergence of penalized optimal controls and terminal states. Under suitable spectral summability conditions, we obtain regularity-dependent convergence estimates of order \(O(\alpha^{-(1/2+\theta)})\) for the terminal-state error, \(0\le\theta\le1/2\), and \(O(\alpha^{-\theta})\) for the optimal-control error, \(0<\theta\le1\). The analysis connects these results explicitly with classical Tikhonov regularization in the heat-equation setting. A finite-dimensional prototype illustrates the underlying projection structure, while companion numerical investigations provide supporting evidence for the predicted convergence behavior.
Read the full abstract

Optimization and Control

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers

The nonnegative rank of a nonnegative matrix $X$ is the smallest number of nonnegative rank-one factors that sum to $X$. Since computing the nonnegative rank is NP-hard, it is common to circumvent this issue by computing lower and upper bounds. In this paper, we propose non-convex formulations and practical implementations for four important lower bounds for the nonnegative rank, namely the fooling set bound (FSB), the rectangle covering bound (RCB), the hyperplane separation bound (HSB), and the self-scaled bound (SSB). In particular, to the best of our knowledge, our algorithm for computing the SSB is the first available in the literature. We compute the SSB for several matrices for which its value had not previously been reported. In some cases, the SSB provides the best known upper bound, while the other three bounds do not. Moreover, on canonical benchmarks, we show that our non-convex approaches are often competitive with existing methods. The paper also provides a consolidated reference for the current state of several classical lower bounds on a large number of benchmark matrices.
Read the full abstract

2605.14058 · 13 May · Added a proof that the hyperplane separation bound equals 2 for the linear Euclidean distance matrices studied here. Improved the lower bound on the nonnegative rank of the slack matrix of the icosidodecahedron from 10 to 11. Clarified how the self-scaled bound recovers the known nonnegative rank of 7 for both M11 and M12

Analysis of PDEs

Energy identity for stationary biharmonic mappings into spheres in supercritical dimensions

Energy identity for harmonic type maps in supercritical dimensions is an important and difficult problem. For sphere-valued harmonic maps, the first breakthrough was achieved by Lin-Rivière [Duke Math. J. 2002]. In this paper, by adapting their strategy, we establish the energy identity for stationary biharmonic maps into spheres in supercritical dimensions $n\ge 5$.
Read the full abstract

Algebraic Geometry

Construction of Non-special Divisors on Kummer Covers With Arbritary Ramification For LCP Codes

Linear Complementary Pairs (LCP) of algebraic geometry (AG) codes offer strong resistance against side-channel and fault-injection attacks, but their construction depends critically on the explicit identification of non-special divisors of degree $g$ and $g-1$. Existing constructions are restricted to Kummer extensions where divisors are supported exclusively on totally ramified places, significantly limiting the range of applicable function fields and codes. We remove this restriction by developing a framework for general Kummer extensions $y^m = \prod_{i=1}^r (x-\alpha_i)^{\lambda_i}$ over finite fields with arbitrary ramification. Using Galois group actions and invariant divisor techniques, we establish necessary and sufficient conditions for non-speciality with no constraint on the support, yielding explicit constructions where previous methods fail. Our approach replaces the computationally intensive Weierstrass semigroup machinery with a more direct and efficient framework. As an application, we construct new explicit families of LCP AG codes with determined parameters $[n,k,d]$, covering three ramification regimes. The resulting codes meet or approach the Goppa designed distance, offering greater flexibility for cryptographic applications.
Read the full abstract

Numerical Analysis

$\ell$FEM: An efficient loop-free Matlab implementation of isoparametric bulk and surface finite elements

The $\ell$FEM MATLAB package provides a simple, efficient, and flexible implementation of isoparametric finite elements in bulk domains and on surfaces. The finite element matrix assemblies are based on MATLAB's paged operators and therefore completely loop-free. We give a short and conscious description of high-order isoparametric surface finite elements, which is then used to describe the assembly process and the implementation. We report on relevant numerical experiments (runtime comparisons, modifications for non-linear problems, etc.), and on additional functions, examples, and a testing unit which are all part of the $\ell$FEM package.
Read the full abstract

Dynamical Systems

Complexity of Billiards in Polygons Associated to Hyperbolic $(p,q)$-Tilings

The complexity of the billiard language of regular polygons in the hyperbolic plane with $p$ sides and $2\pi/q$ internal angles is known to grow exponentially and the exponential growth rate is known to equal the topological entropy of the billiard system. In this paper we compute these exponential growth rates explicitly when $q$ is even and give bounds when $q$ is odd. Additionally, for the $q$ even case, we give complete grammar rules that establish when a word (finite, infinite or bi-infinite) in $p$ letters is realized by a billiard path. This latter result is roughly stated and not rigorously proved in a paper of Giannoni and Ullmo (1995). In this paper, we provide a precise statement and a complete proof using new methods relating to minimal tiling paths.
Read the full abstract

Information Theory

Function-Correction with Optimal Data Protection for the General Hamming Code Membership

This paper investigates single-error-correcting function-correcting codes~(SEFCCs) for the $[2^n-1,\,2^n-1-n,\,3]$-Hamming code membership function~(HCMF) for general $n\geq 2$. Necessary and sufficient conditions for valid parity assignments are established, and the distance-$3$ codeword graph is shown to induce a connected bipartite structure for all $n\geq 2$, which is exploited to develop a systematic SEFCC construction achieving the largest possible minimum distance of~$2$. A novel framework is then developed that reduces the minimization of distance-$2$ codeword pairs to a max-cut problem on the distance-$4$ graphs of the two partite sets. Eigenvectors corresponding to the minimum eigenvalue of these graphs are shown to directly yield optimal parity assignments. We reduce the problem of finding these eigenvectors to an optimization problem involving moments of the Walsh coefficients of a related function, which we solve for even~$n$ by deriving a tight lower bound shown to be attained by bent functions, establishing a precise connection between optimal SEFCC design and bent Boolean functions.
Read the full abstract

Statistics Theory · Cross-listed from econ.EM

Regret Equals Covariance: A Closed-Form Characterization for Stochastic Optimization

Quantifying regret typically involves repeatedly re-solving a stochastic optimization problem across simulated scenarios. Such an approach is costly: the cost scales with the number of scenarios and the cost of each solve. We propose that regret can instead be measured using the joint moments of the cost vector $c$ and the optimal decision $\pi^*(c)$. Working with the optimal concave and Lipschitz under only a feasible region value function $v(c) = \min_{z\in Z} c^\top z$, we show that regret always decomposes as $\mathrm{Regret} = -\mathrm{Cov}(c,\pi^*(c)) - R(c)$ for a residual $R(c)$. We further show that $R(c)=0$ when $\pi^*$ is affine in $c$, which holds for unconstrained and equality-constrained (e.g., budget-constrained Markowitz) quadratic programs and many, but not all, linear programs. For all cases, we give a distribution-free bound $\mathrm{Regret} \le D\sqrt{\mathrm{tr}(\Sigma_c)}$ that depends only on the radius of the feasible region and the cost covariance. We also derive concentration and asymptotic-normality results for the empirical regret, the latter under an explicit and checkable non-degeneracy condition.
Read the full abstract