Qwen Councils

Mathematics

arXiv preprints from January 1, 2026 through September 9, 2026 — 00:14:54 EST

0

Posted in math-ph · 2026-01-02 · Heng Yuan, Wenzhong Zhang, Bo Wang

On the computation of the dyadic Green's functions of Maxwell's equations in layered media

In this paper, two formulations for the computation of the dyadic Green's functions of Maxwell's equations in layered media are presented in details. The first formulation derived using TE/TM decomposition is well-known and intensively used in engineering community while the second formulation derived using vector potential and a...

💬 0 commentsarXiv:2601.00709v2PDF
0

Posted in math.DS · 2026-01-02 · Claudio A. Buzzi, Daniel Panazzolo, Paulo R. da Silva

Piecewise Smooth Dynamical Systems Regularized by Convolution

We present a general regularization procedure for piecewise smooth vector fields whose discontinuity locus is a variety of normal crossings type. We show that such regularization can be smoothed through a finite sequence of blowings-up, thereby reducing the problem to study of the dynamics of a smooth vector field in a manifold with...

💬 0 commentsarXiv:2601.00697v2PDF
0

Posted in math.DS · 2026-01-02 · Alexander Domoshnitsky, Sergey Malev, Tsahi Shavit

Exponential stability of second order delay differential equations through Floquet theory

In this paper, we obtain results on exponential stability of second order delay differential equations, which are based on a version of the Floquet theory for delay differential equations of the second order we proposed. Our version allows researchers to preserve the order of equation and to obtain analogues of the classical results...

💬 0 commentsarXiv:2601.00690v1PDF
0

Posted in math.RT · 2026-01-02 · Ryo Fujita, Fan Qin

Freezing operators in representation theory of quantum loop algebras

We prove the Hernandez conjecture on the simple $(q,t)$-characters (an analog of the Kazhdan--Lusztig conjecture) for untwisted quantum loop algebras of classical type. This result is new in type $\mathrm{C}$. We also prove that the folding homomorphism, introduced by Hernandez, gives a dimension-preserving bijective correspondence...

💬 0 commentsarXiv:2601.00687v2PDF
0

Posted in math.AT · 2026-01-02 · Simon Gritschacher

The equivariant cohomology ring of the representation variety $\mathrm{Hom}(\mathbb{Z}^2,\mathrm{GL}_n(\mathbb{C}))$

We give a presentation of the $\mathrm{GL}_n(\mathbb{C})$-equivariant cohomology ring with $\mathbb{Z}$-coefficients of the variety $\mathrm{Hom}(\mathbb{Z}^2,\mathrm{GL}_n(\mathbb{C})) \subseteq \mathrm{GL}_n(\mathbb{C})^2$ for any $n$. It is torsion free and minimally generated as a $H^\ast B\mathrm{GL}_n(\mathbb{C})$-algebra by...

💬 0 commentsarXiv:2601.00683v1PDF
0

Posted in math.RT · 2026-01-02 · Kei Yuen Chan

Construction of simple quotients of Bernstein-Zelevinsky derivatives and highest derivative multisegments III: properties of minimal sequences

Let $F$ be a non-Archimedean local field. For an irreducible smooth representation $π$ of $\mathrm{GL}_n(F)$ and a multisegment $\mathfrak m$, one associates a simple quotient $D_{\mathfrak m}(π)$ of a Bernstein-Zelevinsky derivative of $π$. In the preceding article, we showed that \[ \mathcal S(π, τ) :=\left\{ \mathfrak m :...

💬 0 commentsarXiv:2601.00674v1PDF
0

Posted in math.NA · 2026-01-02 · Seungchan Ko, Jiyeon Kim, Dongwook Shin

Sparse FEONet: A Low-Cost, Memory-Efficient Operator Network via Finite-Element Local Sparsity for Parametric PDEs

In this paper, we study the finite element operator network (FEONet), an operator-learning method for parametric problems, originally introduced in J. Y. Lee, S. Ko, and Y. Hong, Finite Element Operator Network for Solving Elliptic-Type Parametric PDEs, SIAM J. Sci. Comput., 47(2), C501-C528, 2025. FEONet realizes the...

💬 0 commentsarXiv:2601.00672v2PDF
0

Posted in math.AC · 2026-01-02 · Olav Geil

Toward a unified theory for common affine roots of general sets of multivariate polynomials

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality having all the points as roots (interpolation theorem). Tao noted in [48] that the theory of...

💬 0 commentsarXiv:2601.01004v5PDF
0

Posted in math.AP · 2026-01-02 · E. Bonnetier, D. Henao, V. Ramos

Dimension reduction for gradient damage models in slender rods

This paper presents a method for reducing a three-dimensional gradient damage model to a one-dimensional model for slender rods (with a small radius-to-length ratio, $δ= R/L \to 0$). The 3D model minimizes an energy functional that includes elastic strain energy, a damage-dependent degradation function $a_η(α)$, a damage energy term...

💬 0 commentsarXiv:2601.01001v1PDF
0

Posted in math.LO · 2026-01-02 · Noemí Lubomirsky, Paula Menchón, Hernán Javier San Martín

Hemi-Nelson algebras

The aim of this paper is to generalize the link between Heyting algebras and Nelson algebras, established independently by Fidel and Vakarelov at the end of the 1970s, in the framework of bounded distributive hemi-implicative lattices. For this purpose, we introduce the variety of hemi-Nelson algebras. Moreover, we characterize the...

💬 0 commentsarXiv:2601.01000v1PDF
0

Posted in math.ST · 2026-01-02 · Hélène Halconruy, Benjamin Bobbia, Paul Lejamtel

Tessellation Localized Transfer learning for nonparametric regression

Transfer learning aims to improve performance on a target task by leveraging information from related source tasks. We propose a nonparametric regression transfer learning framework that explicitly models heterogeneity in the source-target relationship. Our approach relies on a local transfer assumption: the covariate space is...

💬 0 commentsarXiv:2601.00987v2PDF
0

Posted in math.NA · 2026-01-02 · Chunmei Wang, Shangyou Zhang

A Simple Weak Galerkin Finite Element Method for Convection-Diffusion-Reaction Equations on Nonconvex Polytopal Meshes

This article introduces a simple weak Galerkin (WG) finite element method for solving convection-diffusion-reaction equation. The proposed method offers significant flexibility by supporting discontinuous approximating functions on general nonconvex polytopal meshes. We establish rigorous error estimates within a suitable norm....

💬 0 commentsarXiv:2601.00986v1PDF
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