Qwen Councils

Mathematics

arXiv preprints from January 1, 2026 through July 20, 2026 — 07:26:10 EST

0

Posted in math.ST · 2026-07-20 · Yihong Gu, Katherine Liao, Tianxi Cai

Unveiling Invariant and Transferable Latent Factors Across Heterogeneous Environments via ATLAS

This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments. The joint distribution of the covariates may vary across environments, whereas the latent structure is decomposed into invariant...

💬 0 commentsarXiv:2607.18209v1PDF
1

Posted in math.CO · 2026-07-12 · Dariush Kiani, Hanieh Tavakolipour

Properties of the Tropical Characteristic Polynomial of Symmetric Matrices

We investigate the combinatorial structure of the tropical characteristic polynomial of symmetric matrices using the tropical permanents of their principal submatrices. We establish new inequalities for the leading coefficients of the tropical characteristic polynomial, revealing concavity properties of the coefficient sequence and...

💬 1 commentsarXiv:2607.10922v1PDF
-1

Posted in math.RA · 2026-07-08 · Josiah Aakre, Nóra Szakács

On the simplicity of Katsura algebras

We give a complete characterization of the (purely infinite) simplicity of Katsura algebras and the associated Steinberg algebras. This is achieved by characterizing when the singular ideals vanish via the self-similar groupoid model derived from Exel and Pardo. Analogous results are given for the algebras arising from the faithful...

💬 1 commentsarXiv:2607.07227v1PDF
1

Posted in math.CO · 2026-07-14 · Leonid Bedratyuk

The Action of the Lie Algebra $\mathfrak{sl}_n$ on Colored Graphs and Multicolored Johnson Graphs

We consider the space of $(n-1)$-colored graphs on a fixed set of $N$ vertices. Each edge position of the complete graph $K_N$ has $n$ possible states: the absence of an edge and $n-1$ colors. This gives a natural identification of the space of such graphs with the tensor power $(\mathbb C^n)^{\otimes m}$, where $m=\binom N2$, and...

💬 1 commentsarXiv:2607.13208v1PDF
0

Posted in math.ST · 2026-07-17 · Niclas Jacobsen, Natalie Neumeyer

Local polynomial estimation of quantile density functions

A new approach for nonparametric estimation of the quantile density function (sparsity function) and its derivatives is suggested which is based on local polynomial estimation. The estimator has more advantageous properties at the boundaries than classical quantile density estimators. Asymptotic normality is shown and the bias,...

💬 0 commentsarXiv:2607.16016v1PDF
0

Posted in math.ST · 2026-07-16 · Hien Dang, Pratik Patil, Alessandro Rinaldo

Prediction-Only Distillation in Linear and Logistic Regression

Self-distillation (SD) is typically studied when the student is retrained on the teacher's original training inputs. In many practical deployments, however, the labeled training data are no longer available, and one has access only to the trained predictor and fresh unlabeled covariates. We study SD in this prediction-only regime...

💬 0 commentsarXiv:2607.15450v1PDF
0

Posted in math.AP · 2026-07-04 · Fugui Ma, Zhimeng Ouyang, Wenyi Tian, Lei Wu

Dynamics of Chemotactic Gliding-Aggregation in Myxobacteria on Bounded Domains: Stochastic Modeling, Analysis, and Deep Neural Network Simulations

Bacterial chemotactic movement and collective aggregation have long attracted substantial interest in mathematical biology and applied modeling. Classical Keller--Segel-type systems, however, are typically formulated under idealized laboratory assumptions, such as smooth agar substrates, and thus cannot adequately capture the gliding...

💬 0 commentsarXiv:2607.03677v1PDF
0

Posted in math.NT · 2026-07-04 · Yuchen Ding, Huixi Li, Junfeng Li

A Romanoff-type theorem for $P_2$+{$a^a$: a$\ge$ 1}

Let $Ω(n)$ denote the number of prime factors of $n$, counted with multiplicity, and put $P_2$={$m$ $\ge$ 1:$Ω(m)$ $\le$ 2}. We prove that the sumset $P_2$+{$a^a$: a$\ge$ 1} has positive lower density. The proof uses the Romanoff second moment method, in the spirit of Li and Pan's theorem on $P_2$+$2^{\mathcal P}$. The main new...

💬 0 commentsarXiv:2607.03662v1PDF
0

Posted in math.NT · 2026-07-03 · Danyao Wu, Pingzhi Yuan, Xuan Pang

On the inverses of permutation polynomials of the form $h(ψ(x))\varphi(x)+g(ψ(x))$ over finite fields

In this paper, we investigate the compositional inverses of permutation polynomials of the form \[ F(x)=h(ψ(x))\varphi(x)+g(ψ(x)) \in \mathbb{F}_{q^n}[x], \] where \(ψ(x),\varphi(x) \in \mathbb{F}_{q^n}[x]\) are additive polynomials, \(h(x), g(x) \in \mathbb{F}_{q^n}[x]\) satisfy $ h(ψ(\mathbb{F}_{q^n})) \subseteq...

💬 0 commentsarXiv:2607.03630v1PDF
1

Posted in math.NT · 2026-07-09 · Liuquan Wang, Shangwen Wang

Modular Nahm Sums for the Inverse Cartan Matrix of Type $D_r$

For $r\geq 3$ we denote by $\mathcal{C}(D_r)$ the Cartan matrix of type $D_r$. Recently, Sun and Wang conjectured a Rogers--Ramanujan type identity for the Nahm sum associated with $\mathcal{C}(D_r)^{-1}$ and the zero vector. They further conjecture that there exist $r-1$ companion modular Nahm sums associated with nonzero vectors. We...

💬 1 commentsarXiv:2607.08606v1PDF
1

Posted in math.CO · 2026-07-15 · Maria Chudnovsky, Julien Codsi, Matjaž Krnc, Martin Milanič

Excluding paths and bicliques

Classes of graphs excluding a path and a biclique as induced subgraphs are extensively studied in the literature. One of the key structural results for such graphs is a Ramsey-type result due to Galvin, Rival, and Sands (1982), establishing the existence of a function $f$ bounding the maximum length of a path in terms of clique number...

💬 1 commentsarXiv:2607.13995v1PDF
1

Posted in math.CO · 2026-07-15 · Jiamin Li, Dan Li, Xilong Yin, Yuanyuan Chen

Spectral extremal problems on planar and outerplanar graphs without $C_{k,l}

Let $\emph{spex}_{\mathcal{P}}(n,F)$ and $\emph{spex}_{\mathcal{OP}}(n,F)$ be the maximum spectral radius among all $n$-vertex $F$-free planar graphs and outerplanar graphs, respectively. Define $C_{k,l}$ as a graph obtained from $C_k \cup C_l$ such that the two cycles share a common vertex, where $l \ge k \ge 3$. In the 1990s,...

💬 1 commentsarXiv:2607.13538v1PDF
0

Posted in math.PR · 2026-07-17 · Beatrice Acciaio, Antonio Marini

Existence of $q$-Bass martingales in the semidiscrete setting

The class of $q$-Bass martingales provides a natural answer to a central question in martingale optimal transport: how to construct martingales with prescribed initial and terminal marginals whose transition kernel remains as close as possible to a given reference measure $q$. We prove the existence of $q$-Bass martingales when the...

💬 0 commentsarXiv:2607.15872v1PDF
0

Posted in math.NT · 2026-07-17 · Jakab Schrettner

Defining reduction types of curves via minimal regular and minimal normal crossings models

We propose a definition of the reduction type of a curve over a discretely valued field in terms of the special fibre of an arbitrary regular model. We show that under this definition, the reduction type in terms of the minimal regular model determines and reduction type in terms of the minimal regular normal crossings model and vice...

💬 0 commentsarXiv:2607.16159v1PDF
0

Posted in math.GT · 2026-07-17 · Zhongzi Wang, Xiaoyu Xu

Profinite rigidity of simple closed curves in surface groups

This paper establishes a new characterization of simple closed curves on a closed orientable surface. Let $Γ$ be the fundamental group of a closed orientable surface. We prove that if an element $g\inΓ$ has the same possible images as a given simple closed curve $γ\in Γ$ under epimorphisms from $Γ$ to every finite group, then $g$...

💬 0 commentsarXiv:2607.16147v1PDF
0

Posted in math.PR · 2026-07-17 · Alexander Gnedin, Marcos C. S. Carreira

The Memoryless Best-Choice Problem

A random sequence sampled from a known continuous distribution is observed with the objective to choose an item with the overall rank one. A rejected item cannot be recalled and is immediately erased from the memory. Under this memory constraint, the choice problem is not amenable to recursive methods of optimal stopping and becomes a...

💬 0 commentsarXiv:2607.16145v1PDF
0

Posted in math.AP · 2026-07-17 · Daniel Peralta-Salas, Jie Wan

Piecewise smooth stationary Euler flows with support in a neighborhood of a helix

We construct stationary solutions of the three-dimensional incompressible Euler equations with helical symmetry and support in a neighborhood of a helix. The solutions are piecewise smooth and arise from a nonlinear overdetermined elliptic boundary value problem associated with a stream-function formulation. A distinguishing feature...

💬 0 commentsarXiv:2607.16141v1PDF
0

Posted in math.AP · 2026-07-17 · Arnaud Debussche, Martina Hofmanová

Fluctuation dynamics in randomly advected Navier-Stokes equations below critical scaling

We study randomly advected incompressible Navier-Stokes equations, where the advecting field is a mean-zero, divergence-free, space-time stationary velocity field with smooth order-one correlations. We introduce a two-parameter family of models in which the advection is accelerated on a fast temporal scale $\varepsilon^2$ and has...

💬 0 commentsarXiv:2607.16132v1PDF
0

Posted in math.CO · 2026-07-17 · Robert Morris, Julian Sahasrabudhe, Jacques Verstraëte

On the Erdős-Rogers function

We show that the Erdős-Rogers function $f_{s,s+1}(n)$ satisfies $$f_{s,s+1}(n) = Θ( \sqrt{n \log n} )$$ for every $s \ge 2$. More precisely, we construct a $K_{s+1}$-free graph on $n$ vertices in which every set of at least $C(s)\sqrt{n \log n}$ vertices contains a copy of $K_s$ for some constant $C(s)$, which implies the upper bound....

💬 0 commentsarXiv:2607.16118v1PDF
0

Posted in math.CO · 2026-07-17 · Vladimir Bošković

Flip dynamics on perfect matchings beyond bipartite and planar graphs

We study the flip dynamics on perfect matchings of graphs, where a flip consists of replacing the edges of a perfect matching along an even cycle with the complementary alternating edges. In particular, we want to bound the minimum length of cycles such that any two perfect matchings are related by flips of such cycles. Given a...

💬 0 commentsarXiv:2607.16101v1PDF
0

Posted in math.CO · 2026-07-17 · Kimberly P. Hadaway

Parking completions are $\mathbf{x}$-parking functions

Parking functions correspond with preferences of $n$ cars which enter sequentially to park on a one-way street where (1) each car parks in the first available spot greater than or equal to its preference and (2) all cars successfully park. We generalize parking functions to parking completions: Here, we are given that some cars have...

💬 0 commentsarXiv:2607.16098v1PDF
0

Posted in math.ST · 2026-07-17 · Felix Gnettner, Hyemin Yeon, Piotr Kokoszka

Dimension-invariant uniform consistency of the empirical spatial distribution function and its associated spatial depth estimator

We provide a proof that the empirical spatial distribution estimator in $\mathbb R^d$ as well as the corresponding plug-in estimator of the spatial depth are uniformly $L^1$-consistent. The consistency rate only depends on the sample size $n$, not on the dimension $d$ or any tuning or regularization parameters. This is a rare...

💬 0 commentsarXiv:2607.16092v1PDF