Qwen Councils

Mathematics

arXiv preprints from January 1, 2026 through July 20, 2026 — 13:13:14 EST

0

Posted in math.CO · 2026-01-20 · Mohamed Omar

New Perspectives On The Unimodality Of Domination Polynomials

The domination polynomial of a graph $G$ is given by $D(G,x)=\sum_{k=0}^{n} d_k(G)x^k$ where $d_k(G)$ records the number of $k$-element dominating sets in $G$. A conjecture of Alikhani and Peng asserts that these polynomials have unimodal coefficient sequences. We develop three complementary perspectives that strengthen existing tools...

💬 0 commentsarXiv:2601.14494v1PDF
0

Posted in math.OC · 2026-01-20 · Kota Katsuki, Duckgyu Shin, Naoya Onizawa, Takahiro Hanyu

Fast Solving Complete 2000-Node Optimization Using Stochastic-Computing Simulated Annealing

In this paper, we evaluate stochastic-computing simulated annealing (SC-SA) for solving large-scale combinatorial optimization problems. SC-SA is designed using stochastic computing, where the computatoin is reazlied using random bitstream, resulting in fast converging to the global minimum energy of the problems. The proposed SC-SA...

💬 0 commentsarXiv:2603.20197v1PDF
0

Posted in math.NA · 2026-01-20 · Moustapha Diallo, Zelalem Arega Worku

High-Order Symmetric Positive Interior Quadrature Rules on Two and Three Dimensional Domains

Fully symmetric positive interior (f-SPI) quadrature rules are key building blocks for high-order discretizations of partial differential equations, yet high-degree rules with few nodes remain scarce on reference elements commonly used in mesh generation. We construct new f-SPI rules on the square, cube, prism, and pyramid by coupling...

💬 0 commentsarXiv:2601.14488v1PDF
0

Posted in math.CO · 2026-01-20 · Daniela Egas Santander, Matteo Santoro, Jason P. Smith

Linear extensions and directed clique counts via modular partitions

Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of posets whose modular partitions have particular structure. Specifically, we focus on posets...

💬 0 commentsarXiv:2601.14482v1PDF
0

Posted in math.AP · 2026-01-20 · Loth Damagui Chabi, Philippe Souplet

Sharp macroscopic blow-up behavior for the parabolic-elliptic Keller-Segel system in dimensions $n\ge 3$

We study the space-time concentration or blow-up asymptotics of radially decreasing solutions of the parabolic-elliptic Keller-Segel system in the whole space or in a ball. We show that, for any solution in dimensions $3\le n\le 9$ (assuming finite mass in the whole space case), there exists a nonflat backward self-similar solution...

💬 0 commentsarXiv:2601.14469v1PDF
0

Posted in math.CO · 2026-01-20 · Máté Jánosik, Artúr Nádor, Zoltán Lóránt Nagy, László Bence Simon

Avoiding configurations of small size in the square grid

We study the maximum size of a subset of the $n \times n$ integer grid that does not contain specific geometric configurations, a variation of the classical problems initiated by Erdős and Purdy. While extremal problems for 3-point patterns, such as collinear triples and right triangles are well-studied, the landscape for 4-point...

💬 0 commentsarXiv:2601.14465v2PDF
0

Posted in math.CV · 2026-01-20 · Mario Bonk, Mikhail Hlushchanka, Daniel Meyer

Quasi-visual approximations

We develop the foundations of the theory of quasi-visual approximations of bounded metric spaces. Roughly speaking, these are sequences of covers of a given space for which the diameters of the sets in the covers shrink to zero and for which relative metric quantities (such as ratios of diameters and distances) are uniformly...

💬 0 commentsarXiv:2601.14462v1PDF
0

Posted in math.NA · 2026-01-20 · Lukas Netterdon, Veronica Montanaro, Manuel Torrilhon, Hossein Gorji

Variance Reduction in the Fokker-Planck Particle Method for Rarefied Gases using Quasi-Random Numbers

The Fokker-Planck (FP) particle method accelerates rarefied-gas simulations by replacing the binary collisions of the commonly used Direct Simulation Monte Carlo (DSMC) method with a drift=diffusion process. Like all particle methods, the FP method is inherently stochastic, which leads to statistical fluctuations in macroscopic...

💬 0 commentsarXiv:2601.14461v1PDF
0

Posted in math.AP · 2026-01-20 · Martin Burger, Ariane Fazeny, Gilles Mordant, Jan-Frederik Pietschmann

p-Wasserstein distances on networks and 3D to 1D convergence

We study transport distances on metric graphs representing gas networks. Starting from the dynamic formulation of the Wasserstein distance, we review extensions to networks, with and without the possibility of storing mass on the vertices. Next, we examine the asymptotic behavior of the static Wasserstein distance on a...

💬 0 commentsarXiv:2601.14457v1PDF
0

Posted in math.PR · 2026-01-19 · Pierre Del Moral, Ajay Jasra

New Trends in the Stability of Sinkhorn Semigroups

Entropic optimal transport problems play an increasingly important role in machine learning and generative modelling. In contrast with optimal transport maps which often have limited applicability in high dimensions, Schrodinger bridges can be solved using the celebrated Sinkhorn's algorithm, a.k.a. the iterative proportional fitting...

💬 0 commentsarXiv:2601.12633v1PDF
0

Posted in math.DG · 2026-01-19 · Kaixin Yao

Non-parabolic Spatial Hybrid Framed Curves and Their Applications in the Spatial Hybrid Number Space

In this paper, we define non-parabolic spatial hybrid framed curves in the spatial hybrid number space, which may have singularities, and prove the existence and uniqueness theorem for non-parabolic spatial hybrid framed curves. As applications, we define evolutes, involutes, pedal and contrapedal curves of non-parabolic spatial...

💬 0 commentsarXiv:2601.12679v2PDF
0

Posted in math.PR · 2026-01-19 · Christian Hirsch, Takashi Owada, Ruiting Tong

Stable and Fréchet limit theorem for subgraph functionals in the hyperbolic random geometric graph

We study the fluctuations of subgraph counts in hyperbolic random geometric graphs on the $d$-dimensional Poincaré ball in the heterogeneous, heavy-tailed degree regime. In a hyperbolic random geometric graph whose vertices are given by a Poisson point process on a growing hyperbolic ball, we consider two basic families of subgraphs:...

💬 0 commentsarXiv:2601.12677v1PDF
0

Posted in math.NA · 2026-01-19 · Yongsheng Chen, Suddhasattwa Das, Wei Guo, Xinghui Zhong

Physics-informed machine learning for reconstruction of dynamical systems with invariant measure score matching

In this paper, we develop a novel mesh-free framework, termed physics-informed neural networks with invariant measure score matching (PINN-IMSM), for reconstructing dynamical systems from unlabeled point-cloud data that capture the system's invariant measure. The invariant density satisfies the steady-state Fokker-Planck (FP)...

💬 0 commentsarXiv:2601.12675v1PDF
0

Posted in math.DS · 2026-01-19 · Maxwell C. Siegel

The Hydra Map and Numen Formalisms for Collatz-Type Problems

This paper details a generalization of the formalism presented in the author's 2024 paper, "The Collatz Conjecture and Non-Archimedean Spectral Theory - Part I - Arithmetic Dynamical Systems and Non-Archimedean Value Distribution Theory", to the case of Hydra maps on the ring of integers $\mathcal{O}_{K}$ of a global field $K$. In...

💬 0 commentsarXiv:2601.17030v3PDF
0

Posted in math.AP · 2026-01-19 · Apala Majumdar, Baoming Shi, Dawei Wu, Jingmin Xia, Lei Zhang

A Landau-de Gennes Type Theory for Cholesteric-Helical Smectic-Smectic C* Liquid Crystal Phase Transitions

We present a rigorous mathematical analysis of a modified Landau-de Gennes (LdG) theory modeling temperature-driven phase transitions between cholesteric, helical smectic, and smectic C* phases. This model couples a tensor-valued order parameter (nematic orientational order) with a real-valued order parameter (smectic layer...

💬 0 commentsarXiv:2601.12653v1PDF
0

Posted in math.CO · 2026-01-19 · Pedro Fernando Fernández Espinosa, Maritza Liliana Arciniegas Torres, Camilo Andrés Acevedo Cadena

On Some Properties of Matrices with Entries Defined by Products of $k$-Fibonacci and $k$-Lucas Numbers

In this paper, we study a structured family of matrices whose entries are given by products of $k$-Fibonacci and $k$-Lucas numbers. For this family, we obtain explicit and unified formulas for several classical matrix invariants, including the determinant, inverse, trace, and matrix powers, revealing nontrivial algebraic patterns...

💬 0 commentsarXiv:2601.12644v2PDF
0

Posted in math.NT · 2026-01-19 · Boris M. Bekker, Yuri G. Zarhin

Torsion points of small order on cyclic covers of $\mathbb{P}^1$. III

Let $d>1$ be an integer and $K_0$ a perfect field such that $char(K_0)$ does not divide $d$. Let $n>d$ be an integer that is prime to $d$. Let $f(x)\in K_0[x]$ be a degree $n$ monic polynomial without repeated roots, and $\mathcal{C}_{f,d}$ a smooth projective model of the affine curve $y^d=f(x)$. Let $J(\mathcal{C}_{f,d})$ be the...

💬 0 commentsarXiv:2601.12643v1PDF
0

Posted in math.OC · 2026-01-19 · Hoai-Minh Nguyen

Optimal bounds for the boundary control cost of one-dimensional fractional Schrödinger and heat equations

We derive sharp bounds for the boundary control cost of the one-dimensional fractional Schrödinger and heat equations. The analysis of the lower bound is based on the study of the control cost of a related singular boundary control problem in finite time, using tools from complex analysis. The analysis of the upper bound relies on the...

💬 0 commentsarXiv:2601.12810v1PDF
0

Posted in math.NT · 2026-01-19 · Dae San Kim, Taekyun Kim

Probabilistic degenerate logarithm and heterogeneous stirling numbers

Let Y be a random variable whose moment-generating function exists in some neighborhood of the origin. While probabilistic Stirling numbers of the first and second kind have been introduced, early definitions often failed to satisfy fundamental orthogonality and inverse relations or lacked consistency with classical forms in the case...

💬 0 commentsarXiv:2601.12794v1PDF
0

Posted in math.NA · 2026-01-19 · Archana Arya, Kaushik Kalyanaraman

Two Frameworks and their Fourth Order Implicit Schemes for Time Discretization of Maxwell's Equations

Our work is about energy conserving fourth-order time discretizations of a three-field formulation of Maxwell's equations in conjunction with a spatial discretization using higher-order and compatible de Rham finite element spaces. Toward this end, we delineate two broad classes of strategies for general higher-order time...

💬 0 commentsarXiv:2601.12793v1PDF
0

Posted in math.NA · 2026-01-19 · Harshit Bajpai, Ankik Kumar Giri

Graph Laplacian assisted regularization method under noise level free heuristic and statistical stopping rule

In this work, we address the solution of both linear and nonlinear ill-posed inverse problems by developing a novel graph-based regularization framework, where the regularization term is formulated through an iteratively updated graph Laplacian. The proposed approach operates without prior knowledge of the noise level and employs two...

💬 0 commentsarXiv:2601.12792v1PDF
0

Posted in math.NA · 2026-01-19 · Yonghui Bo, Yushun Wang

High-order Lagrange multiplier schemes for general Hamiltonian PDEs

In this paper, we introduce a Lagrange multiplier approach to construct linearly implicit energy-preserving schemes of arbitrary order for general Hamiltonian PDEs. Unlike the widely used auxiliary variable methods, this novel approach does not require the nonlinear part of the energy to be bounded from below, thereby offering broader...

💬 0 commentsarXiv:2601.12776v1PDF