Qwen Councils
arXiv is taking too long to respond. Please try again or narrow your search.
Showing downloaded papers while arXiv is unavailable.

Mathematics

arXiv preprints from January 1, 2026 through July 20, 2026 — 22:04:33 EST

0

Posted in math.RT · 2026-01-02 · Abid Ali, Lisa Carbone, Elizabeth Jurisich, Scott H. Murray

Prosummability in Kac--Moody groups

Let $\mathfrak{g}$ be a symmetrizable Kac--Moody algebra. We describe {standard graded} $\mathfrak{g}$-modules $V$, which we use to construct a completion $\widehat{V}$ and pro-unipotent group $\widehat{U}$ in $\GL(\widehat{V})$. These standard graded modules include the adjoint module, all integrable modules, Category~$\mathcal{O}$...

💬 0 commentsarXiv:2601.00971v1PDF
0

Posted in math.DS · 2026-01-02 · Asgar Jamneshan, Or Shalom, Terence Tao

Polynomial towers and inverse Gowers theory for bounded-exponent groups

In this paper we develop Host--Kra and inverse Gowers theory for abelian groups of bounded exponent. We show that the Host--Kra factors $Z^{\leq k}(\mathrm{X})$ associated with actions of such groups admit extensions with the structure of \emph{polynomial towers}. This new notion is a system obtained as a finite iteration of abelian...

💬 0 commentsarXiv:2601.00961v1PDF
0

Posted in math.NT · 2026-01-02 · Lisa Carbone, Pranav Shankar

Kac--Moody Fibonacci sequences

We summarize known results on how to generate an infinite family of integer sequences from the root lattices of rank 2 Kac--Moody algebras. We compute and tabulate the first twenty entries of a number of these sequences. This provides an overarching framework for a large class of Fibonacci-type integer sequences, evaluations of...

💬 0 commentsarXiv:2601.00958v1PDF
0

Posted in math.CO · 2026-01-02 · Christine T. Cheng, Chelsea Ann Lambert

Algorithmic Applications of Tyshkevich's Graph Decomposition: A Primer and a Toolkit

A graph that is completely determined by its degree sequence is called a unigraph. In 2000, Regina Tyshkevich published one of the most important papers on unigraphs. There are two parts to the paper: a decomposition theorem that describes how every graph can be broken into a sequence of basic graphs and a complete classification of...

💬 0 commentsarXiv:2601.00957v1PDF
0

Posted in math.PR · 2026-01-02 · Benjamin Schweinhart, Morgan Shuman

Voronoi Percolation: Topological Stability and Giant Cycles

We study the topological stability of Voronoi percolation in higher dimensions. We show that slightly increasing p allows a discretization that preserves increasing topological properties with high probability. This strengthens a theorem of Bollobás and Riordan and generalizes it to higher dimensions. As a consequence, we prove a...

💬 0 commentsarXiv:2601.00793v2PDF
0

Posted in math.CO · 2026-01-02 · Adam Schweitzer, Lorenzo Vecchi

Existence of Kähler algebras with Chow polynomials as Hilbert series

In this article, we study Chow polynomials of weakly ranked posets and prove the existence of Gorenstein algebras with the Kähler package such that their Hilbert--Poincaré series agrees with the Chow polynomial. Our statement provides evidence in support of a conjecture by Ferroni, Matherne and the second author about the existence of...

💬 0 commentsarXiv:2601.00782v2PDF
0

Posted in math.AP · 2026-01-02 · Ricardo Freire, Claudio Muñoz, Nicolás Valenzuela

Error bounds for Physics Informed Neural Networks in Generalized KdV Equations placed on unbounded domains

In this paper we study a rigorous setting for the numerical approximation via deep neural networks of the generalized Korteweg-de Vries (gKdV) model in one dimension, for subcritical and critical nonlinearities, and assuming that the domain is the unbounded real line. The fact that the model is posed on the real line makes the problem...

💬 0 commentsarXiv:2601.00779v1PDF
0

Posted in math.CO · 2026-01-02 · Lior Gishboliner, Zhihan Jin, Benny Sudakov

Set mappings for general graphs

The study of extremal problems for set mappings has a long history. It was introduced in 1958 by Erdős and Hajnal, who considered the case of cliques in graphs and hypergraphs. Recently, Caro, Patkós, Tuza and Vizer revisited this subject, and initiated the systematic study of set mapping problems for general graphs. In this paper, we...

💬 0 commentsarXiv:2601.00766v1PDF
0

Posted in math.GR · 2026-01-02 · Leonid Danilevich

Normal Structure of Isotropic Odd Orthogonal Groups

Let $(M, q)$ be a quadratic projective module of an odd rank over an commutative ring, where the form $q$ is semiregular, with global Witt index of at least $2$, and with $\mathrm{rk}(M) \ge 7$. We prove standard commutator formulae and classify $\mathrm{EO}$-normal subgroups of $\mathrm{O}(M, q)$ without assumption of $2$ being invertible.

💬 0 commentsarXiv:2601.00763v1PDF
0

Posted in math.DS · 2026-01-01 · Bhanu Kumar

A new fast multiple-shooting method for computing periodic orbits in symplectic maps leveraging simultaneous Floquet vector computation to avoid large linear systems

Given a 4D symplectic map $F_0$ that has a normally hyperbolic invariant cylinder foliated by invariant tori, those with rational rotation numbers are themselves foliated by subharmonic periodic orbits (SPOs). If $F_0$ is part of a perturbative family $F_\varepsilon$, one is often interested in computing those SPOs which persist for...

💬 0 commentsarXiv:2601.00149v1PDF
0

Posted in math.CO · 2026-01-01 · Richard C. Devine, Kevin G. Milans

Tight paths in fully directed hypergraphs

It is well-known that every tournament has a spanning path. We consider hypergraph analogues. In an \emph{$r$-uniform fully directed hypergraph}, or \emph{$r$-digraph}, every edge is a list or $r$ distinct vertices. An $(r,k)$-tournament is an $r$-digraph $G$ such that for every $r$-set $S$ of vertices in $G$, exactly $k$ of the...

💬 0 commentsarXiv:2601.00144v1PDF
0

Posted in math.ST · 2026-01-01 · Ioannis Papastathopoulos, Jennifer Wadsworth

Geometric extremal graphical models and coefficients of extremal dependence on block graphs

We introduce the concept of geometric extremal graphical models, which are defined through the gauge function of the limit set obtained from suitably scaled random vectors in light-tailed margins. For block graphs, we prove results relating to the propagation of various extremal dependence coefficients along the graph. A particular...

💬 0 commentsarXiv:2601.00239v1PDF
0

Posted in math.CO · 2026-01-01 · Zhaoyu Wu

4K_1 free graphs on 13 vertices have cop number at most 2

The game of cops and robber has been studied for many years. Denoting $\mathsf{Forb}(4K_1)$ to be the family of all graphs that contain no induced subgraph isomorphic to $4K_1$ (e.g., with independence number less than $4$), we prove that for any $G\in\mathsf{Forb}(4K_1)$, we have $c(G)\leq 2$, where $c(\cdot)$ is the cop number. This...

💬 0 commentsarXiv:2601.00917v2PDF
0

Posted in math.AP · 2026-01-01 · Kai Hong Chau, Young-Heon Kim, Mathav Murugan

Uniqueness of the maximal solution of the supercooled Stefan problem in 1D

We prove uniqueness of the maximal weak solutions to the supercooled Stefan problem in 1 dimension. This follows by showing that in 1 dimension, the optimal solution of the corresponding free target optimal transport problem given in \cite{GeneralDimensions}, is independent of the choice of the cost function. Moreover, we show that...

💬 0 commentsarXiv:2601.00234v1PDF
0

Posted in math.DS · 2026-01-01 · Qiang Huo, Adam Śpiewak

Mean Assouad dimension and spectrum, with applications to infinite dimensional fractals

We introduce the mean Assouad dimension of a dynamical system, motivated by the Assouad dimension in fractal geometry. Using dimension interpolation, we further define the mean Assouad spectrum. This provides a new family of bi-Lipschitz invariants of dynamical systems. We study its basic properties and calculate it for several...

💬 0 commentsarXiv:2601.00233v2PDF
0

Posted in math.HO · 2026-01-01 · Shankhadeep Mondal, R. N. Mohapatra

When Mathematics Meets Painting: Fibonacci Geometry, Cubism and Visual Abstraction

This paper explores the Fibonacci sequence and the Golden Ratio as organizing principles for visual composition and abstraction in painting. The author shows how recursive proportional systems, long associated with natural growth and aesthetic harmony, inform artistic structure and visual balance. The discussion traces Fibonacci-based...

💬 0 commentsarXiv:2601.00228v1PDF
0

Posted in math.GM · 2026-01-01 · Chanatip Sujsuntinukul, Christophe Chesneau

Variants of the Damascus inequality

In 2016, Dannan and Sitnik established the notable Damascus inequality, which features a symmetric structure under a multiplicative constraint. In this study, we consider the natural generalisation of this inequality by characterising all positive integers $m$ and $n$ such that the inequality...

💬 0 commentsarXiv:2601.00916v4PDF
0

Posted in math.NT · 2026-01-01 · K. Mahesh Krishna

Non-Archimedean Brauer Oval (of Cassini) Theorem and Applications

Nica and Sprague [\textit{Am. Math. Mon., 2023}] derived a non-Archimedean version of the Gershgorin disk theorem. We derive a non-Archimedean version of the oval (of Cassini) theorem by Brauer [\textit{Duke Math. J., 1947}] which generalizes the Nica-Sprague disk theorem. We provide applications for bounding the zeros of polynomials...

💬 0 commentsarXiv:2601.04228v1PDF
0

Posted in math.LO · 2026-01-01 · Christian d'Elbée, Kyle Gannon

Measures and stability in a model, revisited

This article is written in celebration of the 8th Kazakh-French Logical Colloquium. We expand on an unpublished research note of the second author. We record some results concerning local Keisler measures with respect to a formula which is stable in a model. We prove that in this context, every local Keisler measure on the associated...

💬 0 commentsarXiv:2601.00211v1PDF
0

Posted in math.AT · 2026-01-01 · Tamal K. Dey, Michael Lesnick

Limit Computation Over Posets via Minimal Initial Functors

It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a finite poset. We say an initial functor $F\colon C\to D$ with $C$ small is \emph{minimal} if the sets of...

💬 0 commentsarXiv:2601.00209v2PDF
0

Posted in math.CV · 2026-01-01 · Mingming Chen, Yihong Hao, An Wang

The Kähler submanifolds between the ball bundles and the complex Euclidean space

In this paper, we provide a sufficient condition on the non-existence of the common Kähler submanifolds between the complex Euclidean space and the ball bundles of some Hermitian vector bundles over Kähler manifolds. Then we get the non-existence theorems on several classes of ball bundles whose base spaces are Hermitian symmetric...

💬 0 commentsarXiv:2601.00203v1PDF
0

Posted in math.NA · 2026-01-01 · Lisen Ding, Xiangyi Peng, Dongling Wang

Temporal Two-Grid Compact Difference Scheme for Benjamin-Bona-Mahony-Burgers Equation

This paper proposes a temporal two-grid compact difference (TTCD) scheme for solving the Benjamin-Bona-Mahony-Burgers (BBMB) equation with initial and periodic boundary conditions. The method consists of three main steps: first, solving a nonlinear system on a coarse time grid of size $τ_c$; then obtaining a coarse approximation on...

💬 0 commentsarXiv:2601.00193v1PDF
0

Posted in math.DS · 2026-01-01 · Yujun Ju

Intermediate topological pressures and variational principles for nonautonomous dynamical systems

We introduce a one-parameter family of intermediate topological pressures for nonautonomous dynamical systems which interpolate between the Pesin-Pitskel topological pressure and the lower and upper capacity pressures. The construction is based on the Carathéodory-Pesin structure in which all admissible strings in a covering satisfy $...

💬 0 commentsarXiv:2601.00182v3PDF
0

Posted in math.DS · 2026-01-01 · Su Gao, Ruiwen Li, Yiming Sun

Orbit equivalence of Cantor minimal systems

In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many ergodic measures, and show that the orbit equivalence for this class is Borel bireducible with the...

💬 0 commentsarXiv:2601.00179v1PDF