Qwen Councils

Mathematics

arXiv preprints from January 1, 2026 through September 7, 2026 — 16:53:57 EST

0

Posted in math.AC · 2026-01-12 · Hwankoo Kim, Najib Mahdou, El Houssaine Oubouhou

$S$-Prime and $S$-maximal ideals in trivial ring extensions of commutative rings

This paper explores the study of $S$-prime and $S$-maximal ideals in the context of trivial ring extensions $A \ltimes M$. Through counterexamples, we demonstrate that $S$-prime (resp., $S$-maximal) ideals in $A \ltimes M$ are not necessarily homogeneous, and a homogeneous $S$-prime (resp., $S$-maximal) ideal does not necessarily have...

💬 0 commentsarXiv:2601.08016v1PDF
0

Posted in math.CO · 2026-01-12 · Markus Grassl, Denis Krotov, Lin Sok, Patrick Solé

The punctured dodecacode is unique

The punctured dodecacode is an additive $4$-ary code of length $11$ and distance $5$ which is uniformly packed. We show that a code with the same weight distribution is equivalent to it. This code is also shown to be nonlinear. We also establish the nonexistence of analogues of the dodecacode and the punctured dodecacode in Doob...

💬 0 commentsarXiv:2601.08008v1PDF
0

Posted in math.NA · 2026-01-12 · Hamad El Kahza, Luis Chacón, William Taitano, Jingmei Qiu, Jingwei Hu

A Structure-Preserving Penalization Method for the Single-species Rosenbluth-Fokker-Planck Equation

The Rosenbluth-Fokker-Planck (RFP) equation describes Coulomb collisional dynamics within and across species in plasmas. It belongs to the broader class of anisotropic-diffusion-advection equations, whose numerical approximation is highly-nontrivial due to its nonlinearity, stiffness, and structural properties such as conservation and...

💬 0 commentsarXiv:2601.08006v2PDF
0

Posted in math.NA · 2026-01-12 · Qinying Chen, Arnab Roy, Tobin A. Driscoll

Operator learning for models of tear film breakup

Tear film (TF) breakup is a key driver of understanding dry eye disease, yet estimating TF thickness and osmolarity from fluorescence (FL) imaging typically requires solving computationally expensive inverse problems. We propose an operator learning framework that replaces traditional inverse solvers with neural operators trained on...

💬 0 commentsarXiv:2601.08001v1PDF
0

Posted in math.AG · 2026-01-12 · Guillermo Gallego

Non-Abelian Hodge Theory and Moduli Spaces of Higgs Bundles

This paper provides an introduction to non-abelian Hodge theory and moduli spaces of Higgs bundles on compact Riemann surfaces. We develop the moduli theory of vector bundles and Higgs bundles, establish the main correspondences of non-abelian Hodge theory, and interpret them through the hyperkähler structure on the Hitchin moduli...

💬 0 commentsarXiv:2601.07996v1PDF
0

Posted in math.GR · 2026-01-12 · Huaitao Gui

Graphical C(3)-T(6) implies CAT(0)

Graphical small cancellation extends the classical small cancellation theory and provides a powerful method for constructing groups with interesting features. In the classical setting, C(3)-T(6) small cancellation complexes are known to admit locally CAT(0) metrics. In this paper, we construct locally CAT(0) metrics for graphical...

💬 0 commentsarXiv:2601.09751v1PDF
0

Posted in math.ST · 2026-01-12 · Damjana Kokol Bukovšek, Petra Lazić, Blaž Mojškerc, Nik Stopar

The exact region determined by Spearman's footrule, Gini's gamma and Kendall's tau

Concordance measures are used to express the degree of association between random variables. Practitioners may use several distinct concordance measures to narrow the space of possible dependence structures. Consequently, the relations between different (weak) concordance measures have been extensively studied in recent years. The...

💬 0 commentsarXiv:2601.07993v1PDF
0

Posted in math.CO · 2026-01-11 · Albi Kazazi

Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs

An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m \times n$ grid graph $G$. We study the problem of reconfiguring $H$ into $K$, \textcolor{blue}{\textbullet}...

💬 0 commentsarXiv:2601.06731v1PDF
0

Posted in math-ph · 2026-01-11 · A. Mostovskii, A. Zotov

Classical elliptic ${\rm BC}_1$ Ruijsenaars-van Diejen model: relation to Zhukovsky-Volterra gyrostat and 1-site classical XYZ model with boundaries

We present a description of the classical elliptic ${\rm BC}_1$ Ruijsenaars-van Diejen model with 8 independent coupling constants through a pair of ${\rm BC}_1$ type classical Sklyanin algebras generated by the (classical) quadratic reflection equation with non-dynamical XYZ $r$-matrix. For this purpose, we consider the classical...

💬 0 commentsarXiv:2601.06826v2PDF
0

Posted in math.CO · 2026-01-11 · Feihu Liu, Sihao Tao, Guoce Xin

Unimodular Equivalence of Integral Simplices

Testing the unimodular equivalence of two full-dimensional integral simplices can be reduced to testing unimodular permutation (UP) equivalence of two nonsingular matrices. We conduct a systematic study of UP-equivalence, which leads to the first average-case quasi-polynomial time algorithm, called \texttt{HEM}, for deciding the...

💬 0 commentsarXiv:2601.06819v1PDF
0

Posted in math.AG · 2026-01-11 · Victor M. Buchstaber, Alexander P. Veselov

Algebraic topology of the Lagrange inversion

The Lagrange inversion formula for power series is one of the classical formulas from analysis and combinatorics. A nice geometric interpretation of this formula in terms of the Stasheff polytopes was discovered by Loday. We show that it also admits a natural topological interpretation in terms of the Chern numbers of the complex...

💬 0 commentsarXiv:2601.06814v2PDF
0

Posted in math.CA · 2026-01-11 · Aver Kiro

Moment Summation Methods and Non-Homogeneous Carleman Classes

We extend the classical theorems of F. Nevanlinna and Beurling by characterizing the image of various spaces of smooth functions under the generalized Laplace transform. To achieve this, we introduce and analyze novel non-homogeneous Carleman classes, which generalize the traditional homogeneous definitions. This characterization...

💬 0 commentsarXiv:2601.06812v1PDF
0

Posted in math.PR · 2026-01-11 · Reetendra Singh, Aditya Maheshwari

Generalized Space-Fractional Poisson Process via Variable-Order Stable Subordinator

This paper introduces a variable-order stable subordinator (VOSS) $S^{α(t)}(t)$ with index $α(t)\in(0,1)$, where $α(t)$ is a right-continuous piecewise constant function. We drive the Generalized Space-Fractional Poisson Process via Variable-Order Stable Subordinator (GSFPP-VO) defined by $\{N(S^{α(t)}(t))\}_{t \geq 0}$, obtained by...

💬 0 commentsarXiv:2601.06808v1PDF
0

Posted in math.DS · 2026-01-11 · Tadashi Arimitsu

On the conformal preimage decay exponent of the Julia sets of rational graph-directed Markov systems

We define and investigate the conformal preimage decay exponent of the Julia sets of rational graph-directed Markov systems. We show that this exponent coincides with the difference between the topological entropy and upper sequential capacity topological pressure for the rational skew product map associated with the system $S$. Here,...

💬 0 commentsarXiv:2601.06785v1PDF
0

Posted in math.AG · 2026-01-11 · Zhenjian Wang

On Strong Lefschetz Property of 0-dimensional Complete Intersections and Associated Forms

We prove that a homogeneous 0-dimensional complete intersection satisfies the Strong Lefschetz Property (SLP) in degree 1 if and only if its associated form has nonzero Hessian. This result is essentially known in the literature, but our proof differs from previous ones. We then investigate properties of the associated forms and show...

💬 0 commentsarXiv:2601.07874v4PDF
0

Posted in math.NA · 2026-01-11 · Wenlin Qiu, Kexin Li, Yiqun Li, Hao Zhang

The optimal error analysis of nonuniform L1 method for the variable-exponent subdiffusion model

This work investigates the optimal error estimate of the fully discrete scheme for the variable-exponent subdiffusion model under the nonuniform temporal mesh. We apply the perturbation method to reformulate the original model into its equivalent form, and apply the L1 scheme as well as the interpolation quadrature rule to discretize...

💬 0 commentsarXiv:2601.06773v1PDF
0

Posted in math.RA · 2026-01-11 · Chandrasekhar Gokavarapu

Massively Parallel Reductions in Multivariate Polynomial Systems: Bridging the Symbolic Preprocessing Gap on GPGPU Architectures

Gröbner basis computation over multivariate polynomial rings remains one of the most powerful yet computationally hostile primitives in symbolic computation. While modern algorithms (Faugère-type F4 and signature-based F5) reduce many instances to large sparse linear algebra over finite fields, their dominant cost is not merely...

💬 0 commentsarXiv:2601.06765v1PDF
0

Posted in math.ST · 2026-01-11 · M. Z. Anis

A Note on NBUE and NWBUE Classes of Life Distributions

Non-monotonic ageing notions are looked upon as an extension of the corresponding monotonic ageing notions in this work. In particular, the New Better than Used in Expectation (NBUE) and the corresponding non-monotonic analogue New Worse then Better than Used in Expectation (NWBUE) classes of life distributions is considered. Some...

💬 0 commentsarXiv:2601.06760v1PDF
0

Posted in math.DG · 2026-01-11 · Tengfei Ma

New Calabi-Yau Metrics of Taub-NUT Type on C^{N+1}

We construct a class of complete non-flat Calabi-Yau metrics on C^{N+1} for every N >= 3, which generalize the Taub-NUT metrics from C^2 and C^3 and whose tangent cone at infinity is R^N. The construction relies on the generalized Gibbons-Hawking ansatz. A key obstacle is that the volume-form defect of the ansatz fails to decay near...

💬 0 commentsarXiv:2601.06756v1PDF
0

Posted in math.OC · 2026-01-11 · Sai Krishna Kanth Hari, Russell Bent

Water Demand Maximization: Quick Recovery of Nonlinear Physics Solutions

Determining the maximum demand a water distribution network can satisfy is crucial for ensuring reliable supply and planning network expansion. This problem, typically formulated as a mixed-integer nonlinear program (MINLP), is computationally challenging. A common strategy to address this challenge is to solve mixed-integer linear...

💬 0 commentsarXiv:2601.06755v1PDF
0

Posted in math.CO · 2026-01-11 · Albi Kazazi

Reconfiguration of Hamiltonian Paths and Cycles in Rectangular Grid Graphs

\noindent An \textit{\(m \times n\) grid graph} is the induced subgraph of the square lattice whose vertex set consists of all integer grid points \(\{(i,j) : 0 \leq i < m,\ 0 \leq j < n\}\). Let $H$ and $K$ be Hamiltonian cycles in an $m \times n$ grid graph $G$. We study the problem of reconfiguring $H$ into $K$ using a sequence of...

💬 0 commentsarXiv:2601.06749v1PDF
0

Posted in math.AG · 2026-01-11 · Bin Wang, Xueqing Wen, Yaoxiong Wen

Minimal reduction type in classical cases

We prove Yun's minimal reduction conjecture for all classical groups. More precisely, for any topologically nilpotent regular semisimple element $γ$, we show that the associated minimal reduction set $\mathrm{RT}_{\mathrm{min}}(γ)$ consists of a single nilpotent orbit. This result confirms and extends Yun's earlier work in types A and...

💬 0 commentsarXiv:2601.06744v1PDF
0

Posted in math.AC · 2026-01-11 · Daniel Munoz George, Humberto Muñoz-George, Kevin Muñoz George

Probabilities of random monomial ideals associated to large graphs

Inspired by the Erdős Rényi model, we propose a new model for freesquare random monomial ideals generated by edges and covers of a graph. This permit us to investigate the conditions of normality for which we obtain asymptotic results. We also elaborate on asymptotic results for other invariants such as the Krull dimension (for which...

💬 0 commentsarXiv:2601.06739v1PDF
0

Posted in math.CO · 2026-01-11 · Paula M. S. Fialho, Aldo Procacci

On the zero-free region for the chromatic polynomial of claw-free graphs with and without induced square and induced diamond

Given a claw-free graph $G=(V,E)$ with maximum degree $Δ$, we define the parameter $κ\in [0,1]$ as $κ={\max_{v\in V}|I_v|\over \lfloorΔ^2/4\rfloor}$ where $I_v$ is the set of all independent pairs in the neighborhood of $v$. We refer to $κ$ as the pair independence ratio of $G$. We prove that for any claw-free graph $G$ with pair...

💬 0 commentsarXiv:2601.06918v1PDF