<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Paperlane: new arXiv mathematics</title>
<link>https://pragyaangaur.dev/Paperlane/</link>
<atom:link href="https://pragyaangaur.dev/Paperlane/feed.xml" rel="self" type="application/rss+xml"/>
<description>New arXiv mathematics papers each day, with code and Lean signals. Thank you to arXiv for use of its open access interoperability.</description>
<language>en</language>
<lastBuildDate>Wed, 18 Nov 2026 15:41:11 +0000</lastBuildDate>
<item><title>[math.AG] Quantum $K$-theoretic Whitney relation for Lagrangian Grassmannian</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21654.html</link><guid isPermaLink="false">arxiv:2611.21654v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><category>math.CO</category><category>math.KT</category><category>math.QA</category><category>math.RT</category><description>&lt;p&gt;Takafumi Kouno&lt;/p&gt;&lt;p&gt;We give a quantum $K$-theoretic analogue of the Whitney relation for the torus-equivariant $K$-ring of the Lagrangian Grassmannian. As a consequence, we give a presentation of the torus-equivariant quantum $K$-ring of the Lagrangian Grassmannian. The strategy for obtaining such relations is to use the quantum $K$-theoretic Whitney relation for the full-flag manifold in type $C$ established by the author and Kato&amp;#x27;s pushforward map from the quantum $K$-ring of the full-flag manifold to that of the partial flag manifold. Then the Nakayama-type argument established by Gu et al., together with the classical Whitney presentation for the torus-equivariant $K$-ring of the Lagrangian Grassmannian, gives a proof of such a presentation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21654v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Remarks on Fourier--Mukai invariances</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21703.html</link><guid isPermaLink="false">arxiv:2611.21703v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><category>math.AC</category><description>&lt;p&gt;Elías Guisado Villalgordo, Pat Lank&lt;/p&gt;&lt;p&gt;This note proves that smoothness and Gorensteinness are Fourier--Mukai invariants for proper flat families of Noetherian algebraic spaces. Moreover, a kernel realizing such a partnership is perfect if, and only if, the families are smooth.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21703v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Topology of some smooth real Fano threefolds arising from blow-ups along rational curves</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21866.html</link><guid isPermaLink="false">arxiv:2611.21866v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Guillaume Kineider&lt;/p&gt;&lt;p&gt;We describe the topological blow-up of a fibre of a Seifert fibration. We then apply this result to determine the diffeomorphism types of the real loci of smooth real Fano threefolds obtained by blowing up either $\mathbb{P}^3_{\mathbb{R}}$ or a smooth real quadric threefold along a smooth real rational curve. As an application, we also determine the topology of the real loci of the two real forms of the quintic del Pezzo threefold $V_5$, completing the topological classification of smooth real rational del Pezzo threefolds.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21866v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] The Nygaard graded piece, the Frobenius--Witt cotangent complex and regularity criteria</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22214.html</link><guid isPermaLink="false">arxiv:2611.22214v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><category>math.AC</category><category>math.NT</category><description>&lt;p&gt;Ryo Ishizuka, Kanau Shimada&lt;/p&gt;&lt;p&gt;For a $p$-torsionfree $p$-quasisyntomic ring, we construct a fiber sequence relating the $p$-th Nygaard graded piece of absolute prismatic cohomology to the Frobenius--Witt cotangent complex. The latter is an arithmetic analogue of the cotangent complex in which the differential of $p$ need not vanish. We also clarify the relationship between the regularity criterion proved by Mao using the Frobenius--Witt cotangent complex and the regularity criterion established by Bhatt and Mathew using the Nygaard graded piece. This relationship was anticipated by Bhatt and Mathew.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22214v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Maximum number of cells in a matroid subdivision of hypersimplex</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22754.html</link><guid isPermaLink="false">arxiv:2611.22754v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Mahyar Hasani&lt;/p&gt;&lt;p&gt;David Speyer proved that the maximum number of cells in a regular matroid subdivision of the hypersimplex $Δ(m,t)$ is $\binom{t-2}{m-1}$ , using the language of tropical geometry and properties of the Tutte polynomial of a matroid \cite[Theorem 6.1]{Speyer}. In this paper, we prove this result in general, i.e. for arbitrary matroid subdivisions including the non-regular ones. We perform a different combinatorial way using our results in \cite{HHH} and independent of tropical language.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22754v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Tannaka groups of holonomic D-modules on semi-abelian varieties are almost connected</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22919.html</link><guid isPermaLink="false">arxiv:2611.22919v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Constantin Podelski&lt;/p&gt;&lt;p&gt;In this short note we prove that Tannaka groups arising from convolutions of D-modules on complex semi-abelian varieties are almost connected. This generalizes results known for tori on the one hand and abelian varieties on the other.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22919v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Hypersurfaces that are far from ruled</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22972.html</link><guid isPermaLink="false">arxiv:2611.22972v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Elia Fiammengo&lt;/p&gt;&lt;p&gt;We show that a very general complex hypersurface of degree $d$ in $\mathbb P^{n+1}$ is not ruled whenever $n\geq3$ and $d\geq2\lceil(n+2)/3\rceil$. This improves Kollár&amp;#x27;s original degree bound to the bound subsequently obtained by Totaro for stable irrationality and, in particular, includes very general quartic fourfolds. More precisely, we find new bounds for the minimal degree of a dominant rational map from a very general hypersurface to a ruled variety or a conic bundle, improving on previous bounds of Chen--Stapleton. The proofs combine Kollár&amp;#x27;s reduction to positive characteristic with the Jacobson correspondence for inseparable extensions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22972v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] Generators of derived category and toric Frobenius morphism</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22992.html</link><guid isPermaLink="false">arxiv:2611.22992v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Rinat Dosaev&lt;/p&gt;&lt;p&gt;We investigate the action of the toric Frobenius pushforward functor on the derived category of a toric variety. Our main goal is to characterize objects of the derived category which become generators after applying a sufficiently high Frobenius pushforward. In particular, we extend a conjecture of A.Hanlon, J.Hicks, and O.Lazarev, which describes line bundles with this property, to arbitrary equivariant objects, and prove the extended conjecture for all smooth toric varieties.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22992v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] On Green&#x27;s Conjecture for Curves on Anticanonical Surfaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22997.html</link><guid isPermaLink="false">arxiv:2611.22997v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Samir Geiger, Andreas Kretschmer&lt;/p&gt;&lt;p&gt;We prove Green&amp;#x27;s conjecture for smooth curves $C$ on rational surfaces $X$ such that $-K_X|_C$ is effective on $C$. In addition, on birationally ruled surfaces $X$ of irregularity $q \geq 1$ carrying an effective anticanonical divisor, we show that Green&amp;#x27;s conjecture holds for all smooth curves $C$ on $X$ covering the base curve with degree at least $2$, provided the latter has only finitely many gonal pencils or the gonality of $C$ is special with respect to the ruling.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22997v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] The profinite shape equivalence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23061.html</link><guid isPermaLink="false">arxiv:2611.23061v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><category>math.AT</category><description>&lt;p&gt;Tim Holzschuh&lt;/p&gt;&lt;p&gt;We show that, for every $\infty$-topos $\mathcal{X}$, the profinite shape induces a canonical equivalence between the $\infty$-category of pro-objects in locally constant constructible sheaves of anima in $\mathcal{X}$ and the slice $\infty$-category of profinite anima over the profinite shape $\widehatΠ_{\infty}(\mathcal{X})$. We deduce this profinite shape equivalence from the monodromy classification theorem by establishing a continuous version of the straightening-unstraightening equivalence for profinite anima. In addition, we explain how the monodromy classification theorem recovers its classical counterparts concerning locally constant sheaves of finite sets and of (abelian) groups.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23061v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AG] General curves on smooth quadric hypersurfaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23141.html</link><guid isPermaLink="false">arxiv:2611.23141v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AG</category><description>&lt;p&gt;Carl Lian&lt;/p&gt;&lt;p&gt;We prove a sharp existence theorem for non-degenerate maps from a general curve to a smooth quadric hypersurface, deforming in a smooth family of expected dimension. Along the way, we prove that if a general curve in projective space lies on a quadric (as dictated by the Maximal Rank Conjecture, now a theorem of E. Larson), then a general such quadric is smooth.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23141v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AT] Enriched nerves, interleaving distances and the multiplicative magnitude-path spectral sequence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22433.html</link><guid isPermaLink="false">arxiv:2611.22433v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AT</category><description>&lt;p&gt;Katsuhiko Kuribayashi&lt;/p&gt;&lt;p&gt;By regarding the nerves of categories enriched over a monoidal poset as persistence simplicial sets, we investigate an upper bound of the interleaving distance in the homotopy category between the nerves in the sense of Lanary and Scoccola. In particular, it holds that the distance between the nerves for $r$-homotopy equivalent generalized metric spaces is less than or equal to the half of $r$. Moreover, a product on the cochain complex associated with a persistence simplicial set is introduced and related to the cup product on the magnitude cochain complex in the sense of Hepworth. As a consequence, the product gives the multiplicative structure to the cohomological magnitude-path spectral sequence (MPSS) whose first term is isomorphic to the magnitude cohomology ring. Furthermore, we discuss at which term the MPSS for a connected finite digraph collapses by using the interleaving of the enriched nerve of the digraph.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22433v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AT] Associative Log Rings and their Bimodules</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23064.html</link><guid isPermaLink="false">arxiv:2611.23064v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AT</category><category>math.AG</category><category>math.KT</category><description>&lt;p&gt;Deik van der Horst, Tommy Lundemo&lt;/p&gt;&lt;p&gt;We propose a definition of associative log rings. The role of the commutative monoid is replaced by a variant of a crossed module whose source is a monoid, and we use the resulting group action to control the failure of commutativity. This extends the classical notion of a log ring, even in the commutative case. Natural examples include algebras of logarithmic differential operators. The definition lends itself to a canonical construction of a log enveloping algebra and hence of log bimodules, and we prove that the resulting second log Hochschild cohomology group classifies log square-zero extensions. Along the way, we complete the logarithmic analog of Quillen&amp;#x27;s classification of abelian group objects in augmented algebras: In exact augmented associative log rings, abelian group objects recover log bimodules. Our constructions enjoy animated analogs, and we develop the basic theory of associative animated log rings \emph{en route} to our classification of exact log square-zero extensions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23064v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AT] A bordism perspective on ends of manifolds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23166.html</link><guid isPermaLink="false">arxiv:2611.23166v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AT</category><description>&lt;p&gt;Fadi Mezher&lt;/p&gt;&lt;p&gt;We refine the classical pro-homotopy type of the end of a manifold by recording the boundaries of a compact exhaustion together with the bordisms between them. We show that this assignment, the bordism-end, is functorial in embeddings, and independent of the choice of exhaustion. Its target is the free sequential colimit completion of the bordism $\infty$-category. Along the way of defining the bordism-end, we show that the category of all smooth $d$-dimensional manifolds and embeddings is formally obtained from the analogous category of compact manifolds. Through the formalism of the bordism-end, it follows that a manifold is diffeomorphic to the interior of a compact manifold if and only if its bordism-end is representable. Moreover, this formalism yields a fibre sequence relating the classifying spaces of the compactly supported diffeomorphism group of a manifold and its full diffeomorphism group, and a space of bordism-ends. Finally, we set up the pro-end functorially in embeddings, with target the cospan $\infty$-category of pro-spaces, and show that it factors through the bordism-end.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23166v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Solution Spaces of the Minimal Surface and Monge-Ampère Equations near Infinity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21693.html</link><guid isPermaLink="false">arxiv:2611.21693v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Qing Han, Jui-Yun Hung&lt;/p&gt;&lt;p&gt;In this paper, we study the constructions of all solutions to the minimal surface equation and the Monge-Ampère equation near infinity and the parametrization of these solutions by harmonic functions. It is well-known that Dirichlet boundary value problems in exterior domains do not always admit solutions. We demonstrate that prescribing asymptotic behaviors forms a new type of problem leading to all solutions near infinity. The harmonic functions determining the asymptotic behaviors play the role of ``free data&amp;quot; as the boundary values in the boundary value problems.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21693v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Linearization of nonlocal elasticity based on nonlocal gradients via Γ-convergence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21872.html</link><guid isPermaLink="false">arxiv:2611.21872v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math-ph</category><description>&lt;p&gt;José Carlos Bellido, Guillermo García-Sáez&lt;/p&gt;&lt;p&gt;We provide a rigorous variational derivation of linear nonlocal elasticity from a general nonlinear elastic model based on nonlocal gradients. Under standard assumptions of nonlinear elasticity, we prove that the rescaled nonlinear energies Γ-converge, in the small-strain limit, to the corresponding quadratic linearized energy. The proof relies on a nonlocal geometric rigidity estimate and does not require any global upper growth condition on the stored-energy density.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21872v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Quantitative unique continuation for semiclassical Witten-Schrödinger type operator with low regular coefficients</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21874.html</link><guid isPermaLink="false">arxiv:2611.21874v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Sébastien Campagne&lt;/p&gt;&lt;p&gt;In this note we study eigenfunctions localization of the semiclassical selfadjoint Schrödinger operator with low regular coefficients on domains of $\mathbb{R}^2$. We show a unique continuation result on the local decay of the eigenfunction: local supremum on open sets can&amp;#x27;t vanish faster than global supremum on these same sets times an exponential term that decrease in the semiclassical limit $h\to 0$ as $\exp(-c\log(1/h)/h)$ in the worst case. We deduce from this result a control on the eigenfunctions of the semiclassical Schrödinger operator on a $W^{2,\infty}$ compact Riemann surface with Lipschitz positive metric and with Robin boundary condition. This last part leads us to study the Schrödinger operator with a Witten Laplacian.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21874v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Finite time blow-up for the Willmore flow of symmetric figure-eight tori</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21887.html</link><guid isPermaLink="false">arxiv:2611.21887v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.DG</category><description>&lt;p&gt;Fabian Rupp, Manuel Schlierf&lt;/p&gt;&lt;p&gt;We show that the Willmore flow of symmetric figure-eight tori of revolution produces a finite time singularity, provided the initial energy is below $12π$. Our approach relies on the connection with elastic curves in the hyperbolic plane and a fine analysis of Palais--Smale sequences in the relevant energy regime.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21887v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Orbital Stability and Instability of Slow and Fast Solitary Waves of gILW</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21989.html</link><guid isPermaLink="false">arxiv:2611.21989v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math-ph</category><description>&lt;p&gt;Diego Yupanqui&lt;/p&gt;&lt;p&gt;We study the solitary waves of the generalized Intermediate Long Wave equation (gILW), for a power-type nonlinearity of order $p\geq1$. Using concentration-compactness and symmetric rearrangement, we prove existence of suitable (even, strictly positive and radially decreasing) solitary waves of gILW for every $p\geq1$, and show that, as the depth parameter tends to infinity, they converge in the energy space and in $L^q$, $q\in[2,\infty]$, to the solitary waves of the generalized Benjamin-Ono equation (gBO), while, as the depth parameter tends to zero, after a suitable rescaling, they converge in $L^q$, $q\in[2,\infty]$, to the solitary waves of the generalized Korteweg-de Vries equation (gKdV). Our main results concern the orbital stability of slow and fast solitary waves of gILW, that is, of those for which the product $δc$ of the depth parameter and the velocity is small or large, respectively. For slow waves we obtain stability for $p=1,2,3$ and instability for $p\geq5$ (the same threshold as for gKdV), while for fast waves we obtain stability for $p=1$ and instability for $p\geq3$ (the same threshold as for gBO). In particular, for $p=3$ the stability of the solitary waves changes from one regime to the other. These results extend to $p&amp;gt;1$ the classical result of Albert, Bona and Henry for the Intermediate Long Wave equation ($p=1$). The proof proceeds by perturbation theory, transferring spectral information from gKdV and gBO to gILW through the convergence of the corresponding solitary-wave operators, and in particular avoids any use of an explicit formula for the solitary wave profile, none being available for $p&amp;gt;1$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21989v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Multiplicity of Solutions for a Class of Logistic Problems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22002.html</link><guid isPermaLink="false">arxiv:2611.22002v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;M. L. M. Carvalho, C. Goulart, M. C. M. Rezende, R. Ruviaro&lt;/p&gt;&lt;p&gt;The present paper investigates the existence and multiplicity of positive solutions to a class of degenerate logistic problems by combining the Nehari manifold {method} with nonlinear generalized Rayleigh quotients. The quotient associated with the Nehari constraint determines the threshold $λ_*$ at which the fibering structure and the Nehari manifold geometry emerge, while a second quotient identifies the zero-energy threshold $λ^*$ associated with the minimizing solution. Together with the threshold $\barλ$ for the existence of nontrivial solutions, these results yield the strict ordering \( 0&amp;lt;λ_*&amp;lt;\barλ&amp;lt;λ^*&amp;lt;λ_1(Ω)&amp;lt;λ_1(Ω_0), \) showing that the Nehari geometry becomes available before nontrivial solutions {exist} and that the zero-energy transition occurs only afterwards. In the variational range, we obtain a positive minimizing solution on $\mathcal N_λ^+$ and a second positive solution via the Mountain Pass Theorem. Complementary sub-supersolution and truncation arguments extend the multiplicity result to the remaining parameter range. We also establish the sign change of the minimizing energy, the blow-up and normalized asymptotic profile of the minimizing solutions as $λ\uparrowλ_1(Ω_0)$, and the convergence of the mountain-pass level $c_λ^m$ to zero as $λ\uparrowλ_1(Ω)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22002v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Finite-Time Blow-up for the Radial Mass-Critical Fractional Nonlinear Schrödinger Equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22003.html</link><guid isPermaLink="false">arxiv:2611.22003v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Ngoc Uyen Cong Nguyen, Van Duong Dinh&lt;/p&gt;&lt;p&gt;We prove that radial negative-energy strong solutions to the focusing mass-critical fractional nonlinear Schrödinger equation \[ i\partial_tu=(-Δ)^su-|u|^{4s/N}u, \quad N\ge2,\quad \frac12&amp;lt;s&amp;lt;1, \] blow up in finite time. This resolves the finite-time blow-up versus infinite-time grow-up alternative left open by Boulenger, Himmelsbach and Lenzmann in the mass-critical regime. The argument uses an exponentially localized virial field together with a dyadic resolvent estimate that transfers the resulting weighted Balakrishnan energy to localized fractional Sobolev norms. When $s\ge N/(2N-1)$, we extend the conclusion to radial $H^s$ solutions by establishing the integrated virial identity at energy regularity. As a consequence, mass-critical ground-state standing waves are strongly unstable by finite-time blow-up.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22003v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Stokes flow in a wedge with a moving contact point: well-posedness with a fixed contact angle and Navier slip</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22008.html</link><guid isPermaLink="false">arxiv:2611.22008v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>physics.flu-dyn</category><description>&lt;p&gt;Manuel V. Gnann, Hans Knüpfer, King Ming Lam, Nader Masmoudi, Jonas Sauer&lt;/p&gt;&lt;p&gt;We study 2D Stokes flow in a wedge-like region bounded by a solid substrate with Navier slip and by a free surface driven by surface tension. The two meet at a moving contact point with a fixed contact angle. This is the model of a moving contact line at scales below the slip length, in its simplest setting. The slip length is the only length scale, and nothing is prescribed at the contact point beyond the angle: no relaxation law for the angle, and no contact-point dissipation. Slip removes the paradox found by Huh and Scriven, the infinite dissipation at a contact line that moves without slip, but in this model a weaker singularity remains. We give, to our knowledge, the first rigorous characterisation of this singularity for solutions of the free-boundary problem near the stationary state. For small contact angles and small initial data satisfying two compatibility conditions, we prove local existence, uniqueness and Lipschitz dependence on the data. The compatibility conditions are the price of the fixed angle for solutions regular in time up to the initial time. Rather than hiding the singularity, the solution class carries it explicitly in corner expansions. The velocity is continuous up to the contact point. The pressure has a logarithmic singularity, the slip-regularised version of that of Huh and Scriven. Its coefficient is proportional to the contact-point velocity. The slope of the free boundary has a corresponding logarithmic correction, the slip-scale counterpart of the Cox-Voinov relation. The linearised problem combines terms of different scaling, which prevents a direct treatment by the Mellin transform. We solve it by a Lax-Milgram argument, and an auxiliary test function problem shows that the variational solution satisfies the equations. Explicit Mellin representations then yield the corner expansions, and the nonlinear problem is solved by a contraction argument.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22008v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Radial nodal action ground states with two prescribed masses for coupled Schrodinger equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22040.html</link><guid isPermaLink="false">arxiv:2611.22040v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Yumeng Chou, Huabo Zhang&lt;/p&gt;&lt;p&gt;We study normalized nodal solutions of a cooperative system of nonlinear Schrödinger equations with two independently prescribed masses. For sufficiently small positive coupling, we obtain a radial nodal action ground state for every mass pair in a fixed compact subset of the positive quadrant. We first minimize the action on a radial nodal Nehari set at fixed frequencies. We then select both frequencies through an interior minimization of the action level. In this way, we adapt the scalar action approach of De Coster--Dovetta--Galant--Serra (\emph{Ann. Inst. H. Poincaré Anal. Non Linéaire}, 2026) to construct solutions whose components both change sign and whose action is minimal among radial nodal solutions at the selected frequencies.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22040v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Heat-wave semigroup estimates and the compressible Navier-Stokes Equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22127.html</link><guid isPermaLink="false">arxiv:2611.22127v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Rongshan Chen, Zihua Guo&lt;/p&gt;&lt;p&gt;We study the connection between the heat-wave semigroup and the compressible Navier-Stokes (CNS) equations. On one hand, the parabolic-hyperbolic nature of the CNS motivated the study of space-time estimates for the heat-wave semigroup by using recent harmonic analysis development, in particular, the local smoothing estimates for the wave equations; on the other hand, we apply the new estimates to obtain global well-posedness for CNS in the optimal critical Besov spaces. For the latter purpose, we introduce a new iteration framework for CNS that exploits some intrinsic structures of the equations, so that we can successfully apply these estimates.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22127v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] On the uniqueness of ground states for pseudo-relativistic boson stars</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22155.html</link><guid isPermaLink="false">arxiv:2611.22155v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Pan Chen, Qi Guo, Xiaoyu Zeng&lt;/p&gt;&lt;p&gt;We establish the uniqueness of both action and energy ground states for the pseudo-relativistic Hartree equation. The latter, for every prescribed mass below the critical stellar mass, proves the Lieb-Yau conjecture. Our approach establishes radial nondegeneracy and a strict monotonicity property of the mass-frequency relation, providing a unified framework for proving uniqueness in both variational settings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22155v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] A Study of the PDE Model for the Anisotropic Consensus-Based Optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22208.html</link><guid isPermaLink="false">arxiv:2611.22208v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.OC</category><description>&lt;p&gt;Hui Huang, Keyu Li, Jinhuan Wang&lt;/p&gt;&lt;p&gt;We investigate the nonlinear Fokker--Planck equation associated with anisotropic consensus-based optimization. Under suitable assumptions on the objective function, we establish global existence and uniqueness of density-valued weak solutions for bounded initial probability densities with finite fourth moment. The main analytical challenge arises from the component-wise degeneracy of the diffusion, which vanishes along moving coordinate hyperplanes determined by the weighted consensus point. To overcome this difficulty, we develop spatial translation estimates based on weighted gradient bounds and uniform density estimates. Combined with temporal translation and moment estimates, these yield strong compactness in $L^2((0,T)\times\mathbb{R}^d)$ through the Fréchet--Kolmogorov compactness criterion, enabling passage to the limit in the regularized equations. Uniqueness is established through the associated McKean--Vlasov stochastic differential equation and Wasserstein stability of the weighted consensus point. Furthermore, we prove the propagation of $H^2$-regularity for sufficiently regular initial data.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22208v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] The Pólya-Szegő inequalities for polygons</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22305.html</link><guid isPermaLink="false">arxiv:2611.22305v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Hedong Wang&lt;/p&gt;&lt;p&gt;Of the simple polygons of given area with at most $n$ sides, $n\ge5$, the regular $n$-gon uniquely maximizes torsional rigidity and minimizes the first Dirichlet eigenvalue, up to congruence. The same polygon minimizes the Dirichlet Sobolev quotient for $1\le q\le2$. For convex polygons the proof uses mixed boundary problems on a partition. When there are fewer than $n$ convex vertices, the exterior angles give a lower bound on the torsion deficit. The torsion and eigenvalue inequalities have quadratic stability in Hausdorff distance at fixed area and at fixed perimeter, with optimal exponent.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22305v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Synchronized Normalized Solutions for a Critical Caffarelli--Kohn--Nirenberg System</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22319.html</link><guid isPermaLink="false">arxiv:2611.22319v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Shengbing Deng, Yifan Zhao&lt;/p&gt;&lt;p&gt;We study positive synchronized normalized solutions to the critical Caffarelli--Kohn--Nirenberg system: \begin{equation*} \left\{ \begin{aligned} -\operatorname{div}(|x|^{-2a}\nabla u) &amp;amp;=λ_1|x|^{-2a}u+β_1|x|^{-bq}|u|^{q-2}u &amp;amp;\quad+|x|^{-bp}\left( μ_1|u|^{p-2}u +να|u|^{α-2}u|v|^γ \right),\quad\text{in }\mathbb R^N, -\operatorname{div}(|x|^{-2a}\nabla v) &amp;amp;=λ_2|x|^{-2a}v+β_2|x|^{-bq}|v|^{q-2}v &amp;amp;\quad+|x|^{-bp}\left( μ_2|v|^{p-2}v +νγ|u|^α|v|^{γ-2}v \right),\quad\text{in }\mathbb R^N, \end{aligned} \right. \end{equation*} subject to the prescribed weighted masses \begin{equation*} \int_{\mathbb R^N}|x|^{-2a}u^2\,dx=ρ_1^2, \qquad \int_{\mathbb R^N}|x|^{-2a}v^2\,dx=ρ_2^2, \end{equation*} where $N\geq5$, $0\leq a&amp;lt;\frac{N-4}{2}$, $a&amp;lt;b&amp;lt;a+1$, $α,γ&amp;gt;1$, $α+γ=p=\frac{2N}{N-2(1+a-b)}$, $2&amp;lt;q&amp;lt;p$, $β_i,μ_i,ρ_i&amp;gt;0$ for $i=1,2$, and $ν&amp;gt;0$. The associated Lagrange multipliers $λ_1,λ_2\in\mathbb R$ are unknown. Under suitable algebraic compatibility conditions, we establish existence and multiplicity results for positive synchronized normalized solutions. The construction is based on synchronized reduction and critical energy estimates involving a finite-mass Caffarelli--Kohn--Nirenberg extremal. In the mass-subcritical regime, we find two positive solutions with opposite energies when $β=β_1ρ_1^{q-2}=β_2ρ_2^{q-2}$ is sufficiently small. In the mass-critical and mass-supercritical regimes, we obtain a synchronized Pohozaev ground state below the critical energy threshold for sufficiently small $β$ and for all $β&amp;gt;0$, respectively.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22319v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global strong solutions to isentropic compressible Navier--Stokes equations under a scaling-invariant smallness condition in $\mathbb{R}^2$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22324.html</link><guid isPermaLink="false">arxiv:2611.22324v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Huanyao Wen, Jiayan Wu&lt;/p&gt;&lt;p&gt;In this paper, we consider the Cauchy problem for the isentropic compressible Navier--Stokes equations with vacuum at far field in two dimensions. Under an explicit scaling-invariant smallness condition on the initial data, we establish the global existence and uniqueness of strong solutions. The scaling-invariant smallness condition implies some classes of large data. The main difficulty is to obtain a uniform upper bound for the density under such the condition. Some new estimates of the dissipation and time-weighted energy estimates with explicit dependence on the initial data are derived, which control the effective viscous flux and close the a priori upper bound for density. In addition, we also obtain algebraic decay of the pressure and the velocity gradient.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22324v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global Well-Posedness of Two-Dimensional Compressible Navier--Stokes Equations with Vacuum under a Scaling-Invariant Smallness Condition</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22325.html</link><guid isPermaLink="false">arxiv:2611.22325v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Boqiang Lü, Xin Song&lt;/p&gt;&lt;p&gt;In this paper, we consider the Cauchy problem for the two-dimensional isentropic compressible Navier--Stokes equations with vacuum as far-field density. For the initial data that satisfy suitable regularity conditions, we establish the global well-posedness of strong solutions, provided that the scaling-invariant initial quantity \( \barρ \big( \|ρ_0\|_{L^1} + \barρ^{-2γ} \|ρ_0\|_{L^1}^{-1} + \barρ^{\frac{α(γ+1)}{2}} \|ρ_0 |x|^α\|_{L^1} \big) (1+\barρ E_0)^{3/2} \big( \|\nabla u_0\|_{L^2}^2 + \|ρ_0^γ\|_{L^2}^2 \big) \) is sufficiently small. Moreover, if the initial data possess additional higher order regularity and satisfy the corresponding compatibility condition, the global strong solution becomes a classical one. %The smallness condition above is invariant under the natural scaling of the two-dimensional isentropic compressible Navier--Stokes system. %A key point of the proof is to use this scaling to normalize the density upper bound \(\barρ\). Meanwhile, a priori large-time decay estimates for both the pressure and the spatial gradient of the velocity field are obtained in \(L^2\) at rate \(t^{-1/2}\), together with the same rate for the density-weighted material derivative of the velocity. The initial density is allowed to contain vacuum, and vacuum at infinity is included. In particular, compactly supported initial density is admissible. The result provides a scaling-invariant smallness framework for the global well-posedness theory of two-dimensional compressible barotropic flows with far-field vacuum.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22325v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Growth of Sobolev Norms for Linear Schrodinger Equations with Denjoy--Carleman Potentials</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22340.html</link><guid isPermaLink="false">arxiv:2611.22340v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.DS</category><description>&lt;p&gt;Yuan Wu, Huining Xue&lt;/p&gt;&lt;p&gt;We consider the linear Schrödinger equation on a torus of arbitrary dimension with a real time-dependent potential satisfying a mixed space--time Denjoy--Carleman condition. More precisely, for an increasing concave weight \(ω(r)\asymp \log^σ(e+r)\), \(σ&amp;gt; 1\),we assume \[ \sup_{t\in\mathbb R}|\partial_t^q\widehat V(k,t)| \le Ae^{Bq^{p}}e^{-ρ_{0}ω(|k|)},\qquad p=\fracσ{σ-1}. \] The corresponding spatial class is strictly larger than every Gevrey class, while the moment factor gives the quantitative ultradifferentiable control in time needed by the finite normal form. We adapt the method of Delort and Fang--Zhang to this non-power Fourier weight. The essential new point is a quantitative operator calculus whose majorant is built from the moment sequence and an auxiliary factorial that closes the exact Leibniz convolutions. For every $s&amp;gt;0$ we prove \[ \|u(t)\|_{H^s}\le C_s \exp\{C_s[\log(2+|t|)]^{\frac{1}σ}\} \|u(0)\|_{H^s}. \] The estimate is valid for every \(t\in\mathbb R\), holds in every space dimension, requires neither smallness, quasi-periodicity, nor a transversality condition.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22340v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global well-posedness and regularization for a nonlinear relativistic Fokker--Planck equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22381.html</link><guid isPermaLink="false">arxiv:2611.22381v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math-ph</category><description>&lt;p&gt;Simone Calogero&lt;/p&gt;&lt;p&gt;We consider a nonlinear relativistic Fokker--Planck equation on momentum space, whose diffusion coefficient and drift vector field are nonlinear integral functionals of the solution. We prove global existence and uniqueness of weak probability density solutions preserving the relativistic energy-momentum $(E,P)$. A fundamental step in the proof is to establish that the scalar diffusion coefficient remains uniformly positive on every finite time interval. The key mechanism ensuring this property is the strict relativistic inequality $E^2-|P|^2&amp;gt;1$, combined with the uniform integrability of the energy tails on every finite time interval. We further prove that global weak solutions become instantaneously smooth and strictly positive for positive times. Finally, for even initial data, we prove that the diffusion coefficient remains uniformly positive for all time.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22381v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Normalized solutions for logarithmic $p$-Laplacian equations on graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22437.html</link><guid isPermaLink="false">arxiv:2611.22437v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Wenyuan Ma, Anfeng Yuan&lt;/p&gt;&lt;p&gt;We study a logarithmic $p$-Laplacian equation with prescribed $L^2$ mass on connected locally finite weighted graphs, with $p &amp;gt; 2$. By minimizing the energy, we obtain a positive solution for every prescribed mass $m &amp;gt; 0$ on finite graphs and, under additional assumptions on the vertex measure and the potential, on infinite graphs. We describe the behavior of positive solutions and their Lagrange multipliers as $m \to 0^+$ or $m \to +\infty$. In particular, as $m \to 0^+$, the minimizers rescaled to unit mass converge along subsequences to functions supported at a single vertex.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22437v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Forward Self-similar Solutions of the Incompressible Navier-Stokes Equations in Dimensions Five and Higher</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22463.html</link><guid isPermaLink="false">arxiv:2611.22463v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Baishun Lai, Ruiyi Zhang, Xiaoxin Zheng&lt;/p&gt;&lt;p&gt;We construct forward self-similar solutions to the incompressible Navier--Stokes equations in $\mathbb{R}^n$ ($n\ge 5$) for arbitrary $(-1)$-homogeneous, divergence-free initial data $u_0$ smooth on the unit sphere. For $n\ge 6$, the $O(|y|^{-3})$ bound on the nonlinear residual of the linear heat profile no longer yields $L^2(\mathbb{R}^n)$-integrability, obstructing a direct global energy perturbation around $e^Δu_0$. To overcome this difficulty, we truncate $u_0$ near the origin via a divergence-free cutoff and take the time-one slice of the resulting Navier--Stokes flow as the background profile, whose residual reduces to a parabolic scaling derivative evolving in $L^2(\mathbb{R}^n)$ from compactly supported data. Choosing a large cutoff radius yields a global $H^1(\mathbb{R}^n)$ remainder and a forward self-similar weak solution converging strongly to $u_0$ in $H^1_{\mathrm{loc}}(\mathbb{R}^n)$ as $t\downarrow 0$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22463v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Stability for a multi-frequency inverse source problem in diffusion-based tomography</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22501.html</link><guid isPermaLink="false">arxiv:2611.22501v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Dong Qiu, Xiang Xu, Ruiting Zhao, Yue Zhao&lt;/p&gt;&lt;p&gt;This paper is concerned with the inverse source problem for the time-harmonic diffusion equation arising in optical tomography. In inhomogeneous media, we establish a conditional logarithmic stability estimate by using multi-frequency boundary flux measurements. The proof combines a boundary observability inequality for the associated heat equation with quantitative analytic continuation. For constant coefficients, we further derive an increasing stability estimate with explicit dependence on the frequency bandwidth. In this case, the analysis employs complex polynomial interpolation of the Fourier-Laplace transform of the source. We also implement a multi-frequency Landweber iteration with a discrepancy-based stopping rule to reconstruct the sources. Numerical experiments show an overall improvement in reconstruction accuracy and resolution as the frequency bandwidth increases under the tested noise settings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22501v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Remarks on uniqueness and nonuniqueness for the isotropic $L_p$-Minkowski problem with $p&lt;-n$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22527.html</link><guid isPermaLink="false">arxiv:2611.22527v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.DG</category><description>&lt;p&gt;YanNan Liu, Jian Lu&lt;/p&gt;&lt;p&gt;We study uniqueness and nonuniqueness for the isotropic $L_p$-Minkowski problem with $p&amp;lt;-n$. For $n\geq3$, we prove uniqueness for $p$ just below $-n$ without any symmetry assumptions. Moreover, for $n\geq8$, we obtain nonuniqueness for $p$ just above $-2n-3$, even under full simplex symmetry. The proofs use the Chou-Wang obstruction and Lyapunov-Schmidt reduction.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22527v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Helicity conservation for compressible barotropic Euler flows: regularity criteria and a momentum-based approach</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22540.html</link><guid isPermaLink="false">arxiv:2611.22540v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Pu Wang, Xiang Xia, Yulin Ye&lt;/p&gt;&lt;p&gt;In this paper, we study helicity conservation for weak solutions to the compressible barotropic Euler equations. Using generalized Constantin-E-Titi-type commutator estimates that fully exploit the kinetic energy, we derive new sufficient conditions for helicity conservation across a broader range of regularity exponents. These conditions reveal the interplay between temporal, spatial integrability and differentiability of the velocity and density, as well as the influence of velocity-density coupling on helicity conservation. A key feature of our approach is that helicity conservation is established directly from the momentum equation, without invoking the vorticity equation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22540v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Scaling-invariant smallness and global strong solutions to the three-dimensional isentropic compressible Navier--Stokes equations with a non-vacuum far-field density</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22550.html</link><guid isPermaLink="false">arxiv:2611.22550v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Lin Xu, Xin Zhong&lt;/p&gt;&lt;p&gt;We consider the Cauchy problem for the three-dimensional isentropic compressible Navier--Stokes equations with a positive far-field density $ρ_\infty$. We identify the following scaling-invariant quantity associated with the initial data: \begin{align*} ρ_\infty^{\frac{3-γ}{2}} \left( \|\nabla u_0\|_{L^2}^2 +P(ρ_\infty) \Big( \frac12\int_{\mathbb{R}^3}ρ_0|u_0|^2\,dx +\int_{\mathbb{R}^3}G(ρ_0)\,dx \Big) \right), \end{align*} where $G$ denotes the relative potential energy density with respect to $ρ_\infty$. Provided that the scaling-invariant quantity is sufficiently small, we establish the global existence and uniqueness of strong solutions, allowing the initial density to contain interior vacuum and exhibit large oscillations. The smallness criterion depends explicitly on the far-field density through the prefactor $ρ_\infty^{(3-γ)/2}$ and the background pressure $P(ρ_\infty)$. Our result provides a non-vacuum counterpart to Wen&amp;#x27;s scaling-invariant global existence result for the far-field vacuum case (\textit{Adv. Math.} \textbf{482} (2025), Paper No. 110628).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22550v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global existence and semi-classical limit for the spatially inhomogeneous Fermi--Dirac Fokker--Planck equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22558.html</link><guid isPermaLink="false">arxiv:2611.22558v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Ju-Hwan Hyun&lt;/p&gt;&lt;p&gt;In this paper, we study the global existence and the semi-classical limit of the spatially inhomogeneous Fermi--Dirac Fokker--Planck equation. We first establish the existence and uniqueness of a global weak solution for initial data with finite mass and second velocity moment satisfying the Pauli bound. When the initial datum also has finite spatial second moment and finite free energy, we prove that the solution satisfies the Fermi--Dirac free energy inequality. Next, as the quantum parameter $\hbar$ goes to zero, we prove that the solution of the Fermi--Dirac Fokker--Planck equation converges strongly to the classical Fokker--Planck solution in $\mathcal C([0,T];L^1_j(\mathbb R^d\times\mathbb R^d))$ for all $j\in[0,2)$. We also obtain a quantitative convergence rate in $\hbar$ when both equations share the same bounded initial datum.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22558v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] A Liouville theorem for the Hénon parabolic equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22568.html</link><guid isPermaLink="false">arxiv:2611.22568v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Yuxia Guo, Wenjun Wang, Tingfeng Yuan&lt;/p&gt;&lt;p&gt;We prove that every nonnegative classical entire solution of $u_t-Δu=|x|^αu^p$ in $\mathbb{R}^n\times\mathbb{R}$ is identically zero when $n\ge3$, $α\ge0$, and $1 &amp;lt; p &amp;lt; \frac{n+2+2α}{n-2}$. The same conclusion holds for weighted parabolic Gross--Pitaevskii systems with nonlinearities of degree $p=2r+1$ and constant coupling coefficients $β_{ij}=β_{ji}\ge0$ and $β_{ii}&amp;gt;0$. Both results include the unweighted case and require no boundedness, radial symmetry, spatial decay, finite-energy, or growth assumptions. The range is optimal for both problems: bounded nonzero nonnegative stationary solutions exist for $p\ge\frac{n+2+2α}{n-2}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22568v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Perturbation results for the Choquard equation in the sublinear case</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22590.html</link><guid isPermaLink="false">arxiv:2611.22590v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Simone Secchi&lt;/p&gt;&lt;p&gt;We study perturbations of the positive ground state of the Choquard equation $$ -Δu+u=(I_α*|u|^p)|u|^{p-2}u\qquad\text{in }\mathbb R^N $$ by means of a Lyapunov--Schmidt reduction. For $p\ge2$ the energy is $C^2$ on $H^1$ and a standard machinery applies. The case $α=2$, $1+2/N&amp;lt;p&amp;lt;2$ is different: the ground state has an algebraic decay and the energy is not twice differentiable on $H^1$. We introduce a weighted space adapted to the tail and we perform a finite-dimensional reduction on it. The outcome is a positive solution of a localized perturbation problem near every critical point of the first-order interaction functional with nonzero local degree. For the singularly perturbed problem with potential $V$ we obtain, under a small relative oscillation assumption, solutions concentrating near every critical point of $V$ with nonzero local degree, and a Lusternik--Schnirelman lower bound near compact sets of local minima. We also consider the variant in which $V$ multiplies both the linear and nonlocal terms, and we construct solutions that concentrate near isolated critical points of nonzero degree.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22590v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Improved contraction estimates for linear elliptic diffusion-advection-reaction equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22659.html</link><guid isPermaLink="false">arxiv:2611.22659v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Haesung Lee&lt;/p&gt;&lt;p&gt;This paper analyzes contraction estimates for the unique strong solution to a linear elliptic diffusion-advection-reaction equation in a bounded open subset of $\mathbb{R}^d$ with $d \geq 3$, where the zero-order coefficient lies in $L^{\frac{d}{2}}$ and the drift coefficient belongs to $L^p$ with $p \in (d, \infty)$. Compared with existing results, we obtain contraction estimates with improved constants in a quantitative sense. In particular, for the $L^\infty$-contraction estimate, the constant is shown to have the explicit form $\frac{1}α$, depending only on the constant $α&amp;gt; 0$ in the zero-order term. The key step is to represent the solution as the image of a weighted resolvent associated with a Dirichlet form.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22659v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Convection--diffusion equations with non-integrable initial data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22679.html</link><guid isPermaLink="false">arxiv:2611.22679v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Nicola De Nitti, Liviu I. Ignat, Fernando Quirós&lt;/p&gt;&lt;p&gt;We characterize the long-time behaviour of solutions to the convection--diffusion equation $u_t-u_{xx}+(|u|^{q-1}u)_x=0$, $q&amp;gt;1$, with initial data behaving like a non-integrable power at infinity, $|x|^γu_0(x)\to k_\pm$ as $x\to\pm\infty$, $0&amp;lt;γ\le1$. The decay rate in time and the asymptotic profile depend on the strength of convection as compared to the size of the solution at infinity, leading either to a convective behaviour or to a diffusive one. When the nonlinear convection dominates, we observe an enhanced dissipation effect: the decay rate in time is faster than for the purely diffusive equation with the same initial datum. For $0&amp;lt;γ&amp;lt;1$ we obtain the limit self-similar profile, which, in the convective regime, has one shock, or two when $k_+k_-&amp;lt;0$ and $|k_+|&amp;gt;\eps(γ,q)|k_-|$, where $\eps(γ,q)\in(0,1)$ is an explicit threshold. For $γ=1$ logarithmic corrections appear, and the limit is a multiple of the heat kernel if $q&amp;gt;2$ and an $N$-wave if $1&amp;lt;q\le2$. The convergence takes place in the spaces to which the datum belongs, and not only on expanding sets. The main new ingredients are an Oleĭnik type estimate of Hölder type valid for $q\geq 2$ and a far-field estimate, uniform in time, showing that beyond the self-similar region the solution is still described by its own datum.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22679v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Potential theory for double phase equations with measure data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22684.html</link><guid isPermaLink="false">arxiv:2611.22684v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Paolo Baroni&lt;/p&gt;&lt;p&gt;We develop a potential theory for elliptic equations with double phase growth and signed measure data. We establish existence of solutions obtained by approximation, pointwise bounds for the flux in terms of linear Riesz potentials, and nonlinear potential estimates for the solution in terms of generalized Wolff potentials; a quantitative decay estimate for the flux excess is the main ingredient and also yields a potential criterion for gradient continuity. The results cover both singular and degenerate equations, including the range $p&amp;gt;n$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22684v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Observability and Domain Shape Design for a Class of Degenerate Schrödinger Equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22698.html</link><guid isPermaLink="false">arxiv:2611.22698v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.OC</category><description>&lt;p&gt;Dong-Hui Yang, Mengze Gu, Wei Zhao, Yuanzhi Zhou&lt;/p&gt;&lt;p&gt;This paper investigates boundary observability for a class of two dimensional degenerate Schrodinger equations on the unit square. The diffusion matrix has diagonal entries x1 to the power alpha1 and x2 to the power alpha2, where both parameters lie between zero and one. Since the underlying degenerate elliptic operator lacks global H2 regularity, classical Rellich space time multiplier and hidden regularity arguments cannot be applied directly to weak solutions. We introduce a truncation parameter delta and construct uniformly elliptic problems on nondegenerate subdomains. Weighted Poincare inequalities, Sturm Liouville nodal properties, spectral decomposition, and Hilbert tensor product techniques yield an operator resolvent approximation and strong convergence of the state solutions and their boundary normal derivatives in suitable energy and trace spaces. Passing to the limit in the parameterized multiplier identities gives a boundary observability inequality for the original degenerate system on the nondegenerate active boundaries. When alpha1 is less than or equal to alpha2, the minimal observation time is 4 times the square root of 2 divided by the product of 1 minus alpha1 and 2 minus alpha2. This time tends to infinity as alpha1 tends to one, whereas it tends to 2 times the square root of 2 in the nondegenerate limit.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22698v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Sharp Fractional Capacitary-Distance Hardy Inequalities</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22706.html</link><guid isPermaLink="false">arxiv:2611.22706v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.CA</category><category>math.FA</category><description>&lt;p&gt;Yiqun Chen, Rupert L. Frank, Jie Xiao, Dachun Yang, Wen Yuan, Yangyang Zhang&lt;/p&gt;&lt;p&gt;Let $d\in\mathbb N$, $p\in(1,\infty)$, $p&amp;#x27;:=\frac{p}{p-1}$, and $s\in(0,\min\{1+\frac1p,\frac dp\})$. For an open set $Ω\subset\mathbb{R}^d$, let $F:=\mathbb{R}^d\setminusΩ$. For any $α\in(0,1]$ and $x\inΩ$, let \begin{align*} d_{α,s,p}(x) :=\inf\left\{r\in(0,\infty): \frac{\operatorname{cap}_{s,p}(\overline{F\cap B(x,r)})} {\operatorname{cap}_{s,p}(\overline{B(x,r)})}\geα\right\}, \end{align*} where $\operatorname{cap}_{s,p}$ is the capacity associated with the fractional Sobolev energy $[\,\cdot\,]_{s,p}^p$. In this article, we prove that there exists a positive constant $C$, depending only on $d$, $s$, and $p$, such that, for any $α\in(0,1]$ and $u\in C_{\rm c}^\infty(Ω)$, \begin{align*} \int_Ω\frac{|u(x)|^p}{d_{α,s,p}(x)^{sp}}\,dx \le Cα^{-p&amp;#x27;}[u]_{s,p}^p. \end{align*} We also show that both the exponent $p&amp;#x27;$ in $α^{-p&amp;#x27;}$ as $α\to0^+$ over the class of all open sets and the range $s\in(0,1+\frac1p)$ within $sp&amp;lt;d$ are sharp. Our proofs use variational minimization, equilibrium measures on trees, and weighted Hardy inequalities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22706v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Shape design for degenerate elliptic Equation with degenerate boundary and its application to quantitativeweak unique continuation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22747.html</link><guid isPermaLink="false">arxiv:2611.22747v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.OC</category><description>&lt;p&gt;Dong-Hui Yang, Yuanzhi Zhou&lt;/p&gt;&lt;p&gt;This paper investigates the unique continuation property (UCP) for a class of degenerate elliptic equations of the form $-\text{div}(A\nabla u) = λu$ in a bounded domain $Ω\s \mathbb{R}^N$ with Dirichlet boundary conditions. While unique continuation is well-established for uniformly elliptic operators via Carleman estimates or frequency-function methods, spatial degeneracy introduces substantial analytical obstacles in higher dimensions, particularly due to the lack of sufficient regularity for weak solutions and the breakdown of classical boundary integration-by-parts identities. To overcome these challenges, we develop an alternative framework based on the shape design (shape optimization) method under suitable structural assumptions. We highlight the fundamental distinction between qualitative and quantitative unique continuation in the degenerate setting. While qualitative UCP can sometimes be adapted from classical arguments, quantitative UCP requires explicit estimates that control the behavior of the solution throughout the domain by its behavior on a sub-domain. By integrating the shape design approach with a compatible weighted Hardy inequality, we establish new quantitative estimates and unique continuation results for higher-dimensional degenerate elliptic operators, bypassing the stringent regularity requirements of traditional methods.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22747v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Fine spectral analysis of concentrating solutions to Brezis--Nirenberg problem in dimension $4$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22775.html</link><guid isPermaLink="false">arxiv:2611.22775v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Silvia Cingolani, Minbo Yang, Shunneng Zhao&lt;/p&gt;&lt;p&gt;This paper is devoted to the qualitative properties and Morse indices of concentrating solutions to the Brezis--Nirenberg problem \[ -Δu=u^3+εu, \quad u&amp;gt;0, \quad\text{in }Ω, \qquad u=0 \quad \text{on }\partialΩ, \] where $Ω\subset\mathbb R^4$ is a smooth bounded domain, $ε&amp;gt;0$ is small parameter. For a family of $m$-bubble solutions with distinct interior concentration points and comparable concentration scales, we establish precise asymptotic expansions for the first $6m$ eigenvalues of the associated linearized eigenvalue problem and determine the corresponding eigenfunction profiles.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22775v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global rigidity and the Hessian energy identity for the one-phase Bernoulli problem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22799.html</link><guid isPermaLink="false">arxiv:2611.22799v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Zhouyu Long, Junbao Zhou&lt;/p&gt;&lt;p&gt;We prove that every entire classical stable solution of the one-phase Bernoulli problem in dimension five or six is one-dimensional. In dimensions three through six, we establish an exact interior identity for the scale-invariant Hessian energy of sequences with bounded Morse index. Hence, the global stability conjecture is solved.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22799v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Nonlinear Stability of Spiky Patterns for a Three-Dimensional Chemotaxis--Consumption Model with Signal-Dependent Motilities</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22803.html</link><guid isPermaLink="false">arxiv:2611.22803v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Lin Chang, Song Xu, Yuling Xu&lt;/p&gt;&lt;p&gt;We prove the nonlinear asymptotic stability of one-dimensional spiky steady states for a three-dimensional chemotaxis--consumption system with signal-dependent motility $w^p$ ($p&amp;gt;0$, $α\ge2$) in the half-cylinder $Ω=\mathbb{R}_+\times\mathbb{T}^2$. The cell density satisfies a no-flux boundary condition at $x_1=0$, while the chemical concentration satisfies $w(0,x&amp;#x27;,t)=b&amp;gt;0$ and vanishes as $x_1\to+\infty$. For any prescribed steady-state cell mass $λ&amp;gt;0$, we show that any sufficiently small compatible initial perturbation with zero mass generates a unique global strong solution that converges to the spiky steady state in $L^\infty(Ω)$, with the chemical concentration converging uniformly relative to the steady profile, namely $\|w(\cdot,t)/W-1\|_{L^\infty(Ω)}\to0$ as $t\to\infty$. The stability analysis for an arbitrarily large steady mass $λ&amp;gt;0$ in three dimensions involves four main difficulties: the algebraic degeneracy of the diffusion coefficient $W^p(x_1)\sim (1+x_1)^{-2/(α-1)}$ as $x_1\to\infty$, the $O(λ)$ linear coupling between the density perturbation and the chemical logarithmic gradient on the transversal nonzero modes, the nonlinear boundary conditions at $x_1=0$ produced by the Hopf--Cole transformation, and the different spatial weights required across derivative orders. We resolve these difficulties by introducing the algebraic weights $(ω_1,ω_2,ω_3)=(W^{-p}U^{-1},U^{-1},W^pU^{-1})$, coupling a weighted Neumann inverse on the transversal nonzero modes with the scalar logarithmic potential $Ψ+q$ to cancel the $O(λ)$ linear coupling terms exactly, performing tangential and time-differentiated weighted energy estimates whose boundary traces vanish identically at $x_1=0$, and closing the time-derivative energy before recovering the full weighted Hessian dissipation from the parabolic system.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22803v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Isolated singularities of solutions to the Yamabe equation with boundary in higher dimensions II</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22818.html</link><guid isPermaLink="false">arxiv:2611.22818v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Yuxuan Liao&lt;/p&gt;&lt;p&gt;This is the second of two papers on isolated boundary singularities of the scalar-flat boundary Yamabe equation. We construct positive solutions that violate the critical upper bound, proving that the dimension ranges in Part I are sharp. For general smooth metrics, the conformal metric can be incomplete near the singularity in every dimension $n\ge18$, and complete in every dimension $n\ge19$. For Euclidean domains with smooth boundary, both types exist for $n\ge23$. We also construct both types for metrics with totally geodesic boundary in dimensions $n\ge35$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22818v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Time-decay rates toward viscous shock waves for the one-dimensional compressible Navier-Stokes-Fourier system</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22836.html</link><guid isPermaLink="false">arxiv:2611.22836v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Le Chen, Yujie Wang&lt;/p&gt;&lt;p&gt;We study small H^2(R) perturbations of a fixed weak viscous 3-shock for the one-dimensional compressible Navier-Stokes-Fourier system. For each fixed initial perturbation, the error from the shifted profile in the uniform norm and the shift velocity are o(t^{-1/4}). Nearby stationary profiles give spatial estimates in terms of the time derivative. Estimates along the characteristics bound the perturbation at time t by the dissipation on [t/2, t]. The exponent 1/4 is sharp for a uniform bound on the small H^2 ball.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22836v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global strong solutions and large-time behavior for the two-dimensional Navier--Stokes--Poisson system with general bulk viscosity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22860.html</link><guid isPermaLink="false">arxiv:2611.22860v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Jing Han, Yanfang Peng&lt;/p&gt;&lt;p&gt;The global existence and uniqueness of strong solutions to the two-dimensional repulsive Navier--Stokes--Poisson system with general density-dependent bulk viscosity is established for arbitrarily large initial data allowing vacuum. The periodic problem and the Cauchy problem with a positive constant background are treated under a common growth condition on the viscosity primitive. The coefficient class includes every superlinear power law and near-linear laws with logarithmic gains. A density upper bound and low-order estimates, uniform in time and independent of a positive density lower bound, are obtained without an initial acceleration compatibility condition. Exponential relaxation is proved on the torus, and qualitative convergence to equilibrium is established in the whole space under a finite electric energy condition and without spatial moment assumptions. If the initial density vanishes at a point, the vacuum persists and density gradients become unbounded as time tends to infinity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22860v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Characterization of parabolic rectifiability in terms of Jones&#x27; square function</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22866.html</link><guid isPermaLink="false">arxiv:2611.22866v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.CA</category><description>&lt;p&gt;Simon Bortz, Aakash Gurung, Pablo Hidalgo-Palencia, Matthew Hyde&lt;/p&gt;&lt;p&gt;We show that a measure $μ$ in $\mathbb{R}^n \times \mathbb{R}$ equipped with the parabolic metric is rectifiable (in the parabolic sense) if and only if the Jones&amp;#x27; square function is finite $μ$-almost everywhere. This square function is constructed using the parabolic version of the Jones&amp;#x27; beta numbers, which control how close $μ$ is to being supported in time-independent planes (these planes are the paradigmatic example of parabolic rectifiable set). Our only background assumption is that $μ$ has positive and finite densities (qualitatively) almost everywhere. A key feature of our proof is the use of a parabolic version of the Reifenberg parametrization theorem, which in the Euclidean setting is due to David and Toro (MAMS, 2012), and has recently been extended to the parabolic setting by Hoffman, Mourgoglou and the fourth author. In the latter work, the authors construct a bi-Hölder map. Here, under an additional summability condition, we improve this construction to obtain a parabolic regular bi-Lipschitz map. This improvement in regularity plays a crucial role in our arguments.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22866v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Boundary concentration and minimum-mass bifurcation for inverse-power absorption</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22870.html</link><guid isPermaLink="false">arxiv:2611.22870v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Zhouyu Long, Hongzhe Tao, Wenming Zou&lt;/p&gt;&lt;p&gt;For \(Δu=λu^{-p}\), \(λ&amp;gt;0\), \(0&amp;lt;p&amp;lt;1\), we obtain a uniform half-plane profile law at moving points along smooth boundary arcs. It gives the exact local energy constant \(8p(1-p)/(1+p)^2\) for the secant potential at a common zero slope. On a one-corner domain, positive ordinary slopes at the minimum Martin mass \(m_*\) yield exactly two solutions at each nearby larger mass, with square-root displacement in the Martin norm. On these domains, for \(p\ne1/3\), there are at most two solutions at each nearby larger mass without a slope hypothesis, and just one if the endpoint energy kernel is trivial. We construct flat-tangent Lipschitz domains with an explicit slope loss and a logarithmic correction. The first construction gives a saturated endpoint with sharp Martin response of order \((m-m_*)^{1/(1+p)}\) and a compact energy operator. For \(p\ge1/2\) a second construction has positive local energy concentration and a strict global energy gap. As a result, we substantially advance the solvability and establish a sharp classification for the negative-power absorption equation in the Mazya 50 problem at the minimal mass endpoint, largely resolving the existence and regularity issues.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22870v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Moser--Trudinger inequalities and the complex Monge--Ampère mean field equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22876.html</link><guid isPermaLink="false">arxiv:2611.22876v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.CV</category><description>&lt;p&gt;Jie Deng, Xu-jia Wang, Bin Zhou&lt;/p&gt;&lt;p&gt;We study sharp Moser--Trudinger inequalities for the complex Monge--Ampère energy. On the unit ball, we determine the optimal energy coefficient and additive constant in the logarithmic Moser--Trudinger inequality. We deduce subcritical Moser--Trudinger inequalities in exponential form with explicit bounds proportional to $\varepsilon^{-1}$, where $\varepsilon$ is the relative distance to the critical coefficient. The proof establishes radial symmetry and uniqueness for the associated mean field equation by showing that every smooth solution has constant boundary normal derivative. This gives existence and uniqueness precisely for total masses $0&amp;lt;Λ&amp;lt;[2π(n+1)]^n$, proving Berman--Berndtsson&amp;#x27;s conjecture. We also establish smoothness of bounded pluripotential and finite-energy solutions. Domain monotonicity transfers the exponential estimates and the optimal logarithmic energy coefficient to bounded strictly pseudoconvex domains.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22876v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global solvability, regularity and exponential convergence in a quasilinear chemotaxis-haptotaxis system with mostly repulsive signal production</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22930.html</link><guid isPermaLink="false">arxiv:2611.22930v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Yuanlin Chen, Tian Xiang&lt;/p&gt;&lt;p&gt;Motivated by biological and mathematical viewpoints, we systematically investigate the global dynamics of a quasilinear chemotaxis haptotaxis system with mostly repulsive signal production. We show unconditional 2D boundedness, blow up prevention for parabolic-elliptic-ODE case in nD, small data boundedness and exponential convergence under endpoint Lebesgue smallness, and 3D weak-solution eventual regularity. Our findings extend the corresponding repulsive chemotaxis only theory to the chemotaxis haptotaxis setting and demonstrate a positive effect of chemo-repulsion on global dynamics.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22930v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Large diameter growth for vortex patches</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23059.html</link><guid isPermaLink="false">arxiv:2611.23059v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Junhong Fan, Dengjun Guo, Xiaoyutao Luo&lt;/p&gt;&lt;p&gt;For every $N&amp;gt;0$, the 2D incompressible Euler equation admits a smooth, simply connected vortex patch initially contained in the unit disk whose diameter exceeds $N$ at some finite time. We discover a point-vortex mechanism in which a bounded motion of three equal positive vortices drives a passive particle outward through successive transitions. A finite-time point-vortex approximation transfers the resulting separation to a single simply connected patch.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23059v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Well-posedness of compressible $2D$ nonlinear transport equations and quasiconformal maps</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23073.html</link><guid isPermaLink="false">arxiv:2611.23073v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Juan Carlos Cantero, Albert Clop, Daniel Faraco, David Horas, Joan Mateu, Joan Orobitg, Banhirup Sengupta&lt;/p&gt;&lt;p&gt;We prove uniqueness of solutions to a class of nonlinear transport equations in the plane, for which the velocity field is obtained as the convolution of the classical Cauchy kernel with the unknown. Even though the initial datum is bounded and compactly supported, the velocity field may have unbounded divergence. The proof relies on the theory of quasiconformal mappings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23073v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Inverse Boundary Value Problems for a Coupled Semilinear Klein-Gordon System</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23133.html</link><guid isPermaLink="false">arxiv:2611.23133v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Parveen Kumar, Soumen Senapati, Manmohan Vashisth&lt;/p&gt;&lt;p&gt;This article addresses the coefficient identification inverse problem for a coupled nonlinear Klein-Gordon equation with cubic nonlinearity. More precisely, we consider a coupled nonlinear Klein-Gordon equation in a bounded cylinder contained in $\mathbb{R}^{1+\ell}$, where $ \ell\geq 2$, and establish the unique recovery of the time-independent coefficients appearing in both the zeroth-order perturbation and nonlinearity term from both full and partial boundary measurements of the solution. The unique recovery of zeroth-order coefficients is obtained via first-order linearization; however, the nonlinearity coefficients are recovered using the higher-order linearization. Finally using the unique continuation principle, we establish the unique identification of the coefficients from the partial boundary measurements of the solution.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23133v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] $p$-harmonic polynomials</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23136.html</link><guid isPermaLink="false">arxiv:2611.23136v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Juan J. Manfredi, Aelson Sobral&lt;/p&gt;&lt;p&gt;We prove that every real polynomial $p$-harmonic function on $\Rn$ is affine when $n\ge3$ and $p\ge n-1/13$. The proof uses the Bernstein--Szegő inequality on great circles and a deficit estimate at the first Chebyshev node.&lt;/p&gt;&lt;p&gt;code https://github.com/na0b/pharmonicpoly-lean (Lean project: lakefile.lean, lean-toolchain; build: builds, no sorry at commit df7300b with leanprover/lean4:v4.35.0-rc2, checked 2026-11-18)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23136v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Global strong solutions and large-time behavior for the two-dimensional compressible Navier-Stokes-Poisson system with general bulk viscosity and Navier slip boundary conditions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23145.html</link><guid isPermaLink="false">arxiv:2611.23145v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Hongyu Wang, Rong Zhang&lt;/p&gt;&lt;p&gt;The global existence of a unique strong solution to the two-dimensional compressible Navier--Stokes--Poisson system with Navier slip boundary conditions is established in a smooth bounded domain that may be multiply connected. Arbitrarily large initial data and vacuum are allowed, and the positive doping profile may have large spatial variations. The bulk viscosity satisfies a logarithmic derivative bound and a growth condition on its primitive, including every superlinear power law and near-linear laws with a logarithmic gain larger than one half. Time-uniform density and velocity bounds and exponential convergence to the nonconstant hydrostatic state are obtained. For strictly positive initial density, uniform positivity and exponential convergence to the hydrostatic state in higher Sobolev norms are proved. An initial vacuum point persists and causes exponential growth of density gradients.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23145v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Non-homogeneous parabolic conormal boundary problem with singular-degenerate coefficients</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23210.html</link><guid isPermaLink="false">arxiv:2611.23210v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><description>&lt;p&gt;Junyuan Fang, Tuoc Phan&lt;/p&gt;&lt;p&gt;We study non-homogeneous conormal boundary value problems for a class of divergence-form parabolic equations whose volumetric heat-capacity coefficients belong to a Muckenhoupt class of weights. Consequently, the equations exhibit singular, degenerate, or simultaneously singular-degenerate behavior. Under smallness conditions on the partial mean oscillation of the diffusion coefficients and the weighted mean oscillation of the volumetric heat-capacity coefficient, we establish regularity estimates, existence, and uniqueness results in appropriate weighted Sobolev spaces. To obtain these results, we employ the level-set argument introduced by Caffarelli and Peral. We also establish weighted parabolic cylinders, weighted inequalities, and a weighted Aubin-Lions compactness theorem, which are essential tools in our analysis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23210v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CT] Quantitative FS-domains over continuous t-norms</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22843.html</link><guid isPermaLink="false">arxiv:2611.22843v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CT</category><description>&lt;p&gt;Yuxu Chen, Di Yang&lt;/p&gt;&lt;p&gt;We introduce quantitative FS-domains over continuous t-norms using a scalar-valued finite-separation degree and an approximate identity. The construction recovers classical FS-domains over the Boolean base. Symmetric quantitative FS-domains are characterized by compactness of their ball topology. In particular, a complete metric space is a quantitative FS-domain if and only if it is compact. Quantitative FS-domains are continuous and form a symmetric monoidal closed category under tensor products and function spaces of Yoneda-continuous maps. This category is Cartesian closed exactly for the Gödel t-norm.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22843v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Pinned simplex volumes from thin sets in Euclidean spaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21833.html</link><guid isPermaLink="false">arxiv:2611.21833v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><description>&lt;p&gt;Tainara Borges, Benjamin Foster, Alex Iosevich, Yumeng Ou, Eyvindur Palsson&lt;/p&gt;&lt;p&gt;Let $E\subset\mathbb R^d$ be a Borel set, with $d\geq2$. We prove that if $\dim_{\mathrm H}(E)&amp;gt;d/2$, then there exist distinct points $a,b\in E$ such that the set of triangle areas with fixed base $a,b$ and third vertex varying in $E$ has positive Lebesgue measure. More generally, for $2\leq r\leq d$, if \[ \dim_{\mathrm H}(E)&amp;gt; \max\left\{r-1,\frac{d-r+2}{2}\right\}, \] then there are $r$ affinely independent points in $E$ for which the corresponding base-pinned $r$-simplex volume set has positive Lebesgue measure. The geometric input is a thin-plane estimate of Bright, Ortiz, and Zakharov \cite{BrightOrtizZakharov}. For a suitable $(r-2)$-dimensional anchor spanned by $E$, this estimate yields simultaneous Frostman bounds for a projected vertex measure in the normal space of the anchor and for the distribution of directions determining bases that share the anchor. The Peres--Schlag machinery \cite{PeresSchlag}, applied to a local family of distance-to-line maps in this $(d-r+2)$-dimensional normal space, then produces the desired base. Finally, we establish an exact correspondence between fixed-base simplex volumes and pinned distances in the normal space of the base, prove a converse for matched bases in layered lifts, and obtain the lower obstruction $\max\{r-1,d/(2r)\}$ for any universal dimension threshold.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21833v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] A counterexample to the one-supremum conjecture and sharp logarithmic weighted bounds for Calderón--Zygmund operators</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22097.html</link><guid isPermaLink="false">arxiv:2611.22097v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><category>math.FA</category><description>&lt;p&gt;Xi Cen&lt;/p&gt;&lt;p&gt;We give a negative answer to the one-supremum conjecture of Hytönen and Lacey~\cite[Remark~1.3]{HL}, in the strong-type form stated by Lerner and Moen~\cite[Conjecture~1.3, formula~(9)]{LM}. The conjecture asks whether the mixed $A_p$--$A_\infty$ characteristics $K_p(w)$ and $K_{p&amp;#x27;}(σ)$, with both factors evaluated on the same cube, control Calderón--Zygmund operators without a logarithmic loss. For every $1&amp;lt;p&amp;lt;\infty$, we construct explicit weights for which $K_p(w)+K_{p&amp;#x27;}(σ)\eqsim_p m$, but one fixed Hilbert transform has weighted norm at least $m(1+\log m)^{γ_p}$, where $γ_p=\max\{1/p,1/p&amp;#x27;\}$. Thus the proposed bound fails even for a fixed singular integral. The counterexample also extends to a fixed Riesz transform in each dimension $n\ge2$. We further establish a logarithmically corrected bound for Calderón--Zygmund operators, with powers $1/p&amp;#x27;$ and $1/p$ on the respective one-supremum terms. Together, the lower and upper bounds identify $γ_p$ as the optimal common logarithmic exponent and give the sharp worst-case growth $(1+\log A)^{γ_p}$ under the constraint $[w]_{A_p}\le A$. The results show why information from any one cube cannot fully capture the accumulation of a singular integral across many scales.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22097v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Global existence and emergent dynamics of singular Cucker-Smale model on general digraphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22255.html</link><guid isPermaLink="false">arxiv:2611.22255v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><description>&lt;p&gt;Jinwook Jung, Hyungsuk Kang, Wonjin Lim, Eojin Shin&lt;/p&gt;&lt;p&gt;We investigate the global-in-time dynamics of the Cucker--Smale model under general network topologies with a singular communication weight function $ψ(r) = r^{-α}$, $α&amp;gt;0$. For $α\ge 1$, we establish the global-in-time existence of smooth solutions when network topologies belong to one of several classes of directed graphs. In particular, in one dimension, we present a necessary condition on the network topology for global existence by constructing finite-time blow-up solutions from non-collisional initial configurations. Moreover, we provide a sufficient framework for the emergence of mono-cluster flocking. For certain classes of network topologies, we further show that mono-cluster flocking occurs unconditionally for non-collisional initial configuration when $α=1$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22255v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Power loss for the local Mizohata--Takeuchi estimate on smooth hypersurfaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22465.html</link><guid isPermaLink="false">arxiv:2611.22465v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><category>math.AP</category><description>&lt;p&gt;Hannah Cairo, Inbo Gottlieb Fenves, Vjekoslav Kovač, Itamar Oliveira, Dmitrii Zakharov, Ruixiang Zhang&lt;/p&gt;&lt;p&gt;We prove power-type lower bounds for the local Mizohata--Takeuchi constants for $C^{2,β}$ hypersurfaces with $0&amp;lt;β\leq1$ whose second fundamental form is nonzero at some point. This result, in particular, disproves the so-called local Mizohata--Takeuchi conjectures for the paraboloid and the sphere and, in turn, presents an obstruction to a general weighted approach to the theory of Fourier restriction of those classical surfaces.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22465v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Subharmonic functions and convexity of the Radon transform, with applications to the Fourier transform</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22521.html</link><guid isPermaLink="false">arxiv:2611.22521v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><description>&lt;p&gt;A. Iosevich, E. Liflyand&lt;/p&gt;&lt;p&gt;Integrating a subharmonic function over parallel hyperplanes produces a convex function of the signed distance from the origin, provided that the function is absolutely integrable on bounded slabs. We prove this first for twice continuously differentiable functions and then without any smoothness assumption, and the same argument applies to a function defined only on a slab. Examples on the disk explain why subharmonicity on a bounded convex domain does not imply convexity of the integrals over its chords. We then apply a one-dimensional Fourier representation for convex functions to the Radon transform, which leads to a directional formula for integrable subharmonic functions on slabs. For functions on bounded convex domains whose Radon transforms are convex, we obtain a weighted estimate for the integral of the Fourier transform in terms of boundary layers and the gradient.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22521v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Sharp Weak-Type Inequalities for Scalar and Matrix Weights</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22671.html</link><guid isPermaLink="false">arxiv:2611.22671v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><category>math.AP</category><category>math.FA</category><description>&lt;p&gt;Fan Bu, Dachun Yang, Wen Yuan&lt;/p&gt;&lt;p&gt;Let $p\in(1,\infty)$ and $p&amp;#x27;:=\frac p{p-1}$. In this article, we establish a mixed multiplier weak-type inequality with weight dependence $[w]_{A_p}^{\frac1p}[w]_{A_\infty}^{\max\{\frac1p,\frac1{p&amp;#x27;}\}}$ for scalar $A_p$ weights and Calderón--Zygmund operators whose modulus of continuity satisfies the Dini condition. As a consequence, we obtain the sharp exponent $\max\{1,\frac2p\}$ of $[w]_{A_p}$ in the corresponding pure $A_p$ bound. Moreover, in the matrix-weighted setting, we prove the sharpness of the exponent $1+\min\{\frac1p,\frac1{p(p-1)}\}$ of $[W]_{\mathcal A_p}$ in the known multiplier weak-type inequality for the Hilbert transform.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22671v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Another Variant of the Neoclassical Inequality</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22692.html</link><guid isPermaLink="false">arxiv:2611.22692v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><description>&lt;p&gt;Stefan Gerhold&lt;/p&gt;&lt;p&gt;The neoclassical inequality is an inequality related to the binomial theorem, involving fractional powers. It naturally gives rise to four other similar inequalities, by varying the inequality sign and the range of the fractional parameter. Three of these statements are known, and the remaining one was conjectured in the literature, based on numerical evidence. It is proved in the present note. The method we use yields short proofs for two of the known related inequalities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22692v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Round hyperspheres uniquely minimize most tangent-point energies</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22920.html</link><guid isPermaLink="false">arxiv:2611.22920v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><category>math.GT</category><description>&lt;p&gt;Alexander Dohmen, Heiko von der Mosel&lt;/p&gt;&lt;p&gt;We show that round hyperspheres uniquely minimize a broad class of generalized tangent-point energies among all boundaries of bounded Caccioppoli sets sharing the same perimeter or enclosed volume. This includes closed $C^1$-hypersurfaces. Equivalently, we establish sharp lower bounds for the associated scale-invariant ratios of energy to surface measure and energy to volume, respectively, with equality precisely for round spheres.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22920v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CA] Circular Vector Tomography with Partial Radial Data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23199.html</link><guid isPermaLink="false">arxiv:2611.23199v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CA</category><description>&lt;p&gt;Rahul Bhardwaj, Indrani Zamindar&lt;/p&gt;&lt;p&gt;In this article, we introduce and study several generalized circular Radon transforms acting on smooth vector fields compactly supported in a planar annulus, with centers restricted to the outer acquisition circle and truncated measurement radii. The operators of interest are the longitudinal and transverse circular Radon transforms and their weighted analogues. We characterize the kernels of the individual unweighted transforms. Then we establish the reconstruction of a vector field from the combined longitudinal and transverse circular Radon transform data. We further show that the pairs formed by each transform and its weighted analogue is not sufficient for the complete recovery of a vector field. However, we demonstrate that full reconstruction is possible with suitable additional data. Finally, we numerically implement and validate the derived inversion formulas.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23199v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Counting formulas and refined generating functions for inversion-sequence Classes 152 and 207</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21657.html</link><guid isPermaLink="false">arxiv:2611.21657v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Haobo Ma, Toufik Mansour, Wenlin Zhang&lt;/p&gt;&lt;p&gt;For the two Class 152 pattern sets, we prove that the common number of inversion sequences of length \(n\geq 1\) is \(a_n=1+\sum_{j=1}^{n-1}\binom{2j}{j}\). The Class 152 proof uses first-descent and last-zero decompositions, with weighted Dyck paths evaluating the resulting generating functions. For Class 207, we prove equality of the three total-count series and give their common generating function as an explicit Lambert-series expression after the substitution \(z=q/(1+q)^2\). Complete legal-site and catalytic recurrences lead to a Lambert series for one class and \(q\)-product orbit sums for another. A cubic limit of the balanced nonterminating \({}_3φ_2\) \(q\)-Saalschutz summation identifies these expressions. Fixed-maximum expansions, finite verification data, refined analytic obstructions, and signed specializations are recorded in the supplementary material.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21657v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Co-edge-regular graphs with two $λ$-values and four distinct eigenvalues</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21664.html</link><guid isPermaLink="false">arxiv:2611.21664v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Suil O&lt;/p&gt;&lt;p&gt;A connected $k$-regular graph $G$ on $n$ vertices is co-edge-regular if any two distinct non-adjacent vertices have the same number of common neighbors. For adjacent vertices $u$ and $v$, let $λ(u,v)=|N(u)\cap N(v)|$. Ge and Koolen asked whether the theorem of Neumaier on strongly regular graphs with fixed smallest eigenvalue extends to co-edge-regular graphs with exactly four distinct eigenvalues in which $λ(u,v)$ takes exactly two values over the edges $uv$. In this paper, we answer this question. For every integer $t\ge2$ there is $n_t$ such that if $G$ is such a graph with smallest eigenvalue at least $-t$, $n\ge n_t$, and $k&amp;lt;n-2-(t-1)^2/4$, then either $G$ is a clique extension of a strongly regular graph, or $G$ is obtained from a strongly regular graph with a Hoffman coloring by adding all edges inside the color classes. Consequently, $G$ is a clique extension of a strongly regular graph, a $p\times q$ grid with $p\ne q$, or the block graph of a resolvable Steiner $2$-design in which every parallel class is made into a clique.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21664v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Resistance-regular graphs need not be regular</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21670.html</link><guid isPermaLink="false">arxiv:2611.21670v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Murad ul Islam Khan, Ghulam Haidar&lt;/p&gt;&lt;p&gt;A connected graph is resistance-regular if the sum of the effective resistances from a vertex to all other vertices does not depend on the vertex, or equivalently if the Moore-Penrose inverse of its Laplacian has constant diagonal. Walk-regular graphs have this property, and Zhou, Wang and Bu asked in 2016 whether every resistance-regular graph is regular, a question that also arises in the study of graphs with constant resistance curvature. We answer this question in the negative and examine both what resistance-regularity forces and how far from regular such graphs can be. On the spectral side, we prove that a connected graph is walk-regular if and only if the first $m-1$ powers of its Laplacian pseudoinverse have constant diagonal, where $m$ is the number of distinct nonzero Laplacian eigenvalues. Because resistance-regularity constrains only the first power, it forces regularity when $m\le2$ and allows at most two vertex degrees when $m=3$. Any non-regular resistance-regular graph has minimum degree at least $3$ and a connected complement, and an exhaustive computer search shows that it must have at least $13$ vertices. For every even $p\ge4$, we construct a resistance-regular graph on $4p$ vertices with degrees $2p-2$ and $2p-1$, obtaining closed formulas for its Laplacian spectrum and for all pairwise effective resistances. Using module blow-ups, we then construct $n$-vertex resistance-regular graphs whose two degrees differ by $(\sqrt{4n+1}-5)/4$ for infinitely many $n$, as well as examples with three and four distinct degrees, whereas the maximum and minimum degrees of any resistance-regular graph on $n$ vertices differ by less than $n/2$. We close by conjecturing that in a resistance-regular graph the sum of squared resistances at a vertex increases strictly with its degree.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21670v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Gallai&#x27;s path decomposition conjecture for $K_5$-minor-free graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21673.html</link><guid isPermaLink="false">arxiv:2611.21673v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Junhao Zhang, Qinghai Liu, Yanmei Hong&lt;/p&gt;&lt;p&gt;Gallai conjectured that the edges of every connected graph on $n$ vertices can be partitioned into at most $\ceil{n/2}$ paths. We prove that every connected $K_5$-minor-free graph other than $K_3$ and $K_5-e$ admits such a partition into at most $\floor{n/2}$ paths. The two exceptions require $\ceil{n/2}$ paths. In a smallest counterexample we find a $4$-connected planar part containing four vertices of degree five. Their neighborhoods meet the boundary in at most one vertex. This allows us to apply the planar configurations of Blanché, Bonamy, and Bonichon and to realize the reduced graph as a minor of the original graph.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21673v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The Conic Tverberg plus minus</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21868.html</link><guid isPermaLink="false">arxiv:2611.21868v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Egor Kolpakov&lt;/p&gt;&lt;p&gt;We prove a Tverberg type theorems: Given a set $A\subset \mathbb{R}^d$ and an affine subspaces $L_1,...,L_m\subset \mathbb{R}^d$. In some conditions there is a partition $A_1, ..., A_m, B_1, ..., B_m$ of $A$ such that the sets $L_i\cup A_i\cup B_i$ for $i=1,...,m$ have common barycentre with negative masses in $B_i$ and positive masses in $A_i$. The case $B_1=...=B_m=L_1=...=L_m=\varnothing$ is Tverberg&amp;#x27;s classical theorem. The case $L_1=...=L_m=\varnothing$ gives a partial answer to the question of Barany-Soberon about the possible number of negative masses.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21868v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Forbidden Substructures Preserved by the Blob Graph Operation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21961.html</link><guid isPermaLink="false">arxiv:2611.21961v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jakub Pączka, Agnieszka Przeździecka, Piotr Tyrakowski&lt;/p&gt;&lt;p&gt;The blob graph $G^\circ$ of a graph $G$ has a vertex for each non-empty connected vertex subset of $G$, with two distinct subsets adjacent whenever they intersect or are joined by an edge of $G$. This construction has been used in reductions from induced subgraph optimisation problems to maximum-weight independent set, where the preservation of forbidden substructures is essential. We completely characterise the graphs $H$ for which excluding $H$ from $G$ guarantees that $G^\circ$ also excludes $H$, under six containment relations. For subgraphs, minors, and topological minors, preservation holds exactly when $H$ has at most two vertices. For induced subgraphs, it holds exactly when $H$ is a linear forest. For induced topological minors, it holds exactly when $H$ is triangle-free and has maximum degree at most two. For induced minors, it holds exactly when $H$ is triangle-free and every neighbour of a vertex of degree at least three has degree exactly two. These classifications unify and extend preservation results previously established for particular forbidden graphs in algorithmic applications.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21961v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Supersaturation and reconfiguration diameter of independent transversals</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21966.html</link><guid isPermaLink="false">arxiv:2611.21966v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Wouter Cames van Batenburg, Penny Haxell, Ross J. Kang, Ronen Wdowinski&lt;/p&gt;&lt;p&gt;Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $Δ$. It is a classic result that when all parts have size at least $2Δ$, the collection is nonempty. Recently, it was found that if the parts have size at least $2Δ+1$, then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least $2Δ$, and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least $4Δ$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21966v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Shifted Hankel determinants via Hankel continued fractions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21968.html</link><guid isPermaLink="false">arxiv:2611.21968v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Guo-Niu Han, Lihong Yang&lt;/p&gt;&lt;p&gt;The Hankel determinants $H_n(F)$ of a power series $F(x)$, as well as the shifted ones $H_n^{(1)}(F)$ and $H_n^{(2)}(F)$, can be read off from its Jacobi continued fraction, provided that all $H_n(F)$ are nonzero. Without any condition on $F$, the Hankel continued fraction ($H$-fraction) still yields all $H_n(F)$. We show that the $H$-fraction of $F$ also determines the shifted Hankel determinants $H_n^{(1)}(F)$, $H_n^{(2)}(F)$ and the backward shifted ones $H_n^{(-1)}(F)$, and we give explicit formulas for them. As applications, we provide simple proofs of Hankel determinant evaluations that were previously established by means of complicated explicit $H$-fractions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21968v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Laplacian Eigenvectors of Generically Weighted Graphs Have Pairwise Distinct Coordinates</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21979.html</link><guid isPermaLink="false">arxiv:2611.21979v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.SP</category><description>&lt;p&gt;Santiago Pineda Montoya, Edisson Gallego González, Jaiberth Porras Barrera, Johan Heriberto Rúa Muñoz&lt;/p&gt;&lt;p&gt;Poignard, Pereira and Pade conjectured that, for a generic choice of the nonzero weights of a given graph, the Fiedler vector of the weighted Laplacian has pairwise distinct coordinates. We give a proof that also covers every nonconstant eigenvector. For each connected graph on n vertices we construct a nonzero homogeneous polynomial with integer coefficients in the edge weights, of degree n(n-1)(n^2-n+2)/4, which vanishes at a positive weighting exactly when the Laplacian has a repeated eigenvalue, an eigenvector with a zero coordinate, or a nonconstant eigenvector with two equal coordinates. The exceptional weights therefore lie in an algebraic hypersurface, which gives structural genericity in the sense of Poignard, Pereira and Pade; algebraically independent weights are never exceptional, and there are good integer weights not exceeding the degree plus one. The polynomial is a product of Krylov determinants. Its nonvanishing follows by induction on trees: when a leaf is attached with a small weight, a cut identity gives the first-order profile of the new eigenvector and separates the coordinates that coincide in the limit. Exact small cases show that exceptional weightings need not be symmetric.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21979v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Perfect matching complexes of antiprism graphs and independence complexes of generalized Petersen graphs $GP(n,2)$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22021.html</link><guid isPermaLink="false">arxiv:2611.22021v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Youngsoo Kim&lt;/p&gt;&lt;p&gt;We show that the perfect matching complexes of antiprism graphs and the independence complexes of the generalized Petersen graphs $GP(n, 2)$ are homotopy equivalent to wedges of spheres, and we determine the number and dimensions of the spheres. For the former we compute the initial values of Adamaszek&amp;#x27;s recursion for the independence complexes of cubes of cycles.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22021v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] New necessary conditions on $h$-vectors of simplicial balls</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22026.html</link><guid isPermaLink="false">arxiv:2611.22026v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.AC</category><description>&lt;p&gt;Luz Elena Grisales Gómez, Satoshi Murai, Isabella Novik&lt;/p&gt;&lt;p&gt;Although the $h$-vectors of simplicial balls of dimension at most $4$ have been completely characterized, much less is known in dimensions $5$ and higher. We establish new necessary conditions on the $h$-vectors of simplicial balls in these dimensions. Together with the necessary conditions of Billera and Lee and the sufficient conditions of Kolins, our results yield a complete characterization of the $h$-vectors of $5$- and $6$-dimensional simplicial balls. We also give a characterization of $h$-vectors of simplicial balls of any dimension with neighborly boundary.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22026v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An improved bound on the strong chromatic index via local flag algebras</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22031.html</link><guid isPermaLink="false">arxiv:2611.22031v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Runze Wang&lt;/p&gt;&lt;p&gt;A strong edge coloring is an edge coloring where two edges receive different colors if they are incident or joined by a third edge. For a graph $G$, the strong chromatic index of $G$, denoted by $χ&amp;#x27;_s(G)$, is the minimum number of colors needed for a strong edge coloring of $G$. In this paper, using a local flag algebra method, we prove that for every graph $G$ of sufficiently large maximum degree $Δ$, $χ&amp;#x27;_s(G)\le 1.642Δ^2$, improving the previous best bound $1.73Δ^2$ due to Davey, Hurley, de Joannis de Verclos, Kang, and Volec.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22031v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] FunSearch and Structured SAT Search for Weak Schur Partitions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22032.html</link><guid isPermaLink="false">arxiv:2611.22032v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Rebecca Vicenzi, Pablo Christofferson, Caleb Hartman, Jingxuan Feng, Suleman Khan, Omar M. Elshinawy, Eric Ramos&lt;/p&gt;&lt;p&gt;The weak Schur problem asks how large an interval of consecutive integers can be partitioned into a fixed number of classes with no class containing a monochromatic solution to $a+b=c$ with $a\neq b$. We investigate whether FunSearch, an evolutionary program-search method guided by a large language model, can discover effective construction strategies for this classical combinatorial problem. In our adaptation, FunSearch evolves a priority function used by a fixed greedy solver, while a separate validity check enforces the weakly sum-free condition. This approach matches the known exact values for two, three, and four classes and reaches $WS(5)\geq195$. We then explore a complementary SAT-based approach. Guided by structural information from a 207-element construction communicated by Fred Rowley (Rowley, 2026), our SAT search produces and verifies a distinct valid five-class partition of $\{1,\ldots,207\}$. Thus the strongest construction obtained in this project reaches $WS(5)\geq207$, eleven integers beyond the best published lower bound of 196. The contrast between the two approaches also exposes a limitation of our FunSearch formulation: its greedy solver makes local, irreversible decisions, whereas SAT can enforce global structure across the whole partition.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22032v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Cubic graphs with circumference ratio 21/22 and cyclic connectivity 5</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22037.html</link><guid isPermaLink="false">arxiv:2611.22037v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Ján Mazák&lt;/p&gt;&lt;p&gt;We construct a cyclically $5$-connected cubic graph of order $22m$ and circumference $21m$ for every $m\geq 3$. Consequently, the shortness coefficient of the class of cyclically $5$-connected cubic graphs is at most $21/22$, improving the previously known upper bound of $24/25$. We also demonstrate how I-reductions, which delete an edge and suppress its two end-vertices, can be used to prove cyclic connectivity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22037v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Positivity in symmetric webs and block permanents</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22058.html</link><guid isPermaLink="false">arxiv:2611.22058v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Daniel Tubbenhauer&lt;/p&gt;&lt;p&gt;We use symmetric webs to prove Marcus&amp;#x27;s block-permanent inequality for up to four blocks of every size, for five blocks of size at least three, and for any fixed number of blocks above an explicit logarithmic bound on the block size. The proof idea is easy: Bending strands in the Schur relation turns the comparison into a calculation with squared norms.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22058v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Toroidal Obstructions with No K_5 Minor</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22089.html</link><guid isPermaLink="false">arxiv:2611.22089v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Austin Ulrigg&lt;/p&gt;&lt;p&gt;Finding the complete set of forbidden minors for the torus remains an open problem. We determine the complete list of toroidal minor obstructions with no $K_5$ minor and prove that there are exactly $74$, each with between $10$ and $14$ vertices. Combined with the known classification of toroidal obstructions with no $K_{3,3}$ minor, this determines every toroidal obstruction that excludes one of the forbidden minors for planarity. The proof uses three-vertex cuts to show that, apart from $K_{3,7}$, every three-connected obstruction in this class has two distinct independent triples, each the common neighborhood of at least two degree-three vertices. The classification proceeds by considering the possible intersections of these triples and reduces each case by planarity tests and enumeration of the possible graph forms. From the $74$ minor obstructions we also obtain a complete list of $381$ topological obstructions for the torus with no $K_5$ minor.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22089v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Directed triangles in oriented graphs without a directed cycle of length $3t$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22104.html</link><guid isPermaLink="false">arxiv:2611.22104v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Shuchao Li, Mingli Wang&lt;/p&gt;&lt;p&gt;For integers $k,\ell\ge 3$, let $\operatorname{ex}(n,\Cdir_k,\Cdir_\ell)$ denote the maximum number of directed cycles of length $k$ in an $n$-vertex oriented graph containing no directed cycles of length $\ell$. Grzesik, Jaworska, Kielak, Kuc and Ślusarczyk~\cite{GJ} systematically studied the generalized Turán problem for directed cycles and conjectured that, for every fixed integer $t\ge 2$, $\operatorname{ex}(n,\Cdir_3,\Cdir_{3t})=\frac{t-1}{4}n^2+o(n^2)$. They proved this asymptotic formula for $t=2$. In this paper, we prove it for every fixed integer $t\ge 3$, thereby confirming the conjecture.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22104v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Real-Rootedness and Log-Concavity of Zigzag Eulerian Polynomials</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22110.html</link><guid isPermaLink="false">arxiv:2611.22110v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.CV</category><description>&lt;p&gt;Ethan Torres&lt;/p&gt;&lt;p&gt;We prove that the zigzag Eulerian polynomials have only real, negative, simple zeros, and hence strictly log-concave coefficients, settling the first two parts of a conjecture of Petersen and Zhuang. Real-rootedness in combinatorics is usually proved inside a single algebraic framework, such as interlacing or stability. Our proof rests on a different premise: different parts of a zero set become visible in different representations of the same polynomial, and classical tools suffice once each part is viewed in the right one. The bridge between representations is a local rule. Forgetting the order in which a bounded-jump path visits positions leaves only a nearest-neighbor condition on sorted gaps, which makes an encoding via a transfer matrix much simpler to see. From there the argument passes to complex analysis. The sizes of the matrix&amp;#x27;s eigenmodes locate the zeros at the two ends of the negative axis, through Rouché&amp;#x27;s theorem. In a logarithmic coordinate the generating function becomes a combination of derivatives of the hyperbolic secant, akin to the classical derivative polynomials, and the arguments of its nearest poles produce a sine that fixes the signs between consecutive central zeros. The zeros are thus read off from the poles of an associated kernel. More broadly, the proof suggests that combinatorial polynomials defined by local constraints carry analytic structure, in their spectra and in the poles of their kernels, that is complementary to the usual algebraic methods and that classical complex analysis can exploit directly.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22110v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] On Threshold Probabilities for the Stability of the Independence Number of a Random Subgraph</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22185.html</link><guid isPermaLink="false">arxiv:2611.22185v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.PR</category><description>&lt;p&gt;Vsevolod A. Pokhachevskiy, Andrei Raigorodskii&lt;/p&gt;&lt;p&gt;For an arbitrary sequence of graphs $G_n$, we consider a random spanning subgraph $G_{n,p}$ in which each edge of the graph $G_n$ survives independently of the others with probability $p$. We obtain a general upper bound for the independence number $α(G_{n,p})$, from which, for an arbitrary probability $p=p(n)$, we derive sufficient conditions for asymptotic stability, i.e., for the equality $α(G_{n,p})=(1+o(1))α(G_n)$ asymptotically almost surely, as well as upper bounds for the independence number of the random subgraph, including unconditional ones; for $p=1/2$ they recover A. M. Raigorodskii&amp;#x27;s results of 2017 and 2026. Under additional conditions on the structure of the independent sets of the graph $G_n$, we find, up to a constant factor, the threshold probabilities for both asymptotic and exact stability (the equality $α(G_{n,p})=α(G_n)$). Special cases include results on the graphs $G(n,r,&amp;lt;s)$ for growing $r$ and $s$, including Kneser graphs for growing $r$; we also give examples of complete multipartite graphs, graphs on the blocks of Steiner systems, and $q$-analogues of Kneser graphs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22185v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] More lower bounds for Hales--Jewett and van der Waerden numbers</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22205.html</link><guid isPermaLink="false">arxiv:2611.22205v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Younes Mouhib&lt;/p&gt;&lt;p&gt;We give explicit colourings improving the comparison lower bounds assembled here for several Hales--Jewett and van der Waerden numbers. The main algebraic tool generalises Rabung&amp;#x27;s power-residue colouring from arithmetic progressions to arbitrary sets. If every translate of a t-element set S in F_p meets at least two classes of the r-th power character, and the integer weights have both parities, then a period-2p one-weight colouring of [t]^p has no monochromatic combinatorial line. The 19 displayed algebraic certificates comprise 18 improvements and one closed-form reproduction; they include HJ(4,3)&amp;gt;=164, HJ(5,4)&amp;gt;=7418, and HJ(5,6)&amp;gt;=34034. The underlying period-p construction also proves kappa_ow(t,r)&amp;gt;=p-1 for the one-weight bracket ceiling, in particular kappa_ow(5,4)&amp;gt;=7416 and kappa_ow(5,6)&amp;gt;=34032. Warm breakout-weighted tabu search on the type simplex gives HJ(3,4)&amp;gt;=51. Whole-colouring local search gives W(8,3)&amp;gt;522, W(11,3)&amp;gt;1193, and W(17,3)&amp;gt;3620. All accepted certificates are available separately and are checked by direct enumeration; unresolved searches are reported as UNKNOWN, not UNSAT.&lt;/p&gt;&lt;p&gt;code https://github.com/ysmouhib/hj-vdw-reproducibility (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22205v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Between proper and strong edge-colorings of graphs with maximum degree at most four</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22254.html</link><guid isPermaLink="false">arxiv:2611.22254v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Aistis Atminas, Xujun Liu, Zihui Xu&lt;/p&gt;&lt;p&gt;A $(1^j,2^k)$-packing edge-coloring of a graph $G$ is a partition of its edge set $E(G)$ into $j$ matchings and $k$ induced matchings. It can be viewed as intermediate colorings between proper and strong edge-coloring. The study of this topic on subcubic graphs has drawn considerable attention recently, with many conjectures and open problems proposed and resolved. However, very few results are known for graphs with maximum degree four or more. Henderson, Kennedy, and Santana showed that every graph with degree at most four has a $(1,2^{19})$-packing edge-coloring and a $(1^2,2^{17})$-packing edge-coloring. In this paper, we improve the results of Henderson, Kennedy, and Santana by showing every graph with degree at most four has a $(1,2^{17})$-packing edge-coloring. As a corollary of our result, every graph with degree at most four has a $(1^2,2^{16})$-packing edge-coloring.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22254v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The Zaks--Perles--Wills volume conjecture I: three-dimensional lattice polytopes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22337.html</link><guid isPermaLink="false">arxiv:2611.22337v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Feihu Liu, Jinlong Tang, Sihao Tao, Zihao Zhang&lt;/p&gt;&lt;p&gt;We prove the three-dimensional Zaks--Perles--Wills volume bound for lattice polytopes with $k\ge3$ interior lattice points: the Euclidean volume of such a lattice polytope is at most $6(k+1)$, with equality if and only if the polytope is affinely unimodularly equivalent to $\operatorname{conv}(0,2e_1,3e_2,6(k+1)e_3)$. The inequality is strict when the minimum lattice width is at least three. Together with the known cases $k=1,2$, this completely resolves the three-dimensional Zaks--Perles--Wills volume conjecture.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22337v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Minimum degree thresholds for even cycle residues</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22346.html</link><guid isPermaLink="false">arxiv:2611.22346v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Hojin Chu, Masaki Kashima, Shun-ichi Maezawa, Boram Park&lt;/p&gt;&lt;p&gt;Dean&amp;#x27;s conjecture asserts that, for every integer $m\ge3$, every graph of minimum degree at least $m$ has a cycle whose length is divisible by $m$. This degree bound is best possible for odd $m$. For every integer $k\ge2$, we prove that every graph of minimum degree at least $2k-1$ has a cycle whose length is congruent to $r$ modulo $2k$ for every even $r\not\equiv2\pmod{2k}$. Consequently, $2k-1$ is the sharp minimum degree threshold for a cycle whose length is divisible by $2k$. For bipartite graphs, we prove that minimum degree at least $k$ guarantees the same residue classes for every $k\ge4$, and we characterize their end-blocks when no cycle has length congruent to $2$ modulo $2k$. The bipartite degree bound is also sharp, and the exclusion of residue $2$ is necessary even for connected graphs of arbitrarily large order.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22346v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A sharp minimum degree condition for Hamiltonicity in line graphs of 3-hypergraphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22507.html</link><guid isPermaLink="false">arxiv:2611.22507v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Kenta Ozeki, Leilei Zhang&lt;/p&gt;&lt;p&gt;Let $G$ be the line graph of a $3$-hypergraph, and let $n$ be its order. We prove that if $G$ is $3$-connected, $n\ge4936$, and $δ(G)\ge(n+5)/10$, then $G$ is Hamiltonian if and only if it does not belong to an explicitly described family of exceptional graphs. This extends the sharp minimum degree bound of Lai, Shao, and Zhan for $3$-connected claw-free graphs beyond the claw-free setting, since line graphs of $3$-hypergraphs may contain induced claws. The coefficient $1/10$ cannot be decreased, and the constant $5$ in the numerator cannot be replaced by $4$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22507v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Flip Combinatorial Invariance for flipclasses with small residues</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22528.html</link><guid isPermaLink="false">arxiv:2611.22528v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Francesco Esposito, Mario Marietti, Giovanni Paolini&lt;/p&gt;&lt;p&gt;We establish (Normal) Flip Combinatorial Invariance for flipclasses with no residues longer than 8. Actually, we show more generally that all flipclasses of finite type with no residues longer than 8 have only one increasing path. For flipclasses of Weyl type, these are precisely the flipclasses having only one increasing path. This marks a refinement of the classical Combinatorial Invariance of Kazhdan--Lusztig polynomials.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22528v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Asymptotic enumeration of histories and limit laws in two random graph evolution models</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22535.html</link><guid isPermaLink="false">arxiv:2611.22535v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.PR</category><description>&lt;p&gt;Nadja Azzouz, Olivier Bodini, Francis Durand, Bernhard Gittenberger&lt;/p&gt;&lt;p&gt;We study growth models for random graphs where the growth is established by vertex or edge creations and where there is no dependence between vertices and edges. Creations are logged by time stamps such that the history of the resulting graph can be reconstructed. We investigate two prototypical models, an undirected and a directed one, called undirected independent growth model (UIG-model) and directed independent growth model (DIG-model). The generating functions for the number of histories have radius of convergence equal to zero. In the UIG-model, we express the asymptotic number of histories as a sum that is amenable to the discrete Laplace method. We derive the asymptotic number of histories, study the number of vertices of a random history, and prove a central limit theorem. In the DIG-model we use a rescaled Borel transform to get an entire function. Then we show that this function is Hayman admissible, which enables us to derive the asymptotic number of histories in this model. The counting sequence is closely related to the framework of generalized Legendre-Stirling numbers. To determine the number of vertices in a random history, we prove that the bivariate generating function is e-admissible and infer that again a normal limit law holds. Finally, we discuss a correspondence to set partitions with even block sizes and present an algorithm based on Boltzmann samplers that generates such graphs uniformly at random.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22535v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] On (Pathwidth, Clique)-boundedness</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22552.html</link><guid isPermaLink="false">arxiv:2611.22552v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Amir Nikabadi&lt;/p&gt;&lt;p&gt;We prove that every $(\pw,ω)$-bounded class of graphs has bounded tree-independence number, answering a question of Bešter Štorgel, Dallard, Lozin, Milanič, and Zamaraev. We deduce this from a bound on the tree-independence number of graphs with neither $\B_ρ$ nor $K_{σ,σ}$ as an induced minor, where $\B_ρ$ is the complete binary tree of height $ρ$ and the bound depends only on $ρ$ and $σ$. We then obtain an asymptotically sharp bound on the path-independence number of $n$-vertex graphs in any $(\pw,ω)$-bounded class. The lower-bound examples also give counterexamples to a conjecture of Hickingbotham and Joret. We further prove that, for every forest $F$ and every $\ell\in\N$, there is a constant $k=k(F,\ell)\in\N$ such that every graph $G$ with no induced theta or $\ell$-long prism and no induced subgraph isomorphic to $F$ satisfies tree-independence number at most $k$. This proves a strengthened form of a conjecture of Chudnovsky, Hajebi, and Trotignon. Finally, for every integer $s\ge2$, we characterize the forests $F$ for which excluding $F$ as an induced minor and $K_{s,s}$ as an induced subgraph bounds tree-independence number. This extends the characterization of Bonnet, Duhamel, and Hickingbotham, who considered bounded pathwidth with $K_{s,s}$ excluded as a subgraph.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22552v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The Cooperstein conjecture and additive alternating $d$-codes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22622.html</link><guid isPermaLink="false">arxiv:2611.22622v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.RA</category><description>&lt;p&gt;Paolo Santonastaso&lt;/p&gt;&lt;p&gt;Let $\bigwedge^2 V$ be the second exterior power of a vector space $V$ over a finite field. The Cooperstein conjecture asserts a dimension bound for flats external to varieties consisting of points of bounded rank in $\mathrm{PG}(\bigwedge^2 V)$. This geometric problem can be translated into a question about linear spaces of alternating matrices whose nonzero elements have rank at least a prescribed value. For matrices of odd order, the sharp cardinality bound was already established by Delsarte and Goethals (1975). In this paper, we prove the Cooperstein conjecture for matrices of even order and, more generally, we prove its additive analogue by determining, for all admissible parameters, the maximum size of an additive subgroup of alternating matrices in which every nonzero matrix has at least the prescribed rank. Our proof uses Pfaffian equations to characterize alternating matrices of rank below the prescribed minimum. We study the minimal graded free resolutions of the corresponding Pfaffian rings. The Cohen--Macaulay property and the $a$-invariant of each Pfaffian ring determine the largest shift in its resolution. We use trace functions on evaluation quotients to construct polynomial indicators for the matrices of small rank in an additive subgroup. The largest shift controls their degrees, yielding the upper bound by a counting argument. Finally, we give explicit trace constructions attaining the bound.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22622v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Golomb rulers with real marks: the real and integer optima agree up to ten marks</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22656.html</link><guid isPermaLink="false">arxiv:2611.22656v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Esther Notik&lt;/p&gt;&lt;p&gt;A Golomb ruler is a set of integer marks whose pairwise differences are distinct. We let the marks be real numbers and ask that every difference be at least 1 and that any two differences be at least 1 apart. Every integer Golomb ruler satisfies these conditions, so the least length $G_R(n)$ of such a real ruler with $n$ marks is at most the optimal Golomb length $G_Z(n)$. Fixing the order of all differences splits the real problem into finitely many polyhedral chambers. A branch-and-bound over these chambers, with an exact rational certificate at every leaf, proves $G_R(n) = G_Z(n)$ for $n \le 10$. Each proof takes under a minute and is verified by an independent checker that uses only exact arithmetic. An exhaustive exact enumeration of all chamber vertices confirms the result for $n \le 7$, and shows that there the shortest real rulers are exactly the optimal integer rulers and their mirror images. For every $n$ we show $n(\sqrt{n}-1)^2 \le G_R(n) \le G_Z(n)$, so that $G_R(n) \sim G_Z(n) \sim n^2$. Non-integral chamber vertices first appear at $n = 7$: there are 84, all half-integral. Already there, 80 of them are shortest points of their chambers, 40 of them the only one, although the global optimum is integral; a twelve-mark example of the same kind comes from Singer&amp;#x27;s construction. On the other hand, every Singer ruler with at most 104 marks, cut at the largest gap, is the only shortest point of its own chamber; we conjecture this for all prime powers.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22656v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The minimum degree of minimally k-extendable graphs for some k</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22690.html</link><guid isPermaLink="false">arxiv:2611.22690v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zhiyong Gan, Yi Huang&lt;/p&gt;&lt;p&gt;A graph on at least 2k+2 vertices is k-extendable if every matching of size k extends to a perfect matching, and it is minimally k-extendable if it is k-extendable but deleting any edge is not. Plummer proved that every k-extendable graph is (k+1)-connected. So its minimum degree is at least k+1. Lou and Yu conjectured that a minimally k-extendable graph on at most 4k vertices has minimum degree in {k+1,2k,2k+1}; the case k=1 and the claw-free case of k=2 have been settled previously. We determine the minimum degree of minimally k-extendable graphs for k=2 and k=3, thereby settling the Lou--Yu conjecture for these two values. For k=2 the minimum degree is in {3,4,5}. For k=3 it is in {4,7} at orders 8 and 10, and in {4,6,7} at order 12. The proofs pass to the complement graph and combine Tutte&amp;#x27;s perfect matching theorem with a classification of four-vertex and six-vertex obstructions. All predicted values are realized by explicit constructions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22690v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Positivity of Signed Odd-Multiplicity Partitions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22720.html</link><guid isPermaLink="false">arxiv:2611.22720v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Mircea Merca&lt;/p&gt;&lt;p&gt;We establish coefficientwise nonnegativity for the signed partition $q$-series \[ A_k(q)= \sum_{1\le j_1&amp;lt;\cdots&amp;lt;j_k} \prod_{i=1}^k\frac{q^{j_i}}{1+q^{2j_i}} =\sum_{n\ge0}a_k(n)q^n, \qquad k\ge0, \] with $A_0(q)=1$. The coefficient $a_k(n)$ counts, with signs, partitions of $n$ having exactly $k$ distinct part sizes, each occurring with odd multiplicity. A partition with multiplicities $2t_1+1,\ldots,2t_k+1$ is assigned the sign $(-1)^{t_1+\cdots+t_k}$. We prove that $a_k(n)\ge0$ for all $k,n\ge0$, thereby resolving a conjecture on signed odd-multiplicity partitions. Our proof combines a positive theta--MacMahon factorization for the generating functions restricted to odd part sizes with a dyadic product decomposition that extends positivity to arbitrary part sizes. Moreover, we establish strict positivity $a_k(n)&amp;gt;0$ for every $k\ge2$ and $n\ge\binom{k+1}{2}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22720v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Sharp lower bounds for weighted bisections of graphs with bounded maximum degree</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22760.html</link><guid isPermaLink="false">arxiv:2611.22760v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou&lt;/p&gt;&lt;p&gt;A bisection of a graph is a partition of its vertex set into two parts the sizes of which differ by at most one. We prove that every finite simple graph of maximum degree at most an odd positive integer $k$, with arbitrary nonnegative real edge weights, has a bisection of weight at least $(k+1)/(2k)$ times its total edge weight. The corresponding bound $(k+2)/(2(k+1))$ for even $k$ follows immediately. Both coefficients are best possible. Somewhat surprisingly, these are exactly the sharp coefficients known for maximum weighted cuts, despite the additional balance requirement.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22760v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Heap-type permutation generation with a prescribed final arrangement</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22780.html</link><guid isPermaLink="false">arxiv:2611.22780v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>cs.DM</category><category>cs.DS</category><description>&lt;p&gt;Luís M. S. Russo&lt;/p&gt;&lt;p&gt;Heap&amp;#x27;s algorithm generates all permutations of an array of n items, obtaining each one from its predecessor by a single swap. We determine the net permutation applied to the array by every complete recursive call: a transposition when the number of items is odd and at least three, and a cycle through all items when it is even. We show that the output of each call is a concatenation of right cosets of the symmetric group on one item fewer, and we prove a general formula: the order in which the items are parked at the last position may be chosen freely, every such order corresponds to exactly one valid schedule, and it determines the net permutation of the call. Two variants follow. In the cyclic variant a complete sweep over an even number of items rotates the array by one position. In the extremal variant, for even n, a sweep started from the identity ends in the lexicographically largest arrangement that any single-swap enumeration can leave; by a parity argument this is the reversal exactly when n is congruent to 2 modulo 4. The construction of the extremal variant is proved correct when n is divisible by 4 and verified by computer for all even n up to 10000.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22780v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An extremal question of Erdős et al. on cycles</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22824.html</link><guid isPermaLink="false">arxiv:2611.22824v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zhiyong Gan, Zhiliang Tan, Yi Huang&lt;/p&gt;&lt;p&gt;This paper addresses an extremal problem on long cycles proposed by Erdős, Faudree, Schelp and Simonovits in 1989. Let \(2\le k\le d&amp;lt;n\) be positive integers. For an n-vertex simple graph G, let \(θ_+^G\) count vertices of degree at least d, and \(C_{\ge k+1}\) denote a cycle of length at least \(k+1\). The original conjecture claimed that G contains a \(C_{\ge k+1}\) whenever \(θ_+^G \ge \lfloor k/2 \rfloor \lfloor (n-1)/d \rfloor+2\). Li, Ma and Ning disproved it with infinite counterexamples and gave linear lower bounds. Gan, Yi and Jiang later obtained piecewise sufficient conditions depending on the parity of k, whose bounds are sharp only when \(k=d\) and loose for \(k\ne d\). We derive a new sufficient condition for \(C_{\ge k+1}\). For odd \(k=d\), we use Woodall&amp;#x27;s sharp bound \(θ_+^G \ge k(n-2)/(2(k-1))+1\). For all other admissible parameters, our threshold is unified and independent of the parity of k: \(θ_+^G \ge \lfloor k/2 \rfloor (n-1)/d + (n-d-1)\lfloor k/2 \rfloor/(d(d-\lfloor k/2 \rfloor))+1\). We construct \(C_{\ge k+1}\)-free graphs to prove tightness for all admissible k. This resolves this long-standing Erdős-type extremal problem concerning high-degree vertices and long cycles.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22824v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Independent sets in the 2-token graph of a cycle and kings on the torus</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22830.html</link><guid isPermaLink="false">arxiv:2611.22830v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Luis Manuel Rivera&lt;/p&gt;&lt;p&gt;The 2-token graph of the cycle $C_n$ and the king graph on the $n\times n$ torus are known to have the same independence number. Answering a question of Reyes, Dalfó and Fiol, for every $n\ge4$ we give an explicit bijection between a maximum independent set of the king graph and a maximum independent set of the $2$-token graph: each pair of tokens is represented by a king placed in the row of one of its two tokens and in the column given by their sum. We also show that the $2$-token graph of $C_n$ has exactly one maximum independent set, or exactly $n$ when $n\equiv3\pmod 4$, all of them rotations of each other. The argument is self-contained and yields a new proof of the value of the independence number.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22830v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Equivalence of Small and Large Quasi-kernels</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22881.html</link><guid isPermaLink="false">arxiv:2611.22881v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Sam Spiro&lt;/p&gt;&lt;p&gt;A quasi-kernel of a digraph $D$ is an independent set which can reach every vertex of $D$ by a directed path of length at most 2. The Small Quasi-kernel Conjecture states that every $n$-vertex source-free digraph $D$ contains a quasi-kernel $Q$ with $|Q|\le n/2$, and the Large Quasi-kernel Conjecture states that every $n$-vertex digraph $D$ contains a quasi-kernel $Q$ with $|N^+[Q]|\ge n/2$. Our main result shows for any $\frac{1}{2}&amp;lt;β&amp;lt;1$ an equivalence between the following two statements: \[\textrm{Every }n\textrm{-vertex source-free digraph contains a quasi-kernel with } |Q|\le n-Ω(n^β).\] \[\textrm{Every }n\textrm{-vertex digraph contains a quasi-kernel with } |N^+[Q]|\ge Ω(n^{2-\frac{1}β}).\] That is, any sublinear bound for one problem is equivalent to a corresponding sublinear bound for the other. This combined with previous work establishing an equivalence for linear bounds shows that the two problems are largely equivalent to each other. We additionally give a slight refinement to the recent breakthrough of Rutschmann for these problems which, together with the result above, gives the best known bounds of $n-Ω(n^{3/4})$ and $Ω(n^{2/3})$ for the Small and Large Quasi-kernel Conjectures, respectively. Our proofs are due to ChatGPT&amp;#x27;s Astra 6; the writing is all our own.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22881v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Minimum outdegree forcing directed cycles</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22909.html</link><guid isPermaLink="false">arxiv:2611.22909v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Andrzej Grzesik, Justyna Jaworska, Piotr Kuc&lt;/p&gt;&lt;p&gt;The Caccetta-Häggkvist conjecture, one of the best known open problems on oriented graphs, asserts that every oriented graph on $n$ vertices with minimum outdegree at least $n/\ell$ contains a directed cycle of length at most $\ell$. Motivated by it, Kelly, Kühn and Osthus asked for the minimum degree condition that forces a directed cycle of length exactly $\ell$. The semidegree version of this problem was recently solved, but the methods used there rely on bounding the directed diameter, which requires control over the indegrees. In the setting of the Caccetta-Häggkvist conjecture, where only the outdegrees are bounded, the answer was known only for $\ell$ not divisible by $3$. We determine the optimal minimum outdegree forcing a directed cycle of length $\ell$ for every sufficiently large $\ell$ and $n$. This establishes the outdegree version of the Kelly-Kühn-Osthus conjecture for all large $\ell$, up to a small correction of the additive term, which in general cannot be avoided.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22909v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Sums and Products in Dynamically Central Syndetic Sets</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22957.html</link><guid isPermaLink="false">arxiv:2611.22957v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.DS</category><description>&lt;p&gt;Arpita Ghosh&lt;/p&gt;&lt;p&gt;Glasscock and Le introduced the notion \textit{dynamically central syndetic sets} in a minimal topological dynamical system under the minimal action of the semigroup $(\mathbb{N}, +).$ In this short note, we introduce these large sets in the semigroup $(\mathbb{N}, \cdot)$ and establish that dynamically central syndetic sets contain the Hindman configuration $\{x,y,x+y,xy\}$. Furthermore, we show that there are dynamically central piecewise syndetic sets that do not contain such configurations.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22957v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Complete characterization of graphs with common maximal abelian cover</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22993.html</link><guid isPermaLink="false">arxiv:2611.22993v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.AT</category><description>&lt;p&gt;Frederico Cançado, Gabriel Coutinho, Thomás Jung Spier&lt;/p&gt;&lt;p&gt;The maximal abelian cover of a connected graph is the quotient of its universal cover by the commutator subgroup of its fundamental group. We provide a complete classification of finite connected graphs with isomorphic maximal abelian covers. For trees or for connected graphs with at least two cycles, the cover determines the base up to isomorphism; in cycle rank one, it determines the primitive cyclic pattern of rooted trees attached to the unique cycle. We also characterize when every automorphism descends to the base and give an orbit-size criterion for splitting the canonical lift extension, answering two questions raised by Baez in 2026.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22993v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An infinite family of bipartite hypotraceable graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23018.html</link><guid isPermaLink="false">arxiv:2611.23018v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jorik Jooken&lt;/p&gt;&lt;p&gt;A graph is hypotraceable if it has no Hamiltonian path but every vertex-deleted subgraph does. In 1978, Grötschel asked whether a bipartite hypotraceable graph exists. We resolve this long-standing question in a strong sense by proving that such graphs exist for every sufficiently large even order. Moreover, we show that bipartite hypotraceable graphs can have $\left(1/4+o(1)\right)n^2$ edges, asymptotically attaining the maximum possible number of edges of a bipartite graph, and that there are at least $2^{(1/4+o(1))n^2}$ nonisomorphic examples of order $n$, as $n$ tends to infinity through even integers. Finally, we prove that every bipartite graph occurs as an induced subgraph of a bipartite hypotraceable graph.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23018v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Divisible design graphs from a construction of antipodal distance-regular graphs based on Ree groups and Suzuki groups</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23077.html</link><guid isPermaLink="false">arxiv:2611.23077v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.GR</category><description>&lt;p&gt;Bart De Bruyn, Sergey Goryainov, Yilin Xie&lt;/p&gt;&lt;p&gt;In this paper, we present a new construction of divisible design graphs with new parameters, obtained by plugging a difference set into a known construction of antipodal distance-regular graphs of diameter 3 that is based on Ree groups and Suzuki groups.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23077v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] New bounds on simplex-avoiding sets in two dimensions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23097.html</link><guid isPermaLink="false">arxiv:2611.23097v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Domonkos Czifra, Ákos Dúcz, Péter Madarasi, Dániel Varga, Pál Zsámboki&lt;/p&gt;&lt;p&gt;We study extremal densities of measurable subsets of metric spaces avoiding prescribed finite geometric configurations. We prove two new upper bounds for three-point avoidance problems: a measurable subset of $S^2$ containing no orthonormal basis has normalized spherical measure at most $7/11$, and a measurable subset of $\mathbb{R}^2$ containing no unit equilateral triangle has upper Banach density at most $9/16$. The first bound appears to be the first improvement over the trivial averaging bound for this problem, while the second improves the previously best known upper bound. The proofs are applications of the geometric fractional chromatic number method introduced by Ambrus et al. For this purpose, we formulate the method in a framework that applies both to compact homogeneous spaces and to Euclidean spaces with upper Banach density.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23097v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Determining Compatible Groups in $Γ$-Zonal Labelings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23164.html</link><guid isPermaLink="false">arxiv:2611.23164v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Andrew Bowling, Richard M. Low&lt;/p&gt;&lt;p&gt;Let $G$ be a plane graph with vertex, edge, and region sets $V(G),$ $E(G),$ and $F(G)$ respectively, and let $Γ$ be a nontrivial abelian group with identity element $0$. A $Γ$-zonal labeling of a plane graph $G$ is a labeling $\ell: V(G)\rightarrow Γ\setminus\{0\}$ such that for every region $f\in F(G)$, the sum of labels on the boundary of $f$ is $0$ in $Γ$. We say a $Γ$-zonal labeling is generative if the labels used generate $Γ$, and strong if the additive order of each label matches the degree of the corresponding vertex. Given a graph $G$ or a family of graphs $\mathcal{G}$, we explore restrictions on the groups $Γ$ for which there can exist a $Γ$-zonal labeling. Here we specifically determine restrictions on compatible groups when $\mathcal{G}$ is the family of $2$-connected multigraphs or $2$-connected simple graphs. We also demonstrate how the Smith normal form decomposition of the face incidence matrix of a plane graph $G$ can help characterize the groups $Γ$ for which there exists a generative $Γ$-zonal labeling.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23164v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] On the V-toothpick sequence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23172.html</link><guid isPermaLink="false">arxiv:2611.23172v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Benoît Cloitre&lt;/p&gt;&lt;p&gt;We give a generating function for the V-toothpick sequence and an algorithm that computes any term in time polynomial in the number of binary digits of its index. We determine its quadratic growth and periodic fluctuations, and give convergent series for the constants in its asymptotic bounds.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23172v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Sidorenko Inequalities in Oriented Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23222.html</link><guid isPermaLink="false">arxiv:2611.23222v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Veronica Bitonti, Emma Hogan, Jonathan A. Noel, Dmitry Tsarev&lt;/p&gt;&lt;p&gt;We introduce relative Sidorenko and relative anti-Sidorenko inequalities for oriented graphs, strengthening the corresponding well-studied notions for tournaments by allowing arbitrary host graphs. An orientation $\vec H$ of a graph $H$ is relatively Sidorenko if $\hom(\vec H,\vec G) \ge 2^{-e(H)}\hom(H,G)$ for every oriented graph $\vec G$ with underlying graph $G$, and relatively anti-Sidorenko if the reverse inequality holds. We provide a complete characterisation of the class of connected relatively Sidorenko graphs in terms of weakly norming graphs, and exhibit several families of relatively Sidorenko and relatively anti-Sidorenko oriented graphs. Despite the substantially stronger definitions, many known tournament Sidorenko and anti-Sidorenko examples satisfy the relative inequalities, suggesting a broader theory of these phenomena in arbitrary host graphs and motivating several new structural and classification problems.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23222v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] A general theorem on the analytic spread and associated primes of divisorial filtrations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21873.html</link><guid isPermaLink="false">arxiv:2611.21873v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AC</category><description>&lt;p&gt;Steven Dale Cutkosky&lt;/p&gt;&lt;p&gt;We prove that a classical theorem of McAdam about the analytic spread of an ideal in a Noetherian local ring $R$ is true for rational divisorial filtrations on an arbitrary Noetherian local ring. We deduce McAdam&amp;#x27;s original theorem from our result. This generalizes earlier work by the author, showing that this theorem is true for rational divisorial filtrations, with the restriction that $R$ is an equidimensional local ring which is essentially of finite type over an excellent local ring of dimension $\le 3$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21873v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Gorenstein linkage of ideals and doubly layered filtrations of MCM modules</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21901.html</link><guid isPermaLink="false">arxiv:2611.21901v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AC</category><description>&lt;p&gt;Siva Somasundaram&lt;/p&gt;&lt;p&gt;The glicci conjecture asks whether every Cohen-Macaulay ideal in a regular ring belongs to the Gorenstein linkage class of a complete intersection. We show that the corresponding statement is false for nonregular rings. We prove that the conjecture holds for zero-dimensional ideals and for ideals of dimensions one and two in polynomial rings. Geometrically, this implies that every zero-dimensional subscheme of $\mathbb{P}^n_k$, as well as every curve in $\mathbb{P}^n_k$, is glicci. We also prove that every Cohen-Macaulay monomial ideal is glicci. Our approach involves reducing the problem to height-two ideals and studying their N-type resolutions and the filtrations of the associated modules. We also show that every orientable maximal Cohen-Macaulay module over a two-dimensional Gorenstein ring is stably isomorphic to a doubly layered module. Finally, we prove that every ideal belongs to the Gorenstein linkage class of a Golod ideal.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21901v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Morse resolutions and applications to lcm powers</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22173.html</link><guid isPermaLink="false">arxiv:2611.22173v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AC</category><description>&lt;p&gt;Margherita Barile, Trung Chau&lt;/p&gt;&lt;p&gt;We consider the $r$-th lcm power $I^{\{r\}}$ of a monomial ideal $I$, defined to be generated by the least common multiples of all $r$-element subsets of the set of minimal monomial generators of $I$. Some homological invariants of these ideals are studied. Specifically, we use discrete Morse theory to give sharp upper bounds for the projective dimension and total Betti numbers of these ideals. Moreover, we completely determine the extent to which lcm powers define the homological shift ideals of edge ideals. Finally, we study when the minimal resolution of some ordinary powers and lcm powers are supported on the same CW-complex.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22173v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Distance algebras of finite distributive lattices are Gorenstein</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22513.html</link><guid isPermaLink="false">arxiv:2611.22513v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AC</category><category>math.AT</category><description>&lt;p&gt;Aaron Chan, Bohan Xing&lt;/p&gt;&lt;p&gt;Distance algebras were introduced by Asao and Ivanov to realize magnitude homology and cohomology of quasi-metric spaces as Tor- and Ext-groups respectively. Let $Σ_L$ be the distance algebra of the Hasse graph of a finite distributive lattice $L$, where the metric is given by the lengths of shortest paths in the graph. We show that $Σ_L$ is Gorenstein over any Gorenstein commutative noetherian ring $R$, and give bound of its self-injective dimension. The proof constructs, for each indecomposable (relative) injective module, a projective resolution that is in general non-minimal. When $R=\Bbbk$ is a field, we use algebraic Morse theory to reduce it to a minimal resolution, so that the Betti numbers can be obtained as the dimensions of homologies of certain order complexes. As a consequence, we show that the self-injective dimension of $Σ_L$ is the maximal Castelnuovo--Mumford regularity of certain Stanley--Reisner rings. We also show that the first two terms of these minimal resolutions are multiplicity-free, whereas arbitrarily large multiplicities occur in every higher degree. In the appendix, we include a more abstract formulation of the non-minimal projective resolution, namely, a simplicial replacement of a diagram of projective modules.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22513v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Nonlinear syzygies in ordinary powers of chordal cover ideals</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22634.html</link><guid isPermaLink="false">arxiv:2611.22634v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AC</category><description>&lt;p&gt;Nguyen Thu Hang, Thanh Vu&lt;/p&gt;&lt;p&gt;We construct connected chordal graphs whose cover ideals have ordinary powers that are not componentwise linear over any field, disproving the Herzog--Hibi--Ohsugi conjecture.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22634v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] The Sharp Holder Constant in Mori&#x27;s Theorem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21805.html</link><guid isPermaLink="false">arxiv:2611.21805v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Qiang Gao&lt;/p&gt;&lt;p&gt;Let $K\ge 1$ and let $f$ be a $K$-quasiconformal homeomorphism of the unit disk $\mathbb{D}$ onto itself with $f(0)=0$. We prove that $\lvert f(a)-f(b)\rvert\le 16^{1-\frac{1}{K}}\lvert a-b\rvert^{\frac{1}{K}}$ for all $a,b\in\mathbb{D}$. The constant is sharp, confirming the conjectured value of the Mori constant. The proof reduces the estimate along a Beltrami path to an infinitesimal inequality, which follows from quasiconformal distortion bounds and a three-pole integral estimate.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21805v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] $\mathrm{BMOA}$ and Carleson-homogeneous Denjoy domains</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22135.html</link><guid isPermaLink="false">arxiv:2611.22135v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Katsuhiko Matsuzaki, Fei Tao&lt;/p&gt;&lt;p&gt;Let $E$ be a proper closed subset of the extended real line that contains $[-\infty,-1]\cup[1,+\infty]$, and let $F$ be a universal covering of the Denjoy domain $Ω=\overline{\mathbb C}\setminus E$. We prove the conjecture of Huo and Zinsmeister that $E$ is Carleson-homogeneous if $\log F&amp;#x27;\in\mathrm{BMOA}(\mathbb D)$. The proof is based on an estimate for the length of $F^{-1}(\mathbb R)$ in terms of the Bloch seminorm of $\log F&amp;#x27;$ and a weighted $L^2$ integral of $F&amp;#x27;&amp;#x27;/F&amp;#x27;$. From this estimate we deduce that $Ω$ has the Hayman-Wu property, and Carleson-homogeneity then follows from a theorem of Fernández. We also characterize these domains by Carleson measure conditions for the arclength on $F^{-1}(\mathbb R)$ and for the Schwarzian derivative of $F$, and by the $H^\infty$ interpolation property of the inverse images of suitable sequences in ${\mathbb R}\setminus E$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22135v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] Lectures on Bergman Theory (The first part)</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22347.html</link><guid isPermaLink="false">arxiv:2611.22347v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Bo-Yong Chen&lt;/p&gt;&lt;p&gt;The first half of these lecture notes provides a systematic introduction to the Bergman theory on domains, as well as parameter dependence of weighted Bergman Kernels. Starting from the Bergman space, it establishes the reproducing property, extremal characterizations and transformation laws of the Bergman kernel, and discusses removable singularities, stability, and boundary growth, which also includes a nice Bergman kernel proof of Riemann&amp;#x27;s mapping theorem. It then studies the completeness and curvature properties of the Bergman metric, including Kobayashi&amp;#x27; criterion and Lu Qi-Keng&amp;#x27;s ball theorem. Finally, it explores the parameter continuity, regularity, plurisubharmonicity, and convexity of weighted Bergman Kernels, which found significant applications in the theory of plurisubharmonic singularities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22347v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] A Burns-Krantz theorem on convex domains</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22516.html</link><guid isPermaLink="false">arxiv:2611.22516v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Cheng Lou, Jianyong Qiao, Hongyu Wang, Yumin Zhong&lt;/p&gt;&lt;p&gt;We prove two boundary rigidity theorems for holomorphic self-maps of bounded convex domains. Let $Ω\subset\C^n$, $n\geq1$, and suppose that $\partialΩ$ is $C^{1,α}$ near $p\in\partialΩ$ for some $0&amp;lt;α\leq1$. If a holomorphic self-map $f$ satisfies $f(z)=z+o(|z-p|^3)$ as $z\to p$ in one fixed non-tangential approach region at $p$, then $f=\id_Ω$. We also prove a rigidity theorem for bounded convex domains $Ω$ without assuming boundary smoothness. If a holomorphic self-map $f$ of $Ω$ satisfies $f(z)-z=O(|z-p|^m)$ as $z\to p\in\partialΩ$ for some $m&amp;gt;1+2π/θ_p$, where $θ_p$ is the supremum of sector angles in the open tangent cone at $p$, taken over complex lines through its vertex, then $f=\id_Ω$, which proves a conjecture of Zimmer.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22516v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] A Quasiconformal Squeezing function and Fridman invariant and applications</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22677.html</link><guid isPermaLink="false">arxiv:2611.22677v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Diganta Borah, Steven G. Krantz, Prachi Mahajan, Kaushal Verma&lt;/p&gt;&lt;p&gt;The squeezing function and Fridman invariant are two examples of biholomorphic invariants that have proved to be useful in exploring questions in complex geometry. Motivated by their construction, we define conformal analogues of these invariants by using suitable families of $K$-quasiconformal mappings, and study several basic properties such as continuity, domain dependence and boundary behaviour near spherically extreme points. It is also shown that these conformal invariants are explicitly related. As an application, we propose and prove variants of the Ferrand--Obata theorem in conformal geometry that apply to domains in $\mbb R^n$. This highlights the close analogy that exists between the Ferrand--Obata and Wong--Rosay theorems.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22677v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] The Koebe radius for univalent cubics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22764.html</link><guid isPermaLink="false">arxiv:2611.22764v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Alexey Solyanik&lt;/p&gt;&lt;p&gt;Let \(p(z)=z+a_2z^2+a_3z^3\) be a polynomial univalent in the unit disk \(Δ\). We determine the largest disk centered at the origin that is contained in the image \(p(Δ)\) of every such polynomial. Its squared radius is the unique real root of \[ 27q^3-54q^2+63q-8=0. \] We also find the extremal polynomial \(p_*\).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22764v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] Higher-Derivative Conjectures of Sendov</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23039.html</link><guid isPermaLink="false">arxiv:2611.23039v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><description>&lt;p&gt;Mukhiddin Ismoilov, Zhiqiang Li, Karim Rakhimov, Chengliang Tan&lt;/p&gt;&lt;p&gt;We prove Conjectures~3 and~8 of Sendov&amp;#x27;s 2002 survey and deduce Conjecture~9. More precisely, let $p$ be a polynomial of degree $n$ whose zeros lie in the closed unit disk. For every integer $s$ with $1\le s&amp;lt;n$, we prove that each zero of $p$ lies within distance $2s/(s+1)$ of a zero of $p^{(s)}$. For quartics, we obtain the sharp bound $2/\sqrt3$ for the second derivative and determine all polynomials attaining it.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23039v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CV] Regularity of solutions to complex Monge-Ampère equations in big classes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23094.html</link><guid isPermaLink="false">arxiv:2611.23094v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.CV</category><category>math.AP</category><category>math.DG</category><description>&lt;p&gt;Riley Guyett, Ryan Mc Gowan&lt;/p&gt;&lt;p&gt;We study the non-pluripolar complex Monge-Ampère equation in an arbitrary big class on a compact Kähler manifold. Under a weighted Laplacian lower bound on the log density, we obtain local $C^{2,α}$ regularity on the part of the ample locus where the data satisfy the stated hypotheses. A second criterion based on a quasi-plurisubharmonic decomposition gives similar regularity. In particular, a smooth positive density gives a smooth solution on the ample locus. None of these regularity results require nefness of the background class, resolving positively a question of Dinew, Guedj, and Zeriahi.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23094v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Sharp modified logarithmic Sobolev inequality for matrix-valued functions on spheres</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21704.html</link><guid isPermaLink="false">arxiv:2611.21704v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.OA</category><description>&lt;p&gt;Li Gao, Long Zhao&lt;/p&gt;&lt;p&gt;We prove that for every smooth positive definite matrix-valued function $g$ on the unit sphere $S^d$, \[ \int_{S^d}\tr(g(\log g-\log\E g))\dd \le\dfrac1{2d}\int_{S^d}\tr((Δg)\log g)\dd. \] Here $μ$ is normalized area measure, $\E g$ is the spherical mean, and $Δ$ is the positive spherical Laplacian. This complete modified logarithmic Sobolev inequality extends Beckner&amp;#x27;s sharp logarithmic Sobolev inequality, in its modified form, to matrix-valued functions independent of the matrix size. We show that both entropy and Fisher information decay exponentially under the heat flow with optimal exponent $2d$, whose proof combines the Bochner identity with a $4$th-tensor estimate in the matrix-valued setting.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21704v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Remarks on thin sets in potential theory for sub-Laplacians</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21971.html</link><guid isPermaLink="false">arxiv:2611.21971v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Shiguang Ma, Jie Qing&lt;/p&gt;&lt;p&gt;In contrast to Euclidean cases, we observe that, there are sets in Heisenberg groups that are thin at the origin and block all geodesics from the origin. However, in polarizable Carnot groups, using horizontal radial curves constructed for polar coordinates by Balogh and Tyson, we show that sets, that are thin at the origin, cannot block all horizontal curves. Consequently, we are able to use the asymptotic behavior with respect to the fine topology to estimate the Hausdorff dimension of singularities of potentials for sub-Laplacians and obtain geometric applications.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21971v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Hyperkähler Periods in Families of Parabolic Higgs Bundle Moduli Spaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21990.html</link><guid isPermaLink="false">arxiv:2611.21990v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math-ph</category><category>math.AG</category><description>&lt;p&gt;Panagiotis Dimakis, Laura Fredrickson, Arya Yae&lt;/p&gt;&lt;p&gt;We consider the period map on families of parabolic Higgs bundle moduli spaces with varying parabolic weights $α$ and Higgs field eigenvalues $σ$. We assemble the moduli spaces into a smooth family $π:\mathscr M\toΛ$ where $Λ$ encodes $(α,σ)$, and define parallel transport for homology along paths in an open dense subset $Λ_0\subsetΛ$. By generalizing a classical theorem of Duistermaat and Heckman, we prove that the period map is affine linear in $(α,σ)$, with slope governed by the curvature class of a principal torus bundle over $\mathscr M$. For the four-dimensional moduli spaces of types $E_6,E_7,E_8$, we compute these classes to get explicit formulas for the period maps.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21990v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Gradient estimates and monotonicity formulae for the $p$-filtration equation on Riemannian manifolds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22071.html</link><guid isPermaLink="false">arxiv:2611.22071v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.AP</category><description>&lt;p&gt;Yu-Zhao Wang, Jian-Hua Hao&lt;/p&gt;&lt;p&gt;We derive Li--Yau type estimates on closed Riemannian manifolds and local Hamilton-type gradient estimates on complete manifolds for the $p$-filtration equation $u_t=Δ_pF(u)$. Under nonnegative Ricci curvature and a structural condition on $F$, we establish a $\mathcal W$-entropy formula, entropy-power concavity and local entropy rigidity. We also prove a parabolic frequency monotonicity formula without curvature assumptions. The results include homogeneous doubly nonlinear diffusion and extend to nonhomogeneous power sums and the arctangent law.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22071v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] On the Morse index of some Riemannian homogeneous fibrations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22090.html</link><guid isPermaLink="false">arxiv:2611.22090v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Luiz Lara, Éric Loubeau&lt;/p&gt;&lt;p&gt;In this paper, we use the technique developed by the first named author in arXiv:2610.07815 to compute the Morse-index of some Riemannian homogeneous fibrations. For the quaternionic (resp. octonionic) Hopf fibration, we compute the index and nullity, where the metric on the $\mathbb{S}^7$ (resp. $\mathbb{S}^{15}$) is the quaternionic (resp. octonionic) Hopf--Berger metric. In particular, for the round metric on the domain, the Morse-index is $45$ (resp. $153$). We also give a spectral formula for the Aloff--Wallach projections. In particular, we obtain that the Konishi $\mathbb{R} P^3$-fibration $N_{1,1}\to\mathbb{C} P^2$ is stable throughout the two-parameter metric family, while the unit tangent sphere bundle $T^1(\mathbb{C} P^2)\to \mathbb{C} P^2$ is stable under some conditions on the metric. We also compute the index and nullity of the Clifford hypersurface in the fiber-squashing range of the quaternionic Berger family. Finally, for the identity map on the quaternionic Hopf--Berger spheres, we determine its Morse--index by an explicit sequence of transition parameters.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22090v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Uniqueness of tangent flows in mean curvature flow (I): smooth minimal cone</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22105.html</link><guid isPermaLink="false">arxiv:2611.22105v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Hanbing Fang, Yongheng Han&lt;/p&gt;&lt;p&gt;We prove uniqueness of multiplicity-one minimal-cone tangent flows in mean curvature flow when the cone has a smooth embedded two-sided link and satisfies strict Hardy stability, radial Gaussian nonresonance, and weighted stationary rigidity. We also establish a discrete Lojasiewicz inequality, polynomial convergence rates, and rigidity among smooth self-shrinkers. In particular, these conclusions hold for all Simons cones $\mathcal C_{p,q}$ with $p,q \geq 1, p+q\geq 6$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22105v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Extremal metrics for the $G$-invariant Steklov eigenvalues</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22168.html</link><guid isPermaLink="false">arxiv:2611.22168v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.AP</category><description>&lt;p&gt;Eduardo Longa&lt;/p&gt;&lt;p&gt;We study the $G$-invariant Steklov spectrum of compact connected Riemannian manifolds with boundary, endowed with an effective isometric action of a compact Lie group $G$. Under a mild nontransitivity assumption on the boundary action, we establish that this spectrum consists of an infinite sequence of eigenvalues diverging to infinity. We then investigate extremal metrics for the normalised $G$-invariant Steklov eigenvalue functionals. Assuming that $\dim G \geq 1$, we prove that none of these functionals admits an extremal $G$-invariant metric. Moreover, when $\dim M \geq 3$, the normalised first $G$-invariant Steklov eigenvalue is unbounded above even within a fixed $G$-invariant conformal class. The proof relies on a local model near a boundary orbit and spectral convergence under conformal collapse. Finally, in contrast with the upper bounds obtained by Colbois, Dryden and El Soufi for invariant Laplace eigenvalues of embedded spheres of revolution, we construct, for any $n \geq 3$, a sequence of smooth Euclidean domains of revolution in $\mathbb R^n$, all diffeomorphic to the ball, along which the normalised first $G$-invariant Steklov eigenvalue blows up.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22168v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Algebraic Vector Fields on Compact Homogeneous Spaces are 2-generated</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22265.html</link><guid isPermaLink="false">arxiv:2611.22265v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.OC</category><category>math.RT</category><description>&lt;p&gt;Yiyang Jiang, Xudong Chen&lt;/p&gt;&lt;p&gt;Let $M$ be a compact, connected manifold on which a compact Lie group $K$ acts smoothly and transitively. We show that the Lie algebra of algebraic vector fields on $M$, i.e., of smooth vector fields whose translates under $K$ span finite-dimensional spaces, is generated by two vector fields. Consequently, the subgroup generated by the flows of these two vector fields is dense in the identity component of the diffeomorphism group of $M$. For spheres, explicit generators are obtained from earlier results on spherical vector fields.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22265v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Gradient estimate for $p$-heat equation on complete Riemannian manifold</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22359.html</link><guid isPermaLink="false">arxiv:2611.22359v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.AP</category><description>&lt;p&gt;Weihao Zheng&lt;/p&gt;&lt;p&gt;We derive a Hamilton-type gradient estimate for positive solutions to the $p$-heat equation via the Moser iteration method. Our result relaxes the curvature assumption from sectional curvature to Ricci curvature. In addition, we obtain a Liouville-type theorem and a Harnack-type inequality as corollaries.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22359v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Equivariant Flow Matching on Homogeneous Spaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22492.html</link><guid isPermaLink="false">arxiv:2611.22492v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Finn M. Sherry, Gijs Bellaard&lt;/p&gt;&lt;p&gt;Flow matching enables the training of networks that can flow samples from an initial to a target distribution. The network is regressed against simple vector fields that are conditioned on end points in the target distribution. In the Euclidean case, these conditional vector fields induce flows along straight lines. Various generalisations have been proposed to perform flow matching on spaces where straight lines are not well-defined, such as Riemannian manifolds and Lie groups. Riemannian flow matching applies to many domains, but typically requires expensive simulation, while flow matching on Lie groups is simulation-free but only works on Lie groups. In this work, we develop equivariant flow matching on homogeneous spaces, which generalises flow matching on Lie groups, while remaining simulation-free. We also derive all generators connecting pairs of position-orientations, generalising, and perform a similar derivation for event-velocity space, the Lorentzian analogue of position-orientation space, so that we can perform flow matching on these spaces.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22492v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Kähler metrics with varying cone angles and Ricci curvature</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22603.html</link><guid isPermaLink="false">arxiv:2611.22603v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Martin de Borbon&lt;/p&gt;&lt;p&gt;We prove that the cone angle of a Kähler metric is constant if its Ricci curvature is locally in $L^2$. In particular, a Kähler--Einstein metric cannot have a varying cone angle. The proof is elementary and assumes only uniform comparison with the corresponding model.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22603v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Almost-Global Coordinates on Matrix Manifolds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22653.html</link><guid isPermaLink="false">arxiv:2611.22653v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><category>math.GT</category><description>&lt;p&gt;Bingjie Li, Jiaxiang Wang, Zhigang Yao&lt;/p&gt;&lt;p&gt;We study global coordinates on smooth manifolds outside some closed subsets of measure zero. We first give an elementary proof that every compact smooth manifold admits such coordinates, allowing the Euclidean parameter domain to be disconnected. We then study parametrizations of classical matrix groups, Stiefel manifolds, Grassmannians and real flag manifolds. For these parametrizations, we describe the inverse maps and compute the codimensions of the omitted subsets. We construct these parametrizations using Cayley transforms, graphs of linear maps and block Gaussian elimination. We also give formulas for Riemannian gradients and Haar integrals in these coordinates.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22653v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Symphonic Joins and Finite-Product Hopf Constructions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22845.html</link><guid isPermaLink="false">arxiv:2611.22845v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Xiangzhi Cao&lt;/p&gt;&lt;p&gt;We study how collapse at the ends of a warped product affects symphonic joins and Hopf constructions. For a Hopf construction with a fixed angular map on a finite product of closed Riemannian manifolds, we characterize when the reduced energy has infimum zero among functions connecting the two target poles. Under linear collapse this occurs precisely when, at some end, the collapsing factors have total dimension greater than three, or have total dimension three and vanishing angular density on the collapsing block. In either case the infimum is unattained. For ellipsoidal joins with nonconstant spherical factor maps, smooth extension of a connecting symphonic join forces each factor map to be the restriction of a linear isometric embedding. We also derive the coupled equations for orthogonally split targets, establish a convexity criterion for minimizing separated joins, and construct smooth quaternionic examples with all angular factors active.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22845v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Rank-sensitive Hodge bounds for symphonic energy and minimizers on sheared tori</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22865.html</link><guid isPermaLink="false">arxiv:2611.22865v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Xiangzhi Cao&lt;/p&gt;&lt;p&gt;We ask how far the minimum of symphonic energy in a homotopy class can exceed the Hodge lower bound from a pulled-back two-form. For projections from a family of sheared four-tori to the flat two-torus, we compute the minimum and the gap for every smooth shear profile. The gap depends on the variance of the profile. Attainment of the projection&amp;#x27;s pullback area energy by a coclosed test depends on its oscillation. We determine exactly which variances allow two profiles with the same positive gap and different outcomes for this test, and compute the convex relaxation beyond the oscillation threshold. In arbitrary source dimension the optimized test improves the Hodge bound precisely when the harmonic representative exceeds the rank allowed for the pullback on a set of positive measure. We also prove low-degree cohomology estimates, a sharp universal degree exponent for targets detected by low-degree cup products, and an exact defect identity that forces an immersed source to be symplectic at equality.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22865v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Pluricanonical locally conformally almost Kähler metrics, circle-invariant $G_2$ structures, and Laplacian flows</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22931.html</link><guid isPermaLink="false">arxiv:2611.22931v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DG</category><description>&lt;p&gt;Mehdi Lejmi&lt;/p&gt;&lt;p&gt;We study explicit Hodge evolutions of pluricanonical locally conformally almost Kähler metrics and their relation to locally conformal parallel $G_2$ structures. A compact locally conformal parallel $7$-manifold with a parallel non-zero Lee form, carrying a structure-preserving free circle action of constant orbit length orthogonal to the Lee field, has a $6$-dimensional quotient which is pluricanonical with a parallel Lee form and a non-integrable almost complex structure. The fundamental forms upstairs and downstairs are Laplacian eigenforms with an explicit eigenvalue ratio. Conversely, for a fixed normalized $SU(3)$ completion, we characterize the curvature of a circle-invariant locally conformal parallel lift. The lift equations force a pluricanonical base to have parallel Lee form, even locally, and exclude strict integrable pluricanonical bases. Independently, the pluricanonical eigenform identity gives a shrinking solution of He&amp;#x27;s full Hodge equation and an immortal $d^*d$ solution contracting the Lee plane.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22931v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Hill&#x27;s Lunar Equation as a Leaf: Riccati Reduction and Frobenius Theory for Second-Order PDEs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21818.html</link><guid isPermaLink="false">arxiv:2611.21818v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><category>math-ph</category><description>&lt;p&gt;Víctor León, Bruno Scárdua&lt;/p&gt;&lt;p&gt;The equations of Hill and Adams for the lunar perigee and node, Mathieu&amp;#x27;s equation and Lamé&amp;#x27;s equation arise as leafwise restrictions of one class of linear partial differential equations, the \emph{square-type foliated equations} $L^2u+A\,Lu+B\,u=0$, where $L$ is an analytic vector field and $A,B$ are analytic functions. Such an equation has a regular singularity exactly when the foliation defined by $L$ is analytically linearizable. At rational saddles, where every point of the indicial conic is resonant, we obtain convergent solutions whose exponents are holomorphic functions of a first integral; their variation describes the monodromy along the leaves and decides when classical Frobenius solutions exist. For a Hill equation, the characteristic exponent becomes the value of such a holomorphic function, given by a convergent series. This yields rigorous computer-assisted proofs of Hill&amp;#x27;s constant for the motion of the lunar perigee and of Adams&amp;#x27; constant for the motion of the node: Hill&amp;#x27;s value is confirmed within his own error estimate and its fifteenth decimal is determined, his value of the motion of the perigee is shown to be correct in all its digits, and Adams&amp;#x27; value is confirmed to twelve decimals. For Mathieu&amp;#x27;s equation, the curves of constant characteristic exponent that govern ion trapping appear as classical Frobenius loci. For Lamé&amp;#x27;s equation, we prove a product formula for the logarithmic obstructions, which coincide with the leading coefficients of the eigenvalue splittings computed by Volkmer and whose vanishing reflects the finite-gap property.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21818v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Structural functional identifiability of unknown differential equation observation maps</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22018.html</link><guid isPermaLink="false">arxiv:2611.22018v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Torkel E Loman, Alexander P Browning, Ruth E Baker&lt;/p&gt;&lt;p&gt;In many differential equation models of real-world systems, the mechanistic structure of the dynamics is known, but the map from the dynamics to the observations is not. This is potentially problematic, as it can prevent us from e.g. learning model parameter values from data. Examples where this occurs include measuring a fluorescent marker as a proxy for the dynamics of a cellular circuit, and using wastewater measurements to follow the development of an epidemic. The nascent field of hybrid modelling, in which machine learning components (like neural networks) are embedded within mechanistic models, provides the tools to learn such maps. Here, the system&amp;#x27;s dynamics keep their mechanistic form, while a neural network represents the unknown observation map and is trained alongside any unknown core system parameters. This raises a question of identifiability: when can the true observation map be learnt, and when does one simply learn some map that transforms the dynamics into the available data? Building on previous work, we show how structural functional identifiability analysis can establish whether a model&amp;#x27;s unknown observation maps and core system parameters are identifiable, i.e. can be uniquely learnt from data. We both prove general results on when models with unknown observation maps are, and are not, identifiable, and demonstrate a general methodology (based on differential algebra) for assessing the identifiability of such models. This paves the way for applying classic differential equation workflows to the many real-world systems that contain such unknown maps.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22018v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Flocking Time and Graph Volume in Nonlinear Cucker-Smale Models with Dynamic Networks</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22204.html</link><guid isPermaLink="false">arxiv:2611.22204v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><category>cs.LG</category><category>nlin.AO</category><description>&lt;p&gt;Sooyeon Song, Jea-Hyun Park&lt;/p&gt;&lt;p&gt;This study proposes a Cucker-Smale model incorporating dynamic networks and the discrete $p$-Laplacian ($p \in (1,2)$) and analyzes the relationship between flocking time constraints and graph connectivity from both theoretical and experimental perspectives. We establish that this model achieves flocking within finite time and derive a quantitative relationship between the lower bound of flocking time and graph volume. Based on these results, we observe that imposing sufficiently small flocking time induces an increase in network volume, and that larger initial velocity variance requires greater volume under the same time constraint. In our experiments, we trained a transformer-based PPO policy to select network structures at each time step. Under the most stringent time constraint, the maximum average number of connections increased sharply, confirming a threshold effect. The negative correlation between convergence time and average number of connections reflects the theoretical results well. This study provides quantitative evidence for the phenomenon that time constraints induce connection mobilization.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22204v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] A new premodel for bounded type Siegel disks of some transcendental entire functions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22364.html</link><guid isPermaLink="false">arxiv:2611.22364v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Fei Yang, Gaofei Zhang, Yanhua Zhang&lt;/p&gt;&lt;p&gt;In the 1980s, Douady and Sullivan conjectured that the Siegel disks of rational maps with degree at least two are Jordan domains. Based on the study of Blaschke models, this conjecture was settled by Zhang under the condition that the Siegel disks are of bounded type, and by Zakeri for a large number of transcendental entire functions under the same condition. The entire functions studied by Zakeri have exactly one finite asymptotic value, which is the center of the fixed Siegel disk. Chéritat, and later with Epstein, also studied the Siegel disk boundaries of such type transcendental entire functions by developing Ghys-like models. In this paper, by introducing a new premodel, we prove that the fixed bounded type Siegel disk centered at the non-zero point $λ-1$ of $f_λ(z)=e^{1-λ}ze^z$ is a quasi-disk whose boundary contains the critical point $-1$. The asymptotic value $0$ is not contained in the Siegel disk of these entire functions, which is essentially different from the previous results. Moreover, we prove that the Julia sets of these functions with a fixed bounded type Siegel disk are locally connected.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22364v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Waist inequality and a Hurewicz-type theorem for mean dimension</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22390.html</link><guid isPermaLink="false">arxiv:2611.22390v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Qiang Huo, Kangbo Ouyang, Ruxi Shi, Masaki Tsukamoto&lt;/p&gt;&lt;p&gt;We establish a Hurewicz-type inequality relating mean dimension and conditional metric mean dimension. For every equivariant continuous map between dynamical systems, the mean dimension of the domain is bounded above by the sum of the mean dimension of the target and the conditional metric mean dimension of the map. In particular, any equivariant continuous map that decreases mean dimension must have infinite topological conditional entropy. The key ingredient is a new waist inequality, which we believe is of independent geometric interest beyond its application to dynamical systems. Compared with Gromov&amp;#x27;s original waist inequality, a distinctive feature of this inequality is that it applies to finite simplicial complexes of arbitrary topology, subject only to dimensional restrictions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22390v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Global phase-plane organization of a toxin-mediated plant-herbivore model</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22451.html</link><guid isPermaLink="false">arxiv:2611.22451v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><category>math-ph</category><description>&lt;p&gt;Gabriele Grifò&lt;/p&gt;&lt;p&gt;Plant-herbivore interactions with chemical plant defence mechanisms can generate complex population dynamics through the nonlinear interplay between resource availability, herbivore pressure, and defence-induced feedbacks. In this work, we investigate the dynamical organization of a plant-herbivore model characterized by a non-monotone functional response accounting for inhibitory effects on grazing activity. In particular, we perform a qualitative and geometric analysis of the associated homogeneous system, characterizing the dynamical regimes supported by the model and the transitions between them. The results reveal the emergence of oscillatory behaviour through a Hopf bifurcation and the occurrence of stable periodic solutions. We further characterize the global phase-plane organization, providing a complete classification of equilibrium configurations and heteroclinic structures supported by the model. In addition, we identify the conditions under which homoclinic connections may occur and discuss their role in shaping the global dynamics. The analysis provides a unified description of the phase-plane organization and highlights how nonlinear defence feedbacks generate qualitatively distinct ecological outcomes, including extinction, stable coexistence, persistent oscillations, and global bifurcation scenarios organized by heteroclinic and homoclinic structures.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22451v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Reconstructing hidden attractors with reservoir computing</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22918.html</link><guid isPermaLink="false">arxiv:2611.22918v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><category>nlin.CD</category><description>&lt;p&gt;Mohammad Zaman, Emel Khan, Thomas Geert de Jong&lt;/p&gt;&lt;p&gt;Hidden attractors are difficult to locate as their basins of attraction do not intersect with any small neighborhood of an equilibrium point. We examine the possibility of reconstructing the hidden chaotic attractor from time series via reservoir computing, where the reservoir is built by a network of driven Kuramoto oscillators. We compare all-to-all coupling, nearest-neighbour ring coupling, and a ring with one modified oscillator equation which ensures that any attractor will be hidden. The numerical results suggest that ring coupling supports accurate reconstruction over a wider range of coupling and forcing strengths than all-to-all coupling. Searches near reservoir equilibria nevertheless show why agreement in short-term prediction and long-term statistics does not establish preservation of hiddenness. Numerics for the modified ring show that it has the highest performance which coincides with our intuition that reconstructing the global dynamics would yield a more faithful attractor reconstruction. We also show that this construction precludes global forgetting of initial conditions for constant inputs, although local conditional contraction along a nonconstant signal remains possible. The distinction between reconstructing attractor dynamics and preserving basin structure provides a basis for evaluating and designing reservoir models of hidden attractors.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22918v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] The orbital architecture of 14 Herculis system as a KAM-stable three-body configuration</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23033.html</link><guid isPermaLink="false">arxiv:2611.23033v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Francisco Crespo, Jesús F. Palacián, Edward A. Turner, Patricia Yanguas&lt;/p&gt;&lt;p&gt;The 14 Herculis system hosts two massive giant planets on eccentric and mutually inclined orbits, making it a compelling test case for long-term stability in the spatial planetary three-body problem. We develop an analytical description of its dynamics using averaging, symplectic reduction of symmetries and KAM theory. For parameters compatible with the observed architecture, the secular quadrupole Hamiltonian possesses two elliptic relative equilibria that organise the nearby dynamics. The octupole contribution introduces a second slow angle and yields a properly-degenerate multiscale Hamiltonian. Under the corresponding smallness, non-resonance, and non-degeneracy conditions, families of quasi-periodic orbits coming from the relative equilibria of the quadrupolar approximation fill invariant 2-tori. Restoring the two fast mean anomalies and the cyclic angle conjugate to the angular-momentum, and considering the full system, produce two Cantor families of five-dimensional quasi-periodic tori in the reconstructed planetary problem. These invariant structures provide a Hamiltonian mechanism for the long-term confinement of eccentric and mutually inclined configurations compatible with 14 Her.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23033v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Tropicalization and slow manifolds: A case study of the Michaelis--Menten reaction</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23117.html</link><guid isPermaLink="false">arxiv:2611.23117v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Kristian Uldal Kristiansen, Peter Szmolyan&lt;/p&gt;&lt;p&gt;We present a case study of a recently developed approach to multiple-scale systems based on exponential scaling and tropicalization (Kristiansen and Sarantaris, \emph{On a tropicalization of planar polynomial ODEs}). Parameters and variables are scaled exponentially with respect to a small parameter $ε$, so that orders of magnitude become a genuine non-smooth singular limit $ε\to 0$. Tropical geometry, via subdivisions of the Newton polygon, classifies the asymptotic regimes and locates the candidates for slow manifolds on all scales of the variables simultaneously. Here we combine this framework with blow-up and geometric singular perturbation theory. {In particular,} the non-smooth singular limit is resolved by spherical and cylindrical blow-ups, and degeneracies caused by exponentially small terms with flat contact are treated by adding the exponential quantities as new variables {(following Kristiansen, \emph{Blowup for flat slow manifolds})}. As the case study, we take the Michaelis--Menten reaction. The tropical classification yields three asymptotic regimes of parameters. In two of these, we find a sequence of blowups and desingularizations where the system has a {global} normally hyperbolic critical manifold on the blown up space. In the remaining case, we obtain a similar result, but only for a subcase. In particular, there is an asymptotic regime of parameters where there is no global slow manifold of the Michaelis--Menten reaction.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23117v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Multifractal analysis of Takagi-type functions built from beta-expansion cylinders</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23195.html</link><guid isPermaLink="false">arxiv:2611.23195v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><description>&lt;p&gt;Samuel Nicolay&lt;/p&gt;&lt;p&gt;We study a family of Takagi functions obtained by placing a normalized tent on each beta-expansion cylinder, with amplitude $β^{-αn}$ at order $n$, where $β&amp;gt;1$ and $0&amp;lt;α\le1$. We characterize their pointwise Hölder regularity in terms of cylinder lengths and distances from the point under consideration. The characterization holds more generally for nested interval partitions with exponentially decreasing mesh, without requiring interval lengths at a given order to be comparable. For beta-expansion cylinders, we compute the full multifractal spectrum whenever the remainders of the expansion of $1$ have a finite upper exponential decay rate. The functions are monofractal when this rate vanishes, as it does for Parry, Pisot and Salem bases. When it is positive, the spectrum is affine on a nondegenerate interval. The bases defined by $\sum_{k\ge0}β_\ell^{-\ell^k}=1$, for integers $\ell\ge2$, give explicit non-monofractal examples. We also prove that every function in the family is nowhere differentiable.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23195v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] On the multiplicity of crossing limit cycles of double diagonalizable piecewise linear vector fields</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23230.html</link><guid isPermaLink="false">arxiv:2611.23230v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.DS</category><category>math.CA</category><description>&lt;p&gt;Lucas Queiroz Arakaki, Daniel Panazzolo&lt;/p&gt;&lt;p&gt;We consider planar piecewise linear vector fields with two zones separated by a straight line and having two diagonalizable components, which we call the \emph{double diagonalizable configuration}. In this configuration, the Poincaré half-maps correspond to separatrices of saddle points in the foliations of symmetric differential forms $ω_r(x)-ω_r(y)$, where $ω_r$ is a rational $1$-form with exactly three simple poles. Limit cycles correspond to non-diagonal intersections of two such separatrices, and the multiplicity of a limit cycle is precisely the order of contact at the intersection point. We prove that two distinct separatrices which are not nested segments of the same straight line have a contact of order at most $4$ at a diagonal point and at most $2$ at a non-diagonal point. As a consequence, we obtain that the multiplicity of limit cycles in the double diagonalizable configuration is at most two, this bound being sharp.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23230v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Banach-Mazur distance and related methods of comparing convex bodies</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21947.html</link><guid isPermaLink="false">arxiv:2611.21947v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Marek Lassak, Stanislaw J. Szarek&lt;/p&gt;&lt;p&gt;The Banach-Mazur distance is one of the standard tools used in the study of mathematical objects such as convex bodies or normed spaces, and it becomes indispensable when investigating properties that are invariant under linear isomorphisms. It appears in convex geometry and convex analysis as a way to quantify the approximation of convex bodies. In functional analysis, it plays a basic role in the study of local properties of Banach spaces. The goal of this survey is to present a cohesive picture of these two perspectives. We supply an extensive collection of known results for reference and list open problems of varying difficulty, which could stimulate further research. We include in our discussion several distinct variations on the concept of the Banach-Mazur distance, some of them exploratory, that haven&amp;#x27;t received much attention to date in the literature. We follow the trend - which emerged in recent decades - of considering arbitrary convex bodies, and not just those that are centrally symmetric. Finally, we include a comprehensive list of references on the Banach-Mazur distance.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21947v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Boundedness of a Schur multiplier on the Schatten p-class, $1 &lt; p \neq 2 &lt; \infty$, does not imply complete boundedness</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22111.html</link><guid isPermaLink="false">arxiv:2611.22111v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Jinghao Huang, Anna Tomskova, Fedor Sukochev&lt;/p&gt;&lt;p&gt;We prove the existence of a bounded Schur multiplier on the Schatten class $S_p(\ell_2)$ which is not completely bounded when $1&amp;lt;p\ne 2&amp;lt;\infty$, which confirms Pisier&amp;#x27;s conjecture (1998).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22111v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Approximation numbers of Hankel Operators on Weighted Fock Spaces and the Berger--Coburn Phenomenon</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22271.html</link><guid isPermaLink="false">arxiv:2611.22271v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Guijun Liu, Xiaofeng Wang, Jin Xia&lt;/p&gt;&lt;p&gt;Let $\varphi\in C^2(\mathbb{C}^n)$ be a real-valued weight whose real Hessian is uniformly positive definite and bounded. For $0&amp;lt;p&amp;lt;\infty$, $1\le q&amp;lt;\infty$, and possibly unbounded symbols $f$, we give necessary and sufficient conditions for prescribed decay of the approximation numbers of Hankel operators $H_f$ from weighted Fock spaces $F^p(\varphi)$ to weighted Lebesgue spaces $L^q(\varphi)$ in terms of the non-increasing rearrangement of the IDA function of $f$. We also characterize membership in the approximation ideals $\mathfrak A_s(F^p(\varphi),L^q(\varphi))$ and their weak counterparts $\mathfrak A_{s,\infty}(F^p(\varphi),L^q(\varphi))$ for $0&amp;lt;s&amp;lt;\infty$. The symbol criteria involve Lorentz, Lorentz--Zygmund, and Copson--Lorentz spaces. Our approach also yields the converse to the sufficient condition in [15], thereby completing the characterization of prescribed singular value decay for Hankel operators on a broad class of weighted Bergman spaces. For the pair $H_f$ and $H_{\bar f}$ on weighted Fock spaces, we characterize simultaneous decay of their approximation numbers and simultaneous membership in these ideals in terms of the mean oscillation function of $f$. For bounded symbols, we establish the Berger--Coburn phenomenon for both ideals in sharp exponent ranges. A new feature in the case $p&amp;lt;2&amp;lt;q$ is that the Berger--Coburn equivalence holds for $s_0(p,q)&amp;lt;s\le1$, where the sharp threshold $s_0(p,q)$ is strictly less than $1$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22271v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Bourin&#x27;s Crossed-Heinz Inequality in the Frobenius Norm</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22363.html</link><guid isPermaLink="false">arxiv:2611.22363v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Yulong Tian, Jinli Xu&lt;/p&gt;&lt;p&gt;For positive semidefinite matrices $A,B \in M_n(\mathbb{C})$ and $0&amp;lt;t&amp;lt;1$, we establish the sharp quantitative Frobenius-norm inequality $\|A^t B^{1-t}+B^t A^{1-t}\|_{\mathrm{F}}^2+4t(1-t)\|A-B\|_{\mathrm{F}}^2 \le \|A+B\|_{\mathrm{F}}^2$ for every dimension $n\ge1$. In particular, Bourin&amp;#x27;s crossed-Heinz inequality $\|A^t B^{1-t}+B^t A^{1-t}\|_{\mathrm{F}} \le \|A+B\|_{\mathrm{F}}$ holds with equality if and only if $A=B$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22363v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Commutants of diagonal operators</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22802.html</link><guid isPermaLink="false">arxiv:2611.22802v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Maofa Wang, Xingxing Yao&lt;/p&gt;&lt;p&gt;The aim of this paper is devoted to the profound and comprehensive characterization when diagonal operators having the minimal or double commutant property on a separable Hilbert space, in terms of the topological and geometric properties of their spectra.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22802v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] The random Riesz&#x27;s lemma in random normed modules</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22816.html</link><guid isPermaLink="false">arxiv:2611.22816v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Guang Yang, Tiexin Guo&lt;/p&gt;&lt;p&gt;Riesz&amp;#x27;s lemma states that a normed space is finite-dimensional if and only if its closed unit ball is sequentially compact. The purpose of this paper is to establish a random counterpart of this lemma in a random normed module. Precisely speaking, based on the two recent developments in random functional analysis: one is the dimensional decomposition of a regular $σ$-stable $L^0$-module, and the other is the theory of random sequential compactness in a random normed module, we can finally establish the random Riesz&amp;#x27;s lemma, which states that a $σ$-stable random normed module is proper if and only if its random closed unit ball is random sequentially compact.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22816v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] $(α,β)$-lineability and spaceability of functions with a unique maximum</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22851.html</link><guid isPermaLink="false">arxiv:2611.22851v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;Anderson Felipe de Souza Barbosa, Daniel Marinho Pellegrino, Anselmo Baganha Raposo Junior&lt;/p&gt;&lt;p&gt;Motivated by the classical work of Gurariy and Quarta on linear spaces of continuous functions with a unique point of maximum, we determine the largest possible dimension of such spaces in several settings. For a connected $n$-manifold $M$ without boundary, with $n\ge2$, the largest dimension of a subspace of $\mathcal{C}_0(M)$ whose nonzero elements attain their maximum at exactly one point is $n+1$ if $M$ is homeomorphic to $S^n$, and $n$ otherwise. We also establish the sharp bound $n+1$ in $\mathcal{C}(\mathbb R^n)$ and obtain results on extensions of prescribed finite-dimensional subspaces.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22851v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Hadamard inverse mapping theorem for certain continuously Gateaux differentiable mappings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22939.html</link><guid isPermaLink="false">arxiv:2611.22939v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><description>&lt;p&gt;M. Hamamdjiev, N. Zlateva&lt;/p&gt;&lt;p&gt;Hadamard inverse mapping theorem concerns global inversion of continuously differentiable mappings between Banach spaces. Here we consider a weaker notion of smoothness and work with continuously Gateaux differentiable mappings. We prove that a continuously Gateaux differentiable mapping with invertible derivatives such that the inverses are uniformly bounded, possesses a continuous right inverse on every compact set. We also provide sufficient conditions for global invertibility of certain continuously Gateaux differentiable mappings between Banach spaces.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22939v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.FA] Generalized and Convex Poincaré Inequalities via Transport-Divergence Inequalities</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23004.html</link><guid isPermaLink="false">arxiv:2611.23004v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.FA</category><category>math.PR</category><description>&lt;p&gt;Thibaut Le Gouic, Magali Tournus&lt;/p&gt;&lt;p&gt;We investigate the relationship between generalized $(q&amp;#x27;,p&amp;#x27;)$-Poincaré inequalities and transport-divergence inequalities involving $χ^q$-type divergences. Extending the classical correspondence between the $(2,2)$-Poincaré inequality and quadratic transport-$χ^2$ inequalities, we prove that a $(q&amp;#x27;,p&amp;#x27;)$-Poincaré inequality is equivalent to a transport-divergence inequality for conjugates $(p,p&amp;#x27;)$ and $(q,q&amp;#x27;)$. We then study the convex counterpart of these inequalities. Using weak barycentric optimal transport and convex order, we establish an equivalence between convex $(q&amp;#x27;,p&amp;#x27;)$-Poincaré inequalities and weak transport-divergence inequalities involving a projected $χ_q$ divergence. We further characterize the minimizers arising in this projection problem through a geometric condition on the relative density. In dimension one, we analyze the geometric consequences of $(q&amp;#x27;,p&amp;#x27;)$-Poincaré inequalities by identifying sharp conditions on the behavior of the density both at infinity and near isolated zeros. We show that when $q&amp;#x27;&amp;gt;p&amp;#x27;$, the concentration behavior becomes polynomial rather than exponential at infinity. Finally, we interpret these inequalities through the lens of optimization in Wasserstein space. In particular, the equivalence between transport-divergence and Poincaré inequalities appears as an analogue of the equivalence between quadratic growth and Polyak--Łojasiewicz inequalities in finite-dimensional optimization.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23004v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GN] Hausdorff reflections and obstruction ideals for filter topologies on MV-algebras</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22696.html</link><guid isPermaLink="false">arxiv:2611.22696v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GN</category><description>&lt;p&gt;Yanyan Dong, Bin Pang, Yi Shi&lt;/p&gt;&lt;p&gt;MV-algebras arise in many-valued logic and are closely related to lattice-ordered groups. We characterize Hausdorff separation in filter topologies through their associated ideals. For every proper lattice filter, $T_0$, $T_1$ and $T_2$ are equivalent, and the zero-neighborhood ideal determines a canonical Hausdorff reflection. For a radius filter satisfying a refinement condition, the filter topology agrees with the ambient subspace topology exactly when every radius is a weak order unit. This answers a question of Luan, Zhao and Yang without requiring divisibility of the representing group. These results reveal two successive algebraic obstructions: a polar obstruction controlling compatibility with the ambient topology, followed by a relative infinitesimal obstruction controlling the residual failure of Hausdorff separation. For a unital lattice-ordered subring of $C(X,\mathbb R)$, where $X$ is compact Hausdorff and the unit is $\mathbf1$, the associated exact sequence admits a positive additive section exactly when the relative infinitesimal ideal vanishes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22696v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] Translation surfaces with logarithmically growing systole</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21853.html</link><guid isPermaLink="false">arxiv:2611.21853v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GT</category><description>&lt;p&gt;Benjamin Dozier&lt;/p&gt;&lt;p&gt;We exhibit a sequence of translation surfaces $T_1, T_2,...$ with $T_g$ of genus $g$ and area $g$, such that the systole grows logarithmically with $g$. They are produced by starting with a fixed translation surface, taking covers with the same topology as those discovered by Brooks, and then adding handles by gluing along slits.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21853v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] Exotic smooth structures on nonorientable 4-manifolds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21967.html</link><guid isPermaLink="false">arxiv:2611.21967v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GT</category><category>math.DG</category><description>&lt;p&gt;R. İnanç Baykur&lt;/p&gt;&lt;p&gt;We construct closed nonorientable aspherical 4-manifolds with an arbitrarily large number of distinct smooth structures. This uses the reflection trick of Davis-Hayden-Huang-Ruberman-Sunukjian. Our examples become mutually diffeomorphic after either type of stabilization: taking a product with the real line, or taking a connected sum with sufficiently many copies of S^2 x S^2.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21967v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] Cyclic group actions on K3 surfaces and almost complex structures</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22154.html</link><guid isPermaLink="false">arxiv:2611.22154v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GT</category><category>math.DG</category><description>&lt;p&gt;David Baraglia&lt;/p&gt;&lt;p&gt;Fintushel, Stern and Sunukjian constructed exotic $\mathbb{Z}_n$-actions on $K3$ for $n=2,3,4$ using twist-rim surgery. We prove that these exotic actions do not preserve any Ricci flat metric or any integrable complex structure. This answers a question of Farb and Looijenga in the negative. In contrast, we prove that any smooth $\mathbb{Z}_n$-action on $K3$ for which the fixed point set has only non-isolated fixed points preserves an almost complex structure with trivial first Chern class. In particular, this applies to the Fintushel-Stern-Sunukjian examples. Lastly, we classify the possible fixed point data and action on cohomology for cyclic group actions on $K3$ of prime order which preserve an almost complex structure with trivial first Chern class.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22154v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] Orbifold Morse Handles II. Boundary Regions, Gluing Maps, and Surgery Cobordisms</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22293.html</link><guid isPermaLink="false">arxiv:2611.22293v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GT</category><description>&lt;p&gt;Suhyoung Choi, Juseop Lee&lt;/p&gt;&lt;p&gt;We study four-dimensional quotient handles defined by faithful representations of finite groups in $\mathrm{SO}(4)$ and invariant splittings of indices $1$, $2$, and $3$. We identify their attaching and belt regions as oriented $3$-orbifolds described by labeled singular graphs. We determine the orbifold isotopy class of the boundary gluing map. Fix an orientation-reversing orbifold embedding of the attaching region into an oriented $3$-orbifold. Assume that the embedding induces isomorphisms on local groups. The regions, gluing class, and embedding determine the surgery. For a fixed handle and attaching image, an extension condition on the belt region characterizes diffeomorphisms of the cobordisms fixing a specified common exterior pointwise. For index-$2$ handles, this condition is the vanishing of an integer twist in the fixed boundary coordinates. We use these surgeries to construct a compact connected oriented $4$-orbifold cobordism from every closed connected oriented $3$-orbifold $\mathcal O$ to $S^3$. A finite sequence of index-$2$ orbifold handle attachments from $\mathcal O$ to $S^3$ exists if and only if $\mathcal O$ has no tetrahedral, octahedral, or icosahedral vertices. Let $v_{\mathbf T}(\mathcal O)$, $v_{\mathbf O}(\mathcal O)$, and $v_{\mathbf I}(\mathcal O)$ denote the numbers of these vertices. Among finite sequences of handle attachments of indices $1$, $2$, and $3$ from $\mathcal O$ to $S^3$, the minimum total number of index-$1$ and index-$3$ handles is $\left\lceil\frac{v_{\mathbf T}(\mathcal O)}{2}\right\rceil+ \left\lceil\frac{v_{\mathbf O}(\mathcal O)}{2}\right\rceil+ \left\lceil\frac{v_{\mathbf I}(\mathcal O)}{2}\right\rceil$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22293v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] Positivity of minimal volume entropy for some closed manifolds with zero simplicial volume</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22863.html</link><guid isPermaLink="false">arxiv:2611.22863v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GT</category><description>&lt;p&gt;Inkang Kim, Xueyuan Wan&lt;/p&gt;&lt;p&gt;For every integer $m\ge4$, we construct a closed connected oriented smooth $m$-manifold whose simplicial volume is zero and whose minimal volume entropy is positive. This answers negatively the question, attributed to Gromov, whether vanishing simplicial volume implies vanishing minimal volume entropy. Each example has a connected regular five-sheeted covering with zero minimal volume entropy, so vanishing of this invariant does not descend through finite coverings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22863v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] The system of length sets of transfer Krull monoids over $C_3 \oplus C_3 \oplus C_3$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21699.html</link><guid isPermaLink="false">arxiv:2611.21699v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><category>math.AC</category><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Alfred Geroldinger, Benjamin Hackl, Qinghai Zhong&lt;/p&gt;&lt;p&gt;Let $H$ be a Krull monoid with class group $G$ and suppose that each class contains a prime divisor. There are precisely nine groups (up to isomorphism) for which the set of distances of $H$ is contained in $\{1, 2\}$. For all these groups, except for $C_3 \oplus C_3 \oplus C_3$, the system of length sets has been written down explicitly. In this paper we close this gap and determine the system of length sets when the class group is isomorphic to $C_3 \oplus C_3 \oplus C_3$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21699v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Reflection Character Varieties in $\mathrm{SL}_{\pm}(n,\mathbb{R})$ for $2$-Perfect Labeled Truncation Polytopes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21700.html</link><guid isPermaLink="false">arxiv:2611.21700v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><description>&lt;p&gt;Suhyoung Choi, Yongho Seo&lt;/p&gt;&lt;p&gt;A truncation polytope is a combinatorial polytope represented by a convex polytope obtained from a simplex by a finite sequence of vertex truncations. Marquis studied the deformation spaces of labeled truncation $3$-polytopes, and Choi-Lee-Marquis studied the $2$-perfect case in higher dimensions. In this paper, we consider Coxeter groups associated with non-simplex $2$-perfect labeled truncation $d$-polytopes with connected Coxeter diagrams, where $d\ge3$. For $n\ge d+1$, we study their reflection-generated representations in $\mathrm{SL}_{\pm}(n,\mathbb{R})$ satisfying Vinberg&amp;#x27;s conditions. Their images in the real GIT quotients of the full representation spaces under conjugation define the reflection character varieties. These varieties and their subspaces of strict characters are semialgebraic, and we determine their common dimension whenever strict characters exist. We also decompose these subspaces by Cartan matrix rank, show that the nonempty pieces are smooth manifolds, and compute their dimensions explicitly.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21700v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Virtually solvable groups with balanced presentations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21875.html</link><guid isPermaLink="false">arxiv:2611.21875v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><category>math.GT</category><description>&lt;p&gt;Jonathan A. Hillman&lt;/p&gt;&lt;p&gt;We show that if $G$ is a virtually solvable group with finite Hirsch length and such that $β_2(G;\mathbb{Q})\leqβ=β_1(G;\mathbb{Q})$ then $β\leq3$. This sharpens bounds on the Betti numbers of 3-manifolds which embed in $S^4$ with the fundamental groups of each complementary region virtually solvable and of finite Hirsch length.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21875v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Finitely generated groups with arbitrarily fast MIF growth</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21886.html</link><guid isPermaLink="false">arxiv:2611.21886v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><description>&lt;p&gt;Yash Lodha&lt;/p&gt;&lt;p&gt;A group $G$ is mixed identity free, or MIF, if for each nontrivial $w(x)\in G\star (\mathbb{Z}=\langle x\rangle)$ there is some $g\in G$ such that $w(g)\neq 1$. Associated to MIF groups is a natural growth function that measures how far in the Cayley graph one witnesses such inequations. We adapt a recent construction of the author with Hyde to show that for each function $f:\mathbf{N}\to \mathbf{N}$ there is a finitely generated group $G$ whose MIF growth function grows faster than $f$. This answers a question first considered by Henry Bradford. As a consequence, we also provide the first examples of finitely generated MIF groups that are not selfless, answering a question of Bradford and Sisto.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21886v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Permutation groups, derangements and connections</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21894.html</link><guid isPermaLink="false">arxiv:2611.21894v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><category>math.CO</category><description>&lt;p&gt;Scott Harper&lt;/p&gt;&lt;p&gt;What is the chance that a random shuffling of a deck of cards leaves no card in its original place? More precisely, what is the chance that a random permutation has no fixed points? A permutation with no fixed points is known as a derangement. Questions about derangements, like the ones above, go back centuries, but there are also several unsolved problems in this very active area of permutation group theory. Based on a minicourse given at &amp;quot;Groups and Algebras in Bicocca for Young Algebraists&amp;quot; in June 2026, this survey provides a general introduction to permutation group theory, with a specific focus on derangements. The survey features modern methods for studying permutation groups, recent developments and open problems concerning derangements and connections between this topic and other areas, such as combinatorics, graph theory, number theory, representation theory and topology.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21894v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Enumerating orbits of finite classical groups on their Lie algebras</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22082.html</link><guid isPermaLink="false">arxiv:2611.22082v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><category>math.CO</category><description>&lt;p&gt;Jason Fulman, Robert M. Guralnick, Richard Stong&lt;/p&gt;&lt;p&gt;We enumerate the orbits of a finite classical group in the adjoint action on its Lie algebra, giving exact generating functions and very good upper bounds. We treat the general linear, unitary, symplectic and orthogonal groups, in both odd and even characteristic. In even characteristic, we get very nice formulas for the number of orbits on nilpotent classes both in the finite and algebraically closed case. We discuss the connection with commuting varieties.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22082v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] Exact factorizations of countable groups into discrete and thin subsets</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22959.html</link><guid isPermaLink="false">arxiv:2611.22959v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.GR</category><description>&lt;p&gt;Mikhail Kabenyuk&lt;/p&gt;&lt;p&gt;For every countably infinite Hausdorff topological group $G$, we construct an exact factorization $G=AB$, where $A,B\subseteq G$ and every element of $G$ has a unique representation as $ab$ with $a\in A$ and $b\in B$. Both factors are infinite, closed, discrete, and thin. A subset $C\subseteq G$ is thin if the intersections $hC\cap C$ and $Ch\cap C$ are finite for every nonidentity element $h\in G$. In any countably infinite group, an exact factorization into two infinite thin subsets can be constructed starting from any partial exact factorization with finite nonempty factors. Given a finite or countably infinite family of infinite subsets of the group, we can choose the extension so that each factor meets every member of the family in infinitely many points. If the topology on the group has a countable base and every nonempty open set is infinite, taking the nonempty members of the base as this family yields dense thin factors.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22959v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] A polynomial-time decoding algorithm up to half the square-root bound for quadratic residue and generalized quadratic residue codes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21888.html</link><guid isPermaLink="false">arxiv:2611.21888v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><description>&lt;p&gt;Phlippe Gaborit, Philippe Lebacque&lt;/p&gt;&lt;p&gt;Binary quadratic residue (QR) codes, introduced by Prange in 1958, are cyclic codes of prime length $p\equiv\pm1\pmod 8$ and dimension $(p+1)/2$ whose minimum distance satisfies the square-root bound $d\ge\sqrt p$. They include the Hamming code $[7,4,3]$ and the Golay code $[23,12,7]$, and were generalized by van Lint and MacWilliams to generalized quadratic residue (GQR) codes of prime-power length $q$, for which the bound $d\ge\sqrt q$ still holds and is attained when $q$ is a square. In coding theory, one usually first finds a lower bound on the minimum distance of a family of codes, and then a polynomial-time algorithm decoding up to half of this bound, as for BCH, Reed--Muller or Gabidulin codes. Until now, GQR codes had resisted this approach: no such algorithm was known, apart from individual short lengths. We give a deterministic algorithm which, for every odd prime power $q\equiv\pm1\pmod 8$, corrects every error pattern of weight at most $\lfloor(\sqrt q-1)/2\rfloor$ in the binary GQR code of length $q$, in $O(q^{9/2})$ operations in $\F_q$. We start from a description of QR codes due to Helleseth, which we extend to GQR codes, and in which the syndrome gives the values of the quadratic character of the error-locator polynomial. We then recover this polynomial by adapting to GQR codes the tools that Kopparty developed for recovering polynomials from noisy character values, with the decoding of dual BCH codes as an application. Since the square-root bound is attained when $q$ is a square, this radius is the largest that can be guaranteed uniformly on the class of GQR codes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21888v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] An upper bound on non-overlapping codes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21913.html</link><guid isPermaLink="false">arxiv:2611.21913v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><category>math.CO</category><description>&lt;p&gt;Simon R. Blackburn&lt;/p&gt;&lt;p&gt;Non-overlapping codes (also known as bifix-free codes or strong comma-free codes) have now been studied for over 60 years as part of information theory, with regular new applications appearing and much recent interest. Let $X$ be a binary non-overlapping code of length $n$. The paper contains a self-contained proof that \[ |X|\leq \left(\frac{5}{6e} +O(n^{-1})\right)\frac{2^n}{n} \] as $n\rightarrow\infty$. This improves, by a factor of $5/6$, the best previously known bound due to Levenshtein (1970). The paper builds on work by Fimmel, Michel, Pirot, Sereni and Strüngmann (2019), and by Stanovnik, Mo\v skon and Mraz (2024).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21913v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Computed Permutation Trellis Coding: Near-Optimal Quantization from Two Multiplications and a 64-Byte Table</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22019.html</link><guid isPermaLink="false">arxiv:2611.22019v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><category>cs.AI</category><category>cs.AR</category><category>cs.LG</category><description>&lt;p&gt;Muhammed Fatih Balın&lt;/p&gt;&lt;p&gt;We propose Computed Permutation Trellis Coding (CPTC), a low-bit quantization format for tensors written once and read many times. Formats that round each value on its own, such as INT4 and FP4, waste a large part of their bits against the information-theoretic ideal. Trellis codes recover this loss by encoding values jointly, but prior decoders either need a large lookup table for their best quality or compute values with a hash that restricts what they can decode. CPTC&amp;#x27;s decoder multiplies its state by two coefficients and adds the top bits of the products to index a 64-byte table. Because that sum is not uniformly distributed, the rarely used ends of a small table can hold values far out in the tails. One decoder serves every bit width from 1 to 6, reproduces the standard integer and floating-point formats exactly, and comes within 0.07 bits of the ideal at 4 bits. It matches a random-permutation trellis code whose table is thousands of times larger, and exceeds every QTIP codebook. In LLM weight quantization without fine-tuning, CPTC has the lowest KL divergence to the unquantized model at every tested bit width on Llama 3.1 8B and 70B Instruct against QTIP&amp;#x27;s codebooks (by up to 27%). The decoder has been built into the AWS Trainium 4 AI accelerator, where it runs at the throughput of the native FP4 and FP8 formats for a negligible fraction of the systolic array&amp;#x27;s area. Fused encoding kernels quantize an 8B model&amp;#x27;s linear layers in under two minutes on one GPU and, in cycle-level simulation, on one Trainium 4 chip.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22019v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Subsystem Stabilizer $(r,δ)$-Locally Recoverable Codes: Characterization, Bounds and Constructions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22221.html</link><guid isPermaLink="false">arxiv:2611.22221v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><description>&lt;p&gt;Yaozong Zhang, Sihem Mesnager, Xiaoqiang Wang, Jian Gao&lt;/p&gt;&lt;p&gt;Local erasure recovery limits the number of physical systems accessed to repair a distributed quantum memory. For subsystem stabilizer codes (SSCs), a basic question is whether erasures can be corrected within a prescribed repair set. In this paper, we study subsystem stabilizer $(r,δ)$-locally recoverable codes ($(r,δ)$-SSLRCs), in which each coordinate belongs to a repair set of size between $δ$ and $r+δ-1$ that corrects any set of up to $δ-1$ erasures while preserving the logical subsystem and allowing the gauge subsystem to change. We first characterize local erasure recovery algebraically and apply this criterion to Calderbank-Shor-Steane (CSS) and Hermitian hull constructions for $(r,δ)$-SSLRCs. For $(r,δ)$-SSLRCs, without assuming purity, we derive a redundancy bound for disjoint repair sets, a supported-subspace bound based on supported stabilizer and gauge subspaces, and a mixed counting bound for known erasures within selected repair sets and errors at unknown positions outside their union. For pure $(r,δ)$-SSLRCs with overlapping repair sets, we establish the Singleton-type and alphabet-dependent bounds, together with explicit Griesmer, Hamming, and Plotkin bounds. Moreover, we construct nine classes of $\F_q$-linear pure $(r,δ)$-SSLRCs from maximum distance separable (MDS) stabilizer codes, Reed-Solomon (RS) codes, and linear codes with MDS Hermitian hulls, which are simultaneously optimal with respect to several bounds for $(r,δ)$-SSLRCs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22221v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Noise Characterization and Robust Signal Detection in Yeast Pheromone Molecular Communication</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22416.html</link><guid isPermaLink="false">arxiv:2611.22416v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><category>cs.ET</category><description>&lt;p&gt;Nikolaos Ntetsikas, Styliana Kyriakoudi, Antonis Kirmizis, Ioannis Krikidis, Ian F. Akyildiz, Marios Lestas&lt;/p&gt;&lt;p&gt;A critical aspect of Molecular Communications (MC) is the implementation of signal detection policies amidst noise. To date, noise characterizations within the MC field have predominantly drawn from methodologies found in wireless communications literature. In this study, we diverge from existing MC research by utilizing a newly developed experimental platform that employs yeast, allowing us to consider more realistic noise characterizations based on the relevant signaling pathways. We propose suitable signal detection mechanisms tailored to this experimental setup, which focuses on yeast cell-to-cell communications. Our analysis identifies gene transcription as the primary source of noise, and we utilize a Markov birth-death process model with Poisson arrivals and departures to characterize it. The noisy expression of the FUS1 gene is best represented using a mixed Gaussian distribution model. This model serves as a foundation for evaluating the performance of Maximum Likelihood Detection mechanisms in terms of Bit Error Rate (BER) for both symbol-by-symbol and sequence transmission schemes. Error analysis indicates that appropriate adjustments to the signal threshold can reduce errors to as low as 10%, which is not negligible. In contrast, the detection of symbol sequences demonstrates enhanced error performance, achieving error rates as low as 0.4%, albeit at the cost of increased computational complexity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22416v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] On the Kissing Number of Craig&#x27;s Lattice and Spherical List Decoding</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22441.html</link><guid isPermaLink="false">arxiv:2611.22441v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><description>&lt;p&gt;Léo Ducas, Julian Nowakowski, Ailsa Robertson&lt;/p&gt;&lt;p&gt;Craig&amp;#x27;s lattices $A_{p-1}^k$ are a family of lattices with large kissing numbers, i.e., relative to their dimension $n = p-1$, they contain a large number of shortest nonzero vectors. Specifically, for small $k = o(\log p / \log \log p)$, a lower bound of Bacher (2015) shows that $A_{p-1}^k$ has a super-polynomial kissing number of $ω(n^k)$. Craig&amp;#x27;s lattices are therefore attractive candidates for the construction of spherical codes. In this work, we introduce a polynomial-time list decoder for spherical codes obtained from Craig&amp;#x27;s lattices for angular distance below $45^\circ$. Our second main result shows that Bacher&amp;#x27;s lower bound is asymptotically tight for $k = o(\log p / \log \log p)$. Finally, we introduce an efficient algorithm for computing the kissing number of $A_{p-1}^k$. Using this algorithm, we compute their kissing number in dimensions up to 521. Based on this data, we pose the open question whether the kissing number of $A_{p-1}^k$ with $k \approx \sqrt{p}$ grows like $e^{Θ(\sqrt{n})}$ in dimension $n=p-1$. Concurrent work by Laarhoven and Kominers as well as Bennett, Hhan, Li and Stephens-Davidowitz proves such a bound for very closely related lattices.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22441v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Constructions of reversible linear and DNA codes through $T_{D,g}^n-$set and $(n_1,c_1|n_2,c_2)-$right polycyclic codes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22587.html</link><guid isPermaLink="false">arxiv:2611.22587v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><category>math.RA</category><description>&lt;p&gt;Avanish Kumar Chaturvedi, Satyadeep Pandey&lt;/p&gt;&lt;p&gt;In this paper we give a construction technique of $T_{D,g}^n-$set for reversible linear codes and reversible DNA codes with their code parameters. This technique yields many reversible MDS codes which significantly improves the $T^n-$set construction by Oztas et.al. in terms of obtained code parameters. Concatenation-based constructions are presented for reversible linear codes satisfying self-duality and linear complementary dual (LCD) conditions, giving necessary and sufficient condition for desired dual properties. We introduce a new notion of $(n_1,c_1|n_2,c_2)-$ right polycyclic codes. Also, a new construction technique is developed to obtain reversible linear $(n_1,c_1|n_2,c_2)-$ right polycyclic codes with good parameters (MDS codes) over any finite commutative rings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22587v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Hardness and Inapproximability of the Covering Radius for LDPC Codes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22617.html</link><guid isPermaLink="false">arxiv:2611.22617v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><description>&lt;p&gt;Massimo Battaglioni, Fabrizio Marinelli&lt;/p&gt;&lt;p&gt;Given a binary parity-check matrix $H$ and an integer $r$, the covering-radius decision problem asks whether every attainable syndrome can be represented by an error vector of Hamming weight at most $r$. We study this problem for sparse parity-check matrices with bounded row and column weights. Using a bounded-occurrence quantified-SAT reduction, we prove that the problem is $Π_2^{\mathrm P}$-complete for matrices with maximum row and column weight three, and remains $Π_2^{\mathrm P}$-hard under a constant multiplicative gap. Starting from Vertex Cover on 3-regular graphs, we also obtain an explicit NP-hard approximation factor under the same weight constraints. We remark that weight three is the exact threshold for hardness: if either the maximum row weight or the maximum column weight is at most two, the covering radius can be computed in polynomial time.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22617v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Optimal Min-Entropy Estimation with High Probability</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23116.html</link><guid isPermaLink="false">arxiv:2611.23116v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.IT</category><category>math.ST</category><category>quant-ph</category><description>&lt;p&gt;Qisheng Wang&lt;/p&gt;&lt;p&gt;Min-entropy plays a fundamental role in assessing the unpredictability of randomness sources. In particular, NIST SP 800-90B specifies min-entropy estimation as a key procedure for entropy sources used in cryptographic random bit generators, illustrating the practical importance of reliable min-entropy estimation. In this paper, we settle the sample complexity of min-entropy estimation with high probability in both the classical and quantum cases. Specifically, for min-entropy estimation with additive error $\varepsilon$ and probability at least $1-δ$, the sample complexity is $Θ(d\log(d/δ)/\varepsilon^2)$ for classical distributions on $d$ symbols and $Θ((d^2+d\log(1/δ))/\varepsilon^2)$ for quantum states on a $d$-dimensional Hilbert space. Our results admit short and simple proofs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23116v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.LO] Relative computability and definability for nonregular oracles</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22871.html</link><guid isPermaLink="false">arxiv:2611.22871v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.LO</category><description>&lt;p&gt;Yong Liu, Cheng Peng, Mengzhou Sun&lt;/p&gt;&lt;p&gt;Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22871v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Parametric and Universal Thouless Invariants in Matrix Product States</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21744.html</link><guid isPermaLink="false">arxiv:2611.21744v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>cond-mat.str-el</category><category>quant-ph</category><description>&lt;p&gt;Leonardo Goller, Amartya H. Singh, Daniel D. Spiegel, Marco Venuti&lt;/p&gt;&lt;p&gt;We investigate the classification of continuous families of translation-invariant injective matrix product states on an infinite chain, parametrized by a paracompact Hausdorff space $X$ and subject to a compact Hausdorff symmetry $G$. We construct an invariant for phases of such families, valued in $\check{H}^1(X;\widehat{G})$, that generalizes the known $\widehat{G}$ phase invariant for $G$-symmetric Thouless pumps. The phase invariant is constructed as the pullback to $X$ of a single universal Čech cohomology class on a classifying space of $G$-symmetric translation-invariant injective matrix product states. Several examples are given over various parameter spaces where this invariant is nontrivial.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21744v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Existence of a third self-similar solution of the Yang--Mills equation in high even dimensions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21767.html</link><guid isPermaLink="false">arxiv:2611.21767v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;Piotr Bizoń&lt;/p&gt;&lt;p&gt;We prove that the spherically symmetric $SO(d)$ Yang--Mills equation admits a third smooth self-similar profile, in addition to the two known explicit profiles, in every even dimension $d\geq 12$. This complements the analogous existence theorem in odd dimensions $d\geq 11$ (arXiv:2610.36784). In contrast to the odd-dimensional case, where the classification of smooth self-similar profiles reduces to counting roots of an explicit resonance polynomial [Phys. Rev. D 114, 064021 (2026)], the even-dimensional proof requires solving a nonlinear connection problem. In $d=10$, where one explicit profile degenerates to the zero solution, we give a formal argument for the existence of a second nontrivial smooth profile in addition to the single nontrivial explicit one.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21767v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] A refined upper bound on the critical temperature for dilute Bose gases</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21916.html</link><guid isPermaLink="false">arxiv:2611.21916v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;Phan Thành Nam, Toan T. Nguyen, Izabella Stuhl, Yuri Suhov&lt;/p&gt;&lt;p&gt;We establish an upper bound on the critical temperature shift of three-dimensional Bose gases with general nonnegative finite-range interactions. In the dilute regime $aρ^{1/3}\to0$, we prove $T_c(ρ)/T_c^{(0)}(ρ) \le 1 + (C_{\rm H}+o(1))\sqrt{aρ^{1/3}}$, where \[ C_{\rm H}=\frac{2^{7/2}\sqrtπ}{3ζ(3/2)^{2/3}} =3.523992\ldots \] is the coefficient predicted by Huang in 1999. This improves the earlier rigorous upper bound of Seiringer and Ueltschi in 2009. More precisely, we prove the exponential decay of the correlations above the stated temperature through the Feynman--Kac representation, for both integrable and hard-core interactions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21916v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Quantum Born Geometries from Modular Quantization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22041.html</link><guid isPermaLink="false">arxiv:2611.22041v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>gr-qc</category><category>hep-th</category><category>math.OA</category><category>math.SG</category><description>&lt;p&gt;Paolo Bertozzini, Roberto Conti&lt;/p&gt;&lt;p&gt;A structural link between quantization and &amp;quot;thermal-doubled&amp;quot; non-commutative Born geometry (with its split-quaternionic structure) is uncovered via Tomita-Takesaki first-quantized modular theory for complexified and polarized ortho-symplectic spaces. Implications for the modular algebraic quantum gravity program (arXiv:1007.4094) hint at further deep modifications of the notions of space and geometry (thermal quantum space-time hypothesis) waiting to be further explored. Speculative suggestions in the direction of A.Sakharov and L.Boyle-K.Finn-N.Turok CPT-mirror cosmologies will be mentioned, among several others. The present work is based on the manuscript &amp;quot;Modular Quantization and Non-commutative Space-time&amp;quot; (now on alphaXiv) that has been shared, with a selected number of researchers, since end of April 2026.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22041v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Towards the componentwise three-soliton conjecture: cones, collisions, soft momenta and graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22194.html</link><guid isPermaLink="false">arxiv:2611.22194v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;Shi Zhenhua&lt;/p&gt;&lt;p&gt;The componentwise three-soliton conjecture of Part~I states that if an even polynomial $P$ with $P(0)=0$ satisfies Hirota&amp;#x27;s three-soliton condition on a non-hyperplane component of multiplicity one of its dispersion variety, then it satisfies the $N$-soliton condition there for every $N$. We prove restrictions on components carrying this condition and classify the polynomials satisfying it on several families of components, with no degree bound. Restrictions: if the top homogeneous part of the equation of the component has a nonlinear irreducible factor, then $P$ is a multiple of a quadratic form; the order of $P$ at the origin is tied to the multiplicities of the component and of the doubled component; a component through the origin has odd multiplicity; the condition passes to all limits of the rescaled component, and the Newton polygon of a plane component has edges of only ten directions. Classifications: on the cubic graph $v=u^3$, where the four-soliton condition holds exactly in multiplicity one; on the graphs $v=q(u)$ with $°q\ge3$, where $P$ exists only if $q$ is an odd cubic or an odd quintic, so the conjecture holds for all graphs of polynomials; and for three families of Hietarinta&amp;#x27;s list, where each irreducible member is, up to a constant factor, the only such polynomial on its dispersion variety. All three satisfy the $N$-soliton condition for every $N$, so the conjecture holds for them: two belong to the BKP hierarchy, and for Hietarinta&amp;#x27;s quartic equation, known to satisfy it for $N\le4$, we prove it by fusing resonant momenta and counting zeros on its curve. For translated hyperbolas we exclude the one through the origin and all $P$ of degree at most eight. The solutions of multiplicity one on graphs are known bilinear equations; new is that there are no others. The conjecture remains open.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22194v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Small-ball asymptotics of Gaussian matrix products: Open Fermi shells and the Grassmannian</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22414.html</link><guid isPermaLink="false">arxiv:2611.22414v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>hep-th</category><category>math.PR</category><description>&lt;p&gt;Jiahua Tian&lt;/p&gt;&lt;p&gt;Let $P=A_N\cdots A_1$ be a product of independent standard real or complex Gaussian matrices of arbitrary fixed sizes. For complex entries we determine the exact leading terms, of the form $κ\,\varepsilon^C(\log1/\varepsilon)^q$, of the operator-norm and Frobenius small-ball probabilities of $P$, together with the corresponding asymptotics of the Laplace transform of $\|P^2\|_{F}$. The exponent $C$ is the known diversity order, while the logarithmic power follows a filling rule: when fermions are placed on ladders of states determined by the sizes and the last occupied level has degeneracy $μ$ and contains $h$ particles, $q=h(μ-h)$. The determinant of this last shell expands in Plücker coordinates graded by the Schubert cells of the Grassmannian $\mathrm{Gr}(h,μ)$, with leading coefficients proportional to normalized degrees of Schubert varieties. For real entries we prove that the Frobenius small-ball probability has an exact positive leading term of order $\varepsilon^{C/2}(\log1/\varepsilon)^q$ and that the operator-norm probability has the same order, which gives a proof of the known real log canonical threshold and its multiplicity that needs no explicit resolution of singularities. We evaluate the real leading coefficient in closed form for every shell with at most one logarithm, a class that contains all products of two factors, and we conjecture its general form, which agrees with the classical constant of vector chains. Applications include the outage probability of cascaded multi-antenna channels at high signal-to-noise ratio and the Bayesian evidence of deep linear networks.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22414v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Extended Hamiltonian formalism for multicontact field theories</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22783.html</link><guid isPermaLink="false">arxiv:2611.22783v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;Manuel de León, Rubén Izquierdo-López, Xavier Rivas, Narciso Román-Roy, Annamaria Villanova&lt;/p&gt;&lt;p&gt;We develop an extended Hamiltonian formalism for action-dependent (Herglotz-type) classical field theories within the framework of multicontact geometry. While the standard Hamiltonian description of these theories is formulated on the restricted multimomentum bundle, we work instead on the extended multimomentum bundle, which carries an additional energy-type coordinate together with a canonical multicontact structure. In this setting, an extended Hamiltonian multicontact system is governed by a Hamiltonian density and its associated Hamiltonian one-form, and the submanifold they determine recovers the restricted formalism. We characterise the admissible one-forms and prove that the associated Hamilton-de Donder-Weyl field equations, stated equivalently for sections, multivector fields, and Ehresmann connections, are mutually equivalent. We then establish the precise relation between the extended and restricted formalisms in both the regular (multicontact) and the almost-regular (premulticontact) settings, the latter requiring a constraint algorithm. The formalism is illustrated with two examples: the action-dependent Klein-Gordon equation, which includes the telegrapher equation as a particular case, and the heat equation, whose contactification yields Burgers&amp;#x27; equation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22783v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Exact Inversion of Relaxation from Rheometer Measurement Data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22917.html</link><guid isPermaLink="false">arxiv:2611.22917v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;Yu Jiang, Takayuki Kurokawa, Ching-Lung Lin, Gen Nakamura&lt;/p&gt;&lt;p&gt;A rheometer is commonly used to measure the input-output relation for analyzing the relaxation of stress for rheological materials. Here, the input is a time-harmonic torque and the output is the angular displacement. This paper aims to propose an exact inversion scheme of the relaxation function from two input-output relations only having different moments of inertia. The relaxation function is represented by a Prony&amp;#x27;s series of known number of terms, with a positive constant term and terms with distinct relaxation times. The augmented system relates the material parameters to its characteristic roots. These roots are the poles of the transfer function. Here the transfer function is the Laplace transform of the output divided by that of the input, and it is a rational function in the Laplace variable. The poles of the transfer function are recovered using Pade&amp;#x27;s approximation. By measuring two input-output relations only having different moments of inertia, we can rigorously recover the relaxation function. Thus, we note a clear link between the characteristic roots and the poles. Numerical experiments reconstruct the relaxation function from synthetic angular displacements corresponding to two given moments of inertia based on our inversion method. The results show the effect of measurement noise on the recovered characteristic roots and relaxation function.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22917v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Sobolev theory for the inverse problem of time-dependent density functional theory on the torus</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22942.html</link><guid isPermaLink="false">arxiv:2611.22942v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>cond-mat.mtrl-sci</category><category>math.AP</category><category>physics.chem-ph</category><description>&lt;p&gt;Asbjørn Bækgaard Lauritsen, Mathieu Lewin, Jakob Oldenburg&lt;/p&gt;&lt;p&gt;We show that, given a sufficiently regular time-dependent density, there exists a unique potential such that the Schrödinger equation with this external potential has the prescribed one-particle density. We treat densities that are twice differentiable in time and of finite Sobolev regularity in space; the resulting potentials are continuous in time and of finite Sobolev regularity in space. Our method of proof is to rewrite the problem as a nonlinear Schrödinger equation with a loss of derivatives, which we in turn handle with a completion-of-the-square argument. This is a refinement of our recent work [Lauritsen, Lewin, and Oldenburg, arXiv:2609.08984], which handled this loss of derivatives using the Cauchy-Kovalevskaya theorem and treated analytic-in-space densities and potentials.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22942v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Comment on &quot;The eigenvalues and eigenfunctions of the toroidal dipole operator&#x27;</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23006.html</link><guid isPermaLink="false">arxiv:2611.23006v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><description>&lt;p&gt;G. Vaman&lt;/p&gt;&lt;p&gt;We show here that the spectrum of the operator $\hat{T}_3^{(θ)}$ studied by Anghel and Dolineanu (Phys. Scr. {\bf 98} (2023) 015223) is continuous, not discrete, contrary to what is claimed by the authors of the paper to which this comment refers. Consequently, there is no splitting of the energy levels corresponding to this operator that could be observed experimentally.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23006v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] On the $φ^4_2$ theory on $\mathbb R\times S$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23032.html</link><guid isPermaLink="false">arxiv:2611.23032v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>math.PR</category><description>&lt;p&gt;Azam Jahandideh&lt;/p&gt;&lt;p&gt;We present a construction of the Euclidean two-dimensional $φ^4$ quantum field theory model on $\mathbb R\times S$ using parabolic stochastic quantization and discuss the Osterwalder-Schrader axioms. Motivated by one-loop string scattering amplitudes, we first construct finite-volume measures on a family of tori with varying geometry. To construct an infinite-volume measure on the cylinder, we establish uniform renormalization and stochastic estimates as the complex structure varies, including the degenerating regime in which the torus approaches an infinite cylinder.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23032v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Unique continuation for the Pauli-Fierz Hamiltonian</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23062.html</link><guid isPermaLink="false">arxiv:2611.23062v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>cond-mat.stat-mech</category><category>math.AP</category><category>quant-ph</category><description>&lt;p&gt;Mihály A. Csirik&lt;/p&gt;&lt;p&gt;We prove a unique continuation property for eigenstates of the Pauli-Fierz Hamiltonian, viewed as functions of the electron configuration with values in the spin-photon space. The vector potential may lie in $L^6_\mathrm{loc}$, with its divergence, curl, and the scalar potential in $L^p_\mathrm{loc}$ for some $p&amp;gt;2$. As an application, we prove a Hohenberg-Kohn theorem at positive coupling strength: the spin-summed ground-state density and combined current density determine the external potentials up to a gauge transformation and an additive constant.&lt;/p&gt;&lt;p&gt;code https://github.com/xyzw/pf_ucp (Lean project: lean/lakefile.toml, lean/lean-toolchain; build: builds, no sorry at commit 410eddc with leanprover/lean4:v4.34.0-rc2, checked 2026-11-18)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23062v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] The Infinitesimal Covariant Stone-von Neumann Theorem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23086.html</link><guid isPermaLink="false">arxiv:2611.23086v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>math.OA</category><description>&lt;p&gt;Leonard Huang, Lara Ismert&lt;/p&gt;&lt;p&gt;In a previous paper, the authors established the Covariant Stone-von Neumann Theorem, which generalizes the Stone-von Neumann Theorem in quantum mechanics and yields a classification of all unitary Heisenberg representations of an abelian elementary $ C^{\ast} $-dynamical system up to unitary equivalence. In this sequel to that paper, we establish an infinitesimal version of the Covariant Stone-von Neumann Theorem in the setting of real elementary $ C^{\ast} $-dynamical systems. Firstly, we generalize Stone&amp;#x27;s Theorem to secure a one-to-one correspondence between the strongly continuous one-parameter unitary groups and the regular self-adjoint densely defined operators on a Hilbert $ C^{\ast} $-module. Secondly, we define the infinitesimal Heisenberg representations and the infinitesimal Schrödinger representation of a real $ C^{\ast} $-dynamical system. Thirdly, we construct a one-to-one correspondence between the unitary Heisenberg representation and the infinitesimal Heisenberg representations of a real $ C^{\ast} $-dynamical system, providing a rigorous two-way passage--which we call ``Heisenberg differentiability-integrability&amp;#x27;&amp;#x27;--between the global unitary formulation of Heisenberg covariance and its infinitesimal formulation in terms of regular self-adjoint densely defined operators. This allows us to prove the Infinitesimal Covariant Stone-von Neumann Theorem: For a real elementary $ C^{\ast} $-dynamical system, every infinitesimal Heisenberg representation is a direct sum of copies of the infinitesimal Schrödinger representation. Lastly, we obtain explicit descriptions of the position and momentum operators for a real $ C^{\ast} $-dynamical system and construct a natural common invariant core of analytic vectors for them. All requisite technical domain and integrability issues are fully accounted for.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23086v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Zero mode surface of Hermitian two-by-two matrices</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23087.html</link><guid isPermaLink="false">arxiv:2611.23087v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math-ph</category><category>hep-th</category><description>&lt;p&gt;Andreas Sykora&lt;/p&gt;&lt;p&gt;We classify the zero mode surfaces, also called Clifford spectra, of Hermitian $2\times 2$ matrices. Using the covariance of the Dirac operator under the Euclidean group and its invariance under unitary conjugation, together with a singular value decomposition, every $m$-tuple of Hermitian $2\times 2$ matrices, after adjoining zero matrices if $m&amp;lt;3$, is reduced to the normal form $(b_1σ_1,b_2σ_2,b_3σ_3,0,\dots,0)$ with $b_1\geq b_2\geq b_3\geq 0$. Since adding a vanishing matrix only embeds the Clifford spectrum into a higher-dimensional space, it suffices to consider three matrices. In this normal form the determinant of the Dirac operator is given in closed form and its critical points are determined explicitly. The zero mode surface consists of one or two points if $b_3=0$. Otherwise it consists of two disjoint topological spheres if $b_1&amp;gt;b_2+b_3$, of two topological spheres touching at one point if $b_1=b_2+b_3$, and of a single topological sphere if $b_1&amp;lt;b_2+b_3$. The topology is thus governed by the triangle inequality for $(b_1,b_2,b_3)$, which can be interpreted with Heron&amp;#x27;s formula. In particular, the Clifford spectrum of any tuple of Hermitian $2\times 2$ matrices is never empty.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23087v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] A Sharp Perimeter Inequality for Mean Distances on Convex Curves</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21661.html</link><guid isPermaLink="false">arxiv:2611.21661v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>math.FA</category><category>math.PR</category><description>&lt;p&gt;Eric Shen&lt;/p&gt;&lt;p&gt;For a planar convex body $K$, let $θ(K)$ denote the expected Euclidean distance between two independent points uniformly distributed on $\partial K$ with respect to arclength. We prove the sharp inequality $$\frac{θ(K)}{\operatorname{per}K}&amp;gt;\frac{1}{6}.$$ The constant is approached by rectangles degenerating to a segment.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21661v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] A Universal $8$-Vertex Origami Torus Triangulation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21909.html</link><guid isPermaLink="false">arxiv:2611.21909v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><description>&lt;p&gt;Peter Doyle, Fabian Lander, Richard Evan Schwartz, Steve Trettel&lt;/p&gt;&lt;p&gt;An origami torus is a piecewise affine isometric embedding of a flat torus into $\R^3$. We prove that every flat torus is realized as an $8$-vertex origami torus based on the triangulation with degree sequence $4,6,6,6,6,6,7,7$. This provides an $8$-vertex universal triangulation for origami tori.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21909v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] Three Circles in a Unit Disk: Three Solutions to an Extremal Problem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22121.html</link><guid isPermaLink="false">arxiv:2611.22121v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><description>&lt;p&gt;Anatoly Eydelzon&lt;/p&gt;&lt;p&gt;We place two disks inside the unit disk so that they touch each other and the unit circle. We then insert a disk of the largest possible radius, requiring it to touch both original disks. We show that the smallest possible sum of the three areas is $11π/18$, and find all equality cases. We give three solutions, using Descartes&amp;#x27; circle theorem, inversion, and contact-point coordinates. The main difficulty is checking that the third disk is largest among all disks that fit, not only among disks touching the first two.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22121v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] Continuous improved Hölder and reverse Hölder inequalities for Gaussian random vectors</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22143.html</link><guid isPermaLink="false">arxiv:2611.22143v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>math.FA</category><category>math.PR</category><description>&lt;p&gt;Ai-Jun Li, Qingzhong Huang&lt;/p&gt;&lt;p&gt;We establish continuous versions of the improved Hölder and reverse Hölder inequalities for correlated Gaussian random vectors, where a finite covariance matrix is replaced by a covariance operator acting on a Hilbert space of parameter fields. Under operator comparisons between the covariance and the exponent multiplier, we prove both inequalities and characterize equality in terms of a compatible probability density on the underlying Gaussian space. We further describe this density as a product of independent factors on common eigenspaces and a Gaussian factor whose mean and covariance satisfy explicit algebraic conditions. In the reverse setting, positive and negative exponents may coexist. The continuous product is defined by ordered truncation, allowing zeros in the positive-exponent factors. The equality proof combines an exact Ornstein--Uhlenbeck semigroup comparison, a spectral gap away from the kernel of the governing operator difference, and characteristic-function deconvolution. We also treat exponential quadratic functions without requiring a uniform positive-definiteness margin on the precision matrices.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22143v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] On Contractibility of Geometric Joins</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22182.html</link><guid isPermaLink="false">arxiv:2611.22182v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>math.CO</category><description>&lt;p&gt;Dohyeon Lee&lt;/p&gt;&lt;p&gt;The geometric join of a family of sets in $\mathbb R^d$ is the union of the convex hulls of all colorful sets. For every $d \geq 4$, we construct $\lceil\frac{(d-1)^2}{2}\rceil$ sets in $\mathbb R^d$ whose geometric join is not contractible, disproving the conjecture of Bárány, Holmsen, and Karasev that the geometric join of at least $d+1$ sets is contractible.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22182v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] On the volume growth assumption in the Eulerian definition of RCD spaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22383.html</link><guid isPermaLink="false">arxiv:2611.22383v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><description>&lt;p&gt;Marco Picerni&lt;/p&gt;&lt;p&gt;We prove that every infinitesimally Hilbertian metric measure space whose reference measure is a Radon measure, and which satisfies the Sobolev-to-Lipschitz property and the weak Bochner inequality with a lower Ricci bound, has Gaussian volume growth; in particular, balls have finite measure. Hence, in the Eulerian definition of $\mathsf{RCD}(K,\infty)$ spaces, both the volume growth assumption and the finiteness of the measure of balls are redundant. The proof combines the self-improvement of the Bakry--Émery gradient estimate, obtained without using the conservation of mass of the heat flow, with a dimension-free Harnack inequality derived from the Sobolev-to-Lipschitz property.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22383v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] Sharp Gaussian Brunn-Minkowski inequalities</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22749.html</link><guid isPermaLink="false">arxiv:2611.22749v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>math.FA</category><category>math.PR</category><description>&lt;p&gt;Bader Ammari&lt;/p&gt;&lt;p&gt;We prove Gaussian Brunn-Minkowski inequalities for multiple sets. These are of the type: $$\prod_{i=1}^I γ_{Σ_i}(K_i)^{\tilde λ_i} \le C_{\text{sharp}}γ_Γ\Big(\sum_{i=1}^I λ_i K_i\Big),$$ with convex sets $K_i \subset \mathbb{R}^n$, whose barycenter $b_{K_i,Σ_i}$ with respect to the Gaussian measure $γ_{Σ_i}$ is zero, where $λ_i, \tilde λ_i \in (0;1)$ such that $\sum_{i=1}^I λ_i=\sum_{i=1}^I \tilde λ_i=1.$ In addition, we provide natural conditions on the matrices $Γ, Σ_1,\cdots,Σ_I \in \mathrm{Sym}_{&amp;gt;0}(n)$, which are given through a pointwise inequality involving the Karcher mean. Furthermore, we study equality cases of the corresponding functional forms in such situations. We also investigate the role of centering in the (B)-property by giving a counterexample for convex bodies with zero Lebesgue barycenters in dimensions at least three and thereby answering negatively a question of Faifman-Polterovich in \cite{Faifman_Polt}. Finally, a new slicing approach is introduced, which allows us to pass from centered convex sets to sets with arbitrary barycenters such that their weighted sum is convex. Based on this idea, we show a new Gaussian Brunn-Minkowski inequality $$e^{|\sum_{i=1}^I λ_i b_{K_i,I_n}|^2/2n} γ_n \Big(\sum_{i=1}^I λ_i K_i \Big)^{1/n} \ge \sum_{i=1}^I λ_i e^{|b_{K_i,I_n}|^2/2n} γ_n(K_i)^{1/n},$$ and consider a further application in the direction of the Gaussian correlation inequality, together with the rigidity for both inequalities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22749v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] Banchoff Curvature and Realisation Moduli of Piecewise-Affine Arrangement Immersions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22976.html</link><guid isPermaLink="false">arxiv:2611.22976v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>math.DG</category><description>&lt;p&gt;William Nelson&lt;/p&gt;&lt;p&gt;We compute the curvature concentrated on the flats of a piecewise-affine immersion of $\mathbb{R}^D$ into $\mathbb{R}^n$ creased along an affine hyperplane arrangement, and parametrise the immersions sharing its chamber metrics. Suppose every transverse crease cone is embedded (the positive-path-rank condition). Then the Gauss-Bonnet-Chern density of any convex coordinate-wise smoothing that is affine outside a compact transition zone reduces, on each transverse slice, to a Hafnian. This Hafnian integrates to Banchoff&amp;#x27;s critical-point curvature on each even-codimension flat. The curvature coincides with the Cheeger-Müller-Schrader density and equals an alternating sum of Gaussian orthant probabilities determined by Schur complements of the incident chamber metrics. In even dimension, under mild non-degeneracy, total vertex curvature equals the recession curvature at infinity and is unchanged when the walls are translated, even across multi-wall collisions. Under generic codimension-two intersections, realisations with prescribed chamber metrics form a compact rank-constrained spectrahedron of generic local dimension $\max(0,H-r(r+1)/2)$, where $r = \max(0,D+H-n)$. At minimal target dimension the given immersion is the unique realisation preserving orientation across each single wall, and a positive semidefinite stress matrix certifies universal rigidity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22976v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MG] First Order Geometry of Equilateral Small Polygons</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23066.html</link><guid isPermaLink="false">arxiv:2611.23066v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.MG</category><category>cs.CG</category><description>&lt;p&gt;José Ayala Hoffmann, Tomás Ayala Coppola&lt;/p&gt;&lt;p&gt;We develop a first order calculus based on the geometry of realised diameter graphs for perimeter maximisation among convex equilateral small polygons. Polygon side equalities and active diameter constraints define a linearised feasible cone and an associated equality space. We prove that an equilateral small polygon is a strict local maximiser of perimeter modulo Euclidean motions if a multiplier balance holds with strictly positive active diameter multipliers and the active equality space consists only of infinitesimal Euclidean motions. The proof uses a local Euclidean slice and a geometric limiting argument and requires neither independence of the active constraint gradients nor second order information. As an application, we combine our criterion with validated interval arithmetic to establish strict local maximality for Bingane and Audet&amp;#x27;s polygons $A_{16}$, $A_{32}$, $A_{64}$ and for reconstructions of their polygons $Z_{32}$ and $Z_{64}$. For each $n\in\{32,64\}$, the perimeter of $Z_n$ is strictly larger than that of $A_n$. Thus, strict local maximisers with different perimeters coexist in the space of convex equilateral small polygons with the same number of sides.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23066v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] The injectivity of the Kudla--Millson lift on unitary Shimura varieties</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21692.html</link><guid isPermaLink="false">arxiv:2611.21692v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.AG</category><description>&lt;p&gt;Hanyu Yao&lt;/p&gt;&lt;p&gt;We prove the injectivity of the Kudla--Millson lift on unitary Shimura varieties over imaginary quadratic fields under some lattice hypotheses. We express integrals of the lift over special cycles as special values of Dirichlet series and deduce injectivity by separating the Fourier coefficients of the cusp forms. We also establish a converse theorem for Borcherds products on $\mathrm{U}(n,1)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21692v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Bounded functions on the character variety for quadratic extensions of $\mathbb{Q}_p$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21796.html</link><guid isPermaLink="false">arxiv:2611.21796v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.AG</category><description>&lt;p&gt;Laurent Berger, Johannes Sprang, Rustam Steingart&lt;/p&gt;&lt;p&gt;For any finite extension $L$ of $\mathbb{Q}_p$, Schneider--Teitelbaum defined and studied the character variety in $p$-adic Fourier theory. It is a rigid analytic curve over $L$ that parameterizes the set of locally $L$-analytic characters of $o_L$. It is conjectured that all bounded functions on the character variety of Schneider--Teitelbaum come from $p$-adic measures. We prove this conjecture for all quadratic extensions $L/\mathbb{Q}_p$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21796v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] A local-local principle for quadratic forms over semiglobal fields</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21870.html</link><guid isPermaLink="false">arxiv:2611.21870v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.AG</category><description>&lt;p&gt;Karim Johannes Becher, David Grimm, Parul Gupta&lt;/p&gt;&lt;p&gt;Given a quadratic form over a semiglobal field, the set of discrete valuations on the field for which the form is anisotropic over the completion is either empty, or it contains a valuation extending that of the base field with a transcendental residue field extension. In dimension at least $3$, this gives a refinement of the local-global principle for isotropy. In dimension $2$, the result yields a description of the set of elements that are locally squares everywhere.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21870v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Klarner&#x27;s sequences have density $0$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22034.html</link><guid isPermaLink="false">arxiv:2611.22034v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.DS</category><description>&lt;p&gt;Alexander Kalmynin&lt;/p&gt;&lt;p&gt;We prove that the set of non-negative integers $n$ which can be obtained from $0$ by repeated application of affine maps $x\mapsto 2x$, $x\mapsto 3x+2$ and $x\mapsto 6x+3$ has density $0$. Moreover, we reach the same conclusion for five other sequences of similar type introduced by D. Klarner. More generally, we establish a criterion excluding stationary measures with bounded density on the profinite group $\mathbb Z_P\cong\prod_{p\mid P}\mathbb Z_p$. A density-to-measure construction using invariant Banach limits and a combinatorial argument involving rational orbits and affine words yield our density-zero results. The criterion also applies to an infinite family of mixed-slope affine semigroups.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22034v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] $L^p$-norms of holomorphic cusp forms</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22226.html</link><guid isPermaLink="false">arxiv:2611.22226v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><description>&lt;p&gt;Xiaolong Han, Bingrong Huang&lt;/p&gt;&lt;p&gt;We determine the optimal orders of local and global $L^p$-norms of $L^2$-normalized holomorphic cusp forms of large weight on the modular surface, for fixed $2&amp;lt;p\leq\infty$. Both orders are attained by peak forms. For normalized Poincaré series of weight $k$ and index $m$, we obtain an asymptotic formula with an explicit constant, uniformly for $1\leq m\leq c_0k$ with any fixed $c_0&amp;lt;(4π)^{-1}$. We also give sup norm bounds in a wider range of indices.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22226v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] A Little Advice Suffices: Diffie-Hellman Is as Hard as Discrete Logarithm</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22290.html</link><guid isPermaLink="false">arxiv:2611.22290v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>cs.CR</category><description>&lt;p&gt;Yuwen Zhou&lt;/p&gt;&lt;p&gt;Is computing a Diffie-Hellman key as hard as computing a discrete logarithm? Maurer showed that it is, given a few bits of advice, provided that short intervals contain enough integers with only small prime factors; that proviso has stood for thirty years. We remove it. For every prime $p$ there is an advice string of $O(\log p)$ bits, depending only on $p$, with which discrete logarithms in every group of order $p$ are computed in polynomial time from a Diffie-Hellman oracle. The reduction is the classical one; what was missing was a proof that short intervals contain polylogarithmically smooth integers. We show that a zero-free half-plane for the Riemann zeta function, which is now known, gives the expected number of $(\log x)^K$-smooth integers in every interval $[x,x+x^θ]$ with $θ&amp;gt;17/30$. With smoothness this small the saddle point of the counting integral lies just to the left of the line $\mathrm{Re}\,s=1$, and a zero-free strip of any fixed width absorbs the shift once $K$ is large. Genus-2 Jacobians, whose orders fill such intervals, then turn one of these integers into the order of an auxiliary group. The same input removes the smoothness assumption from Maurer and Raub&amp;#x27;s impossibility of field-homomorphic one-way permutations and from the yes/no-query reduction of Koblitz, Menezes and Shparlinski. It also makes Wolf&amp;#x27;s characterisation unconditional: discrete logarithm and Diffie-Hellman are generically equivalent exactly when the group order has no large repeated prime factor.&lt;/p&gt;&lt;p&gt;code https://github.com/OctopusTide/hyperelliptic-curve-method (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22290v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Abelian varieties with homotheties</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22466.html</link><guid isPermaLink="false">arxiv:2611.22466v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><description>&lt;p&gt;Félix Baril Boudreau, Sebastian Petersen&lt;/p&gt;&lt;p&gt;In 1980, Bogomolov proved that the $\ell$-adic Galois image of an Abelian variety over a number field contains an open subgroup of the homotheties. In 1986, Serre refined that result, showing that the homotheties coming from the Galois side were uniformly bounded in $\ell$ inside the homotheties of the codomain of the representation. In a 2007 paper, Zarhin shows that Bogomolov&amp;#x27;s conclusion can fail in non-trivial cases for global function fields. We prove a suitable analogue of Serre&amp;#x27;s results over finitely generated fields of positive characteristic. As a consequence, we prove a new case of the 1978 conjecture by Geyer and Jarden.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22466v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] The totient bound and extremal gaps in cyclotomic polynomials</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22795.html</link><guid isPermaLink="false">arxiv:2611.22795v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><description>&lt;p&gt;Qi-Yang Zheng&lt;/p&gt;&lt;p&gt;Let $m&amp;gt;1$ be odd and squarefree, and let $p\nmid m$ be prime. If $p&amp;lt;m$, every gap in $Φ_{mp}$ has length strictly less than $\varphi(m)$. If $p&amp;gt;m$, the maximum gap has length $\varphi(m)$ and occurs exactly $2\lfloor p/m\rfloor$ times. We determine its positions and endpoint coefficients. These results prove the equality criterion of Ambrosino, Hong and Lee and the multiplicity formula of Zhang. We also treat repeated prime factors, even cofactors and extremal zero runs in periodic coefficient blocks.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22795v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Tilings of integer sets of prime-power cardinality</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22849.html</link><guid isPermaLink="false">arxiv:2611.22849v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.CO</category><description>&lt;p&gt;Wenchuan Hu, Chao Wang, Erxiao Wang, Fuhai Zhu&lt;/p&gt;&lt;p&gt;Let $A$ be a finite integer tile of cardinality $p^k$, where $p$ is prime and $k\geq1$. We first determine all possible fundamental periods of tilings of $A$. A cyclotomic argument gives a common period $PD$, where $P$ is a power of $p$ and $D$ is a greatest common divisor of normalized differences in $A$. Each $Pd$ with $d\mid D$ occurs as a fundamental period. At modulus $Pd$, a chain of greatest common divisors controls the compatibility of the Chinese remainder fibres. This yields independent digit functions and exact counts of the tilings. For tilings of fundamental period $Pd$, we classify their partitions into translates modulo $Pd$ and count the tilings that induce each partition. The same arithmetic data classify tiles with identical tiling families. Each class has a unique normalized tile of minimum diameter whose mask polynomial divides the masks of all normalized tiles in the class.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22849v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Invariant flags and integral matrices with prescribed characteristic polynomial</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23031.html</link><guid isPermaLink="false">arxiv:2611.23031v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><description>&lt;p&gt;Caihua Luo, Xu Song, Yilin Zeng&lt;/p&gt;&lt;p&gt;We give an asymptotic formula for integral matrices with a prescribed characteristic polynomial in an expanding entry box over a number field. For cyclic matrices, normalized logarithmic covolumes of a primary invariant flag become uniform on a permutohedral chamber. Their joint distribution with the rescaled matrix factors for tests invariant under reflections at the real places. Separating irreducible factors of multiplicities \(e_i\) into distinct translates multiplies the leading coefficient by \(\prod_i e_i!\). We also bound every noncyclic rational type.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23031v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] $\ell^p$-Improving for Discrete Fractional Integrals and Averages on the Moment Curve</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23137.html</link><guid isPermaLink="false">arxiv:2611.23137v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><category>math.CA</category><description>&lt;p&gt;Jacob Glidewell&lt;/p&gt;&lt;p&gt;We prove the $\ell^p$-improving estimates in the full range for discrete fractional integral operators on the moment curve (except at the endpoint) and discrete averages on the moment curve (with $N^ε$-losses). This follows via essentially sharp Diophantine solution counting estimates for inhomogeneous Vinogradov systems with an odd number of variables.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23137v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NT] Congruence Patterns in Spectral Gaps of mod $p$ Markoff Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23168.html</link><guid isPermaLink="false">arxiv:2611.23168v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NT</category><description>&lt;p&gt;Yosef Berman, Nathaniel Kingsbury-Neuschotz&lt;/p&gt;&lt;p&gt;We establish lower bounds on the second-largest eigenvalue of mod $p$ Markoff graphs for three infinite, positive-density families of primes $p$, each defined by congruence conditions. These lower bounds arise from the structure of integral orbits on Markoff-type surfaces over certain number fields, and are strong enough to establish that $$\liminf_{\substack{p\rightarrow\infty\\p\equiv1\pmod{4}}}λ_2(\Mar^*(\F_p)) &amp;gt; 2.875&amp;gt; 2\sqrt{2},$$ partially proving a conjecture of de Courcy-Ireland and Lee, and that $$\limsup_{\substack{p\rightarrow\infty\\p\equiv 3\pmod{4}}}(λ_2(\Mar^*(\F_p)) &amp;gt; 2.835 &amp;gt; 2\sqrt{2},$$ disproving another conjecture of the same.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23168v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Direct Element-Level Mass Matrix Inversion</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21820.html</link><guid isPermaLink="false">arxiv:2611.21820v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Eli Hanukah&lt;/p&gt;&lt;p&gt;Explicit finite element methods for transient solid dynamics commonly use lumped mass matrices to avoid solving systems of equations for nodal accelerations at each time step. However, diagonal mass matrices may inadequately represent inertia, particularly for higher-order elements and coarse or distorted meshes. This has limited the use of higher-order elements in explicit dynamic analyses. This paper presents a systematic method for directly evaluating the inverse of non-diagonal element-level mass matrices for solid isoparametric elements of arbitrary interpolation order. The method applies to mixed mass matrices defined as linear combinations of lumped and consistent mass matrices, with a weighting parameter controlling the transition between diagonal, consistent, and intermediate formulations. It therefore provides a framework for incorporating non-diagonal mass formulations, including those for quadratic elements, into explicit finite element algorithms. The approach is demonstrated by deriving an explicit inverse formula for the mixed mass matrix of the eight-node hexahedral element. This formula enables efficient element-level inversion without solving a global system. The proposed method can improve inertial representation in transient dynamic analyses while retaining the computational advantages of explicit time integration and is suitable for element-by-element implementations.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21820v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Forests of Omnitrees: Analysis and Applications to Anisotropic Space--Time Finite Elements</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21836.html</link><guid isPermaLink="false">arxiv:2611.21836v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Nils Margenberg&lt;/p&gt;&lt;p&gt;We prove output-optimal work bounds for omnitree forests, which bisect cells along selected axes. A canonical descriptor characterizes representable partitions independently of split order. Complete one-level cycles, including coarsening, face balance and selected coarse meshes, take sequential work proportional to stored input and output at fixed dimension and key width, with polynomial depth dependence even for unbalanced input. From balanced input, refinement-only balance stays within each request&amp;#x27;s coordinate slab; this bound is attained. Polynomial trace equations characterize conforming high-order spaces across crossed face partitions. Reconstruction moments bound interpolation errors and capture the logarithmic loss that bilinear nodal interpolation can suffer on balanced meshes. Elements of degree up to four resolve moving heat layers on unstructured 4D space-time and 5D space-time-parameter meshes. Multigrid uses the generated hierarchies.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21836v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Beyond the error horizon: averaged quantile Kaczmarz methods for corrupted and noisy linear systems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21926.html</link><guid isPermaLink="false">arxiv:2611.21926v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Sofiia Shvaiko, Elizaveta Rebrova&lt;/p&gt;&lt;p&gt;Linear systems and least-squares problems can contain measurement errors of different scales: a few measurements may be highly unreliable, while small noise affects every measurement. Residual-based iterative filtering can remove the influence of sparse corruption, but its accuracy is limited by a noise-dependent error horizon. We study how averaging and relaxation reduce this horizon in averaged quantile randomized Kaczmarz (AQRK), which filters equations by residual quantiles and averages a batch of single-row updates. Filtering, however, introduces an update bias that averaging alone cannot remove. We show that re-querying the accepted equations can remove this bias, and when the corruption is sparse enough relative to the conditioning of the matrix and large enough relative to the noise, we prove that AQRK with re-queried residuals reduces the horizon as averaging does without the corruption: its error decays to a horizon proportional to $\sqrt{α/s}$, where $α$ is the stepsize and $s$ the update batch size. Further, decreasing stepsizes or increasing batches gives convergence to the solution of the clean system. Numerical experiments support the theory and examine settings beyond it, including noise that cannot be re-queried and the corrupted low-rank tensor fitting problem. In the latter, AQRK inner solves succeed where standard alternating least-squares solvers and single-row robust updates fail.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21926v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Convergence of discrete exterior calculus for the Hodge-Dirac and Hodge-Laplace problems on surfaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21960.html</link><guid isPermaLink="false">arxiv:2611.21960v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Thomas A. Wasserman&lt;/p&gt;&lt;p&gt;We prove that discrete exterior calculus converges for the Hodge-Dirac and Hodge-Laplace problems on every closed oriented Riemannian surface. The proof applies the error bounds of a companion paper on finite element exterior calculus. We prove and use that every closed oriented surface, with any metric, carries uniformly regular families of triangulations that are acute with a uniform margin.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21960v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] High-Order Regularization for Singular and Nearly Singular Laplace and Stokes Layer Potentials in Two Dimensions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21991.html</link><guid isPermaLink="false">arxiv:2611.21991v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>physics.comp-ph</category><description>&lt;p&gt;Han Zhou&lt;/p&gt;&lt;p&gt;Layer potentials represent the solutions of many elliptic boundary value problems, but their kernels have the singularity of the fundamental solution, so standard quadrature loses accuracy at targets on or near the boundary. In two dimensions, Gaussian regularization of the logarithmic kernel gives a smooth kernel involving the exponential integral $E_1$, but for the single layer its regularization error is only first order in the smoothing radius $δ$. We construct modified kernels for two-dimensional Laplace and Stokes single- and double-layer potentials that achieve regularization error $O(δ^p)$, $p=3,5,7$, uniformly for targets on and near the curve. The resulting method is both high-order accurate and easy to implement: the integrals are evaluated directly by the periodic trapezoidal rule on a single fixed set of boundary nodes for all targets. Choosing $δ=c h^q$ with $q&amp;lt;1$, where $h$ is the node spacing, keeps the discretization error smaller than the regularization error as $h\to0$, and numerical experiments confirm the predicted $O(h^{pq})$ convergence. Finally, we combine the near-curve evaluation with a fast Poisson solver to compute the potentials on the entire Cartesian grid.&lt;/p&gt;&lt;p&gt;code https://github.com/han-zhou-math/high-order-reg-2d (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21991v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] A nonlinear multigrid method for the preconditioned lattice Boltzmann equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22063.html</link><guid isPermaLink="false">arxiv:2611.22063v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Xingzhou Ji, Li-Shi Luo&lt;/p&gt;&lt;p&gt;This work developed a preconditioned lattice Boltzmann equation (PLBE) smoother for the residual-driven full approximation scheme (FAS) multigrid to accelerate steady-state LBE calculations. To overcome the deterioration of LBE smoothing at low viscosity, we used a two- relaxation-time (TRT) collision model together with characteristic-velocity and kinetic precondition- ing to keep the relaxation frequency for the even-order moments within a favorable range, while independently selecting the relaxation frequency for the odd-order moments to reduce their local amplification factor. We further investigated F-, W-, and hybrid V/W-cycles to address residual stagnation observed with V-cycles at high Reynolds numbers. The 2D lid-driven cavity flow was used as a test case. At Re = 5000, TRT-PLBE-FAS achieves an approximately 27-fold speedup over single-grid TRT-PLBE. At Re = 20000 on a 20482 grid, the hybrid V/W-cycle reduces solution time by 14% compared with the W-cycle.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22063v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Finite volume neural networks for singularly perturbed boundary value problems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22066.html</link><guid isPermaLink="false">arxiv:2611.22066v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Gung-Min Gie, Junghwa Kim&lt;/p&gt;&lt;p&gt;We develop a singular-layer enhanced Finite Volume Neural Network (sl-FVNN) methodology for solving singularly perturbed boundary value problems. The proposed framework combines flux-conserving finite volume residuals with analytically derived boundary layer correctors, enabling stable and efficient approximation of sharp boundary variations induced by small perturbation parameters. Numerical experiments over a broad range of small perturbation parameters ($10^{-4}$ to $10^{-12}$), demonstrate that the sl-FVNN yields uniformly accurate predicted solutions and significantly improved convergence behavior compared to conventional FVNN methods. Further comparisons with sl-PINNs from (Gie, Hong, Jung, Appl. Anal. 2024) show that our sl-FVNNs attain comparable accuracy for reaction--diffusion and Burgers equations, while achieving significantly improved convergence for convection-dominated nonlinear problems. These results highlight the effectiveness of incorporating asymptotic layer structures into finite volume based neural networks, offering a practical and scalable framework for multiscale PDE learning in stiff regimes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22066v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Residual-driven lattice Boltzmann equation. Part I: framework and nonlinear solution methods</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22078.html</link><guid isPermaLink="false">arxiv:2611.22078v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Xingzhou Ji, Li-Shi Luo&lt;/p&gt;&lt;p&gt;We developed a residual-driven framework of the lattice Boltzmann equation (LBE) to integrate general nonlinear iterative methods. The nonlinear residual is constructed directly from the complete LBE collision-streaming update, allowing general nonlinear solvers to be integrated without modifying the original LBE algorithmic structure, i.e., the kernel consisting of collision-streaming, boundary conditions, and various forcing and interaction effects. Sophisticated techniques, such as weighted fixed-point iteration, full approximation scheme (FAS) multigrid, and Jacobian-free Newton-Krylov methods are integrated into the LBE via this framework, and preconditioned LBE is further incorporated as a nonlinear smoother to demonstrate solver composability. Numerical tests validate that FAS and Newton methods do converge to the same discrete steady fixed-point obtained with the primitive LBE iteration. For the 2D lid-driven cavity flow, the FAS scheme reduces the measured solution time by a factor of approximately 44 at Re = 1000 and more than 224 at Re = 5000. Accurate results are also obtained for the steady flows past a cylinder at Re = 20 and the NACA0012 airfoil at Re = 1000. The low Mach-number tests for the flow past a NACA0012 airfoil further show that both the FAS scheme and preconditioning can not only substantially reduce the work required to reach steady solutions, but also mitigate the zero Mach-number crisis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22078v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Differentiable High-Order Mesh $r$-Adaptivity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22099.html</link><guid isPermaLink="false">arxiv:2611.22099v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>cs.MS</category><description>&lt;p&gt;Ketan Mittal, Julian Andrej, John Camier, Veselin Dobrev, Tzanio Kolev, Leonardo Molinari, Vladimir Tomov&lt;/p&gt;&lt;p&gt;High-order mesh r-adaptivity typically entails minimizing a nonlinear functional using its gradients and, for Newton-based methods, its Hessian. These derivatives can be expensive to derive, must be updated with any changes to the functional, and errors in the derivatives directly impact the convergence of r-adaptivity. Additionally, derivatives of the r-adaptivity operator are required for consistent sensitivity analysis for inverse problems. This work develops a framework for differentiable r-adaptivity based on the Target-Matrix Optimization Paradigm. Given a pointwise functional defining the local mesh-adaptation objective, the proposed framework uses $\partial$FEM to automatically generate pointwise first- and second-order derivatives. These local derivatives are then assembled into a global gradient vector and a Hessian operator through the finite element operator decomposition. The derivative kernels support portable CPU and GPU execution, with partial assembly and tensor sum factorization enabling matrix-free application of the Hessian operator. The framework also provides consistent sensitivities of the r-adaptivity operator through automatically generated mixed derivatives and implicit differentiation of the mesh stationarity equations. Numerical experiments show GPU solve times comparable to those of hand-derived TMOP implementations on a benchmark problem, improvement in r-adaptivity convergence due to accurate computation of the derivatives, and demonstrate the use of mesh sensitivities for material-interface identification in an inverse heat-conduction problem.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22099v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Weak error estimates of a spectral Galerkin approximation to the stochastic Burgers equation driven by rough white noise</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22112.html</link><guid isPermaLink="false">arxiv:2611.22112v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Minxing Zhang, Yongkui Zou, Yanzhao Cao&lt;/p&gt;&lt;p&gt;In this paper, we investigate weak error estimates for a spectral Galerkin approximation to a stochastic Burgers equation driven by rough space-time white noise. The roughness of the driving noise results that the mild solution possesses only $L^\infty$-regularity rather than any positive-order differentiability order regularity. The theory of classical numerical analysis reveals that the convergence rate of numerical solution is determined by the smoothness of the exact solution, and hence $L^\infty$-regularity is insufficient to yield any positive convergence rate. Indeed, De Vecchi et al.\ \cite{DeVecchi2026} studied a spectral Galerkin approximation to such equation and only proved pathwise convergence. However, we aim to derive positive weak convergence rate for the spectral Galerkin approximation, which is determined by the roughness order of noise. To overcome the difficulty caused by the absence of smoothness of the exact solution, we turn to study the differentiability regularity of the first and second order Fréchet derivatives of the solution to a Kolmogorov equation associated with the spectral Galerkin approximation. We manage to prove that they possess nearly second order smoothness, enabling us to derive a positive weak convergence rate for the spectral Galerkin approximation. Finally, we conduct a numerical experiment to illustrate the theortical analysis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22112v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] B-Series Theory for Continuous Time Integration Methods</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22147.html</link><guid isPermaLink="false">arxiv:2611.22147v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Reid J. Gomillion, Adrian Sandu&lt;/p&gt;&lt;p&gt;B-Series are a common tool for constructing numerical integration methods and partitioned variations. In this paper, we expand the operations of B-Series to describe the formal expansion of modified differential equations found in multirate ODE solvers. Typically, such modified differential equations have time dependent approximations using summed fixed constant states. To create the B-Series we introduce a new operation called replacement to induce the constant states and add a time parameterization to the labels of the B-Series. By doing so we introduce new analysis via the permanent and block matrices which provide alternative formulations to composition and substitution. To support the time dependent labels properties are provided, the exact solution is described in Tree Iterated Integrals, and the underlying approximate representations are analyzed.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22147v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] An Explicit Parallelizable Robin-Robin Splitting Scheme for Navier-Stokes-Naghdi Shell Interaction</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22217.html</link><guid isPermaLink="false">arxiv:2611.22217v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Yifan Wang&lt;/p&gt;&lt;p&gt;We develop a novel explicit Robin-Robin splitting scheme for the system of an incompressible viscous fluid coupled to a time dependent Naghdi shell model. The shell model includes three displacement components and three independent rotation components, accounting for membrane, bending, and transverse-shear deformations. Both Robin conditions depend only on interface data from the previous time step, allowing the fluid and shell subproblems to be solved independently without coupling subiterations. For the fixed-domain Stokes-Naghdi problem, we derive a discrete energy identity that incorporates shell rotational inertia, interface velocities, and interface loads. We prove that the scheme is unconditionally stable for any fixed positive common Robin coefficient under homogeneous external data. Under suitable regularity and initialization assumptions, we establish first-order consistency and an $O(\sqrt{Δt})$ temporal error bound in the mechanical energy norm. Numerical experiments with a moving-domain pressure pulse compare the proposed scheme with the kinematically coupled $β$-scheme and a monolithic solver. To demonstrate its applicability to a more realistic vascular configuration, we simulate a stented artery using a bonded layered shell with stiff strut bands, capturing spatial variations in the arterial wall response.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22217v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] OCP: a greedy projection method for row-sparse representations of minimum-norm solutions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22253.html</link><guid isPermaLink="false">arxiv:2611.22253v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Tao Li, Deanna Needell, Qing-Wen Wang&lt;/p&gt;&lt;p&gt;In this paper, we propose a greedy projection method, termed orthogonal constraint pursuit (OCP), for identifying a small set of rows of a consistent linear system $Ax=b$ whose span contains the minimum-norm solution $x^*$, along with the coefficients of that representation. The method successively activates the most violated constraint, and then projects the iterate onto the intersection of all activated constraints. We prove that OCP is equivalent to OMP applied to the dictionary $A^T$ and the signal $x^*$, and that it terminates in at most rank(A) iterations. When $x^*$ is a linear combination of $s$ rows of a matrix whose rows are independent and uniformly distributed on the unit sphere, OCP identifies those rows in exactly $s$ iterations with probability $1-O(m^{-1})$, provided that $n\ge Cs\ln m$ for a sufficiently large constant $C$. We also derive a variant of OCP with constraint removal for hard-margin support vector machines with regularized bias, which returns the support vectors, along with the multipliers that satisfy the KKT conditions. Numerical results on both real and synthetic problems demonstrate the identification of representing rows and the regime in which it is competitive with Krylov subspace methods.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22253v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Nonlocal regularization of sharp-crack energetics: a variational bridge from Griffith geometry to emergent constitutive degradation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22284.html</link><guid isPermaLink="false">arxiv:2611.22284v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>cond-mat.mtrl-sci</category><description>&lt;p&gt;Qing Cheng, Yuqi Sun, Xuejun Xu&lt;/p&gt;&lt;p&gt;We develop a variational diffuse-crack model based on nonlocal averaging of tensile strain energy. A bounded potential acts on the scaled average, while the compressive energy remains local. The initial slope preserves the averaged tensile strain-energy density to leading order. The first variation yields a constitutive stress in which the tensile contribution is multiplied by the adjoint average of the derivative of the saturation potential. The resulting degradation is therefore determined by the stored-energy functional, without introducing an independent fracture field or prescribing a separate degradation law. For fixed smooth displacement fields with bounded strain, the energy density converges to the classical elastic strain-energy density as the averaging radius tends to zero. The Griffith surface-energy coefficient is recovered for planar opening transitions. A structure-preserving scalar auxiliary variable (SAV) scheme satisfies an exact discrete balance between the modified-energy increment and external work. We compare SAV and velocity-Verlet solutions for dynamic crack branching and Kalthoff--Winkler impact.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22284v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] A locking-free enriched linearized neural network for linear elasticity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22398.html</link><guid isPermaLink="false">arxiv:2611.22398v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Bonyong Kim, Young Ju Lee&lt;/p&gt;&lt;p&gt;Neural-network Galerkin methods suffer from volumetric locking in nearly incompressible elasticity. We propose the locking-free enriched linearized neural network (LF-ENN), to the best of our knowledge, the first neural-network Galerkin method proved to be locking-free. Following the enriched Galerkin (EG) method of Yi, Lee and Zikatanov (2022), for finite $λ$ it admits a displacement-only formulation whose trial space is a linearized neural network enriched by one dilation field per element of an auxiliary mesh. The parameter $λ$ enters only through a piecewise constant discrete divergence, whose action on the dilation fields is the graph Laplacian of the dual graph of the mesh. Hence any conforming field can be made discretely divergence-free, and the error is bounded independently of $λ\in(0,\infty]$. The network needs no boundary factor: the Dirichlet condition is imposed weakly by Nitsche&amp;#x27;s method, and a Galerkin least-squares term on the shear part, as in ENN, together with a Hessian penalty on the elements along the traction boundary, replaces the trace inequality that networks lack. Under the stated approximation and quasi-uniformity assumptions, the discrete stability and error-estimate constants are independent of network width, mesh size, and $λ$, for both clamped and mixed boundary conditions. For solutions with reduced regularity, we establish an error estimate of order $h^s$ under the assumptions $u\in H^{1+s}(Ω)^d$ and $p\in H^s(Ω)$, with $s&amp;gt;1/2$. Numerical experiments, including Cook&amp;#x27;s membrane, demonstrate the effectiveness of the method in the presence of boundary singularities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22398v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Locking-free numerical methods for poroelasticity optimal control problems with minimal regularities</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22585.html</link><guid isPermaLink="false">arxiv:2611.22585v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Jeonghun J. Lee&lt;/p&gt;&lt;p&gt;We study distributed optimal control of a linear poroelastic system in a total pressure formulation, with displacement and fluid-pressure tracking and box constraints on the source control. A mechanical Schur complement gives well-posedness at zero storage for each fixed finite Lamé parameter, without estimates that grow like the inverse storage coefficient. We discretize the state and adjoint with conforming finite elements and dG(0) time stepping, and use piecewise constant controls. Under the stated regularity assumptions and a positive lower bound on storage, we prove first-order control and state error estimates uniform as the Lamé parameter increases. Numerical experiments confirm the predicted convergence rates, examine the dependence on the Lamé and storage coefficients, and demonstrate localized pressure control with active bounds.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22585v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] A Divergence-Free Finite Element Discretization of a Convection-Cooling Optimal Control Problem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22616.html</link><guid isPermaLink="false">arxiv:2611.22616v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.OC</category><description>&lt;p&gt;Tongxin Wang, Zhaojie Zhou&lt;/p&gt;&lt;p&gt;In this paper, we develop and analyze a finite element discretization for a bilinear optimal control problem governed by a stationary convection-diffusion equation, in which an incompressible velocity field acts as the control through the convective term. Continuous piecewise linear finite elements are employed to approximate the state and adjoint variables, while the Stokes-type optimality equation for the velocity control is discretized by a low-order, pointwise divergence-free ($P_1^c\oplus RT_0-P_0$) finite element. To accommodate the nonconforming velocity space, we construct a discrete cost functional by replacing the continuous $H^1$-seminorm regularization with a suitable discrete velocity bilinear form and derive the corresponding discrete first-order optimality system. Since the bilinear coupling between the velocity control and the state variable renders the underlying optimization problem nonconvex, we establish local strong convexity of the discrete reduced cost functional under a second-order sufficient optimality condition at an isolated strict local minimizer of the continuous problem. Furthermore, by exploiting a divergence-preserving interpolation operator, auxiliary state and adjoint error estimates, and a stability relation between the discrete reduced-gradient residual and the control error, we derive a priori error estimates for the state, adjoint state and velocity control. Numerical experiments are presented to demonstrate the effectiveness of the optimized incompressible velocity in redistributing the temperature field and to verify the predicted convergence rates.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22616v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] For any wavenumber, the Helmholtz FEM matrix is invertible for almost all meshes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22676.html</link><guid isPermaLink="false">arxiv:2611.22676v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;J. Galkowski, M. Meliani, E. A. Spence&lt;/p&gt;&lt;p&gt;We study invertibility of the conforming piecewise-linear Galerkin matrix for Helmholtz problems with a Dirichlet obstacle and the radiation condition approximated by \emph{either} impedance boundary condition \emph{or} a complex absorbing potential. We prove that for almost every simplicial mesh, and every fixed wavenumber, the Helmholtz FEM matrix with piecewise-linear elements is invertible.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22676v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Anderson Acceleration of SCF Iteration and Newton&#x27;s Method for Solving Nonlinear Eigenvector Problems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22819.html</link><guid isPermaLink="false">arxiv:2611.22819v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Ding Lu, Tom Werner, Zhaojun Bai&lt;/p&gt;&lt;p&gt;The self-consistent field (SCF) iteration is a gateway method for solving nonlinear eigenvector problems, also known as nonlinear eigenvalue problems with eigenvector dependency (NEPv). However, the convergence of SCF can be slow in practice. In this paper, we study two local acceleration techniques for SCF applied to unitarily invariant NEPv: Anderson acceleration and Newton acceleration. A central difficulty in developing these techniques is the non-uniqueness of the eigenvector basis, which complicates direct application of standard Anderson acceleration and introduces singularity into the correction equation of the standard Newton formulation. For Anderson acceleration, we present three formulations based on unitarily invariant parameterization, basis alignment, and Grassmannian geometry, and establish regularity properties of the associated SCF maps. For Newton acceleration, we introduce basis-aligned updates and derive a correction equation whose operator is nonsingular under suitable assumptions, and prove local quadratic convergence. Numerical experiments on NEPv arising from computational physics and data analysis confirm the theoretical findings and demonstrate the effectiveness of the proposed acceleration techniques.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22819v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Convergence of a Parametric Symmetric Galerkin Boundary Element Method for the Mullins-Sekerka Flow</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22862.html</link><guid isPermaLink="false">arxiv:2611.22862v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.AP</category><description>&lt;p&gt;Tokuhiro Eto&lt;/p&gt;&lt;p&gt;We prove convergence of the fully discrete parametric scheme for the two-phase Mullins-Sekerka flow of a closed curve in the plane. The scheme combines piecewise linear parametric curves, a curvature discretization of Barrett--Garcke--Nürnberg type and a symmetric Galerkin boundary element approximation of the Dirichlet-to-Neumann map. For a smooth solution whose curves satisfy a capacity condition, a uniform parameter mesh of size $h$, a constant time step $τ$ and exact boundary element integrals, we show that the discrete curves stay regular and embedded, and that their distance to the exact curves in the topology $W^{1,\infty}$, after reparametrization by arclength, tends to zero in the first order of the time-step size $τ$ whenever the mesh size $h$ is bounded by $c_0τ^2$ for some $c_0$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22862v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Smoothing Bias and Direction Recovery at Boundary Minima of the Nuclear Norm along Matrix Lines</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22963.html</link><guid isPermaLink="false">arxiv:2611.22963v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Haocheng Wang, Yuanqi Zhang, Yi Xu&lt;/p&gt;&lt;p&gt;We study optimal matrix directions associated with minimizing $\|G+λΘ\|_*$, the nuclear norm along a fixed affine line of real matrices with scalar multiplier $λ$. At a rank-deficient minimum, the compact polar factor can violate the tangency constraint even at the minimizing multiplier. Spectral smoothing gives a continuous scalar equation for tangency. We quantify its bias at a unique boundary minimum, where exactly one one-sided derivative vanishes. An orthogonal block decomposition shows that pseudo-Huber smoothing with scale $δ$ shifts the multiplier by exact order $δ^{2/3}$ as $δ\to0$. The Frobenius error relative to the minimum-Frobenius-norm optimal direction has exact order $δ^{1/3}$ when some singular values vanish at exactly second order in the multiplier displacement, and $δ^{2/3}$ otherwise. A sharp rank bound rules out the slower rate when $Θ$ has rank at most two. Huber smoothing gives an error of exact order $δ$ for the same limiting direction. Convergent expansions in powers of $δ^{1/3}$ also yield a three-scale extrapolation with $O(δ)$ error after restoring feasibility.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22963v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Residual-Driven Basis and Data Selection for Polynomial Approximation of High-Dimensional Hamilton-Jacobi-Bellman Equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22979.html</link><guid isPermaLink="false">arxiv:2611.22979v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.OC</category><description>&lt;p&gt;Yuyang Huang, Dante Kalise, Yuhua Zhu&lt;/p&gt;&lt;p&gt;We develop greedy strategies for selecting global polynomial basis functions and training data in the sparse approximation of high-dimensional partial differential equations, with emphasis on Hamilton-Jacobi-Bellman (HJB) equations arising in nonlinear optimal control. Inspired by the goal-oriented dual-weighted residual framework, we derive a closed-form, mesh-free indicator that predicts, to first order, the reduction of the PDE residual obtained by adding a single candidate basis function, without solving an adjoint problem. In the data-driven regime, we jointly select basis functions and gradient-augmented training samples by maximizing the predicted decrease of a supervised loss. Numerical experiments on benchmark PDEs and nonlinear optimal control problems in up to 35 dimensions show accuracy comparable to non-adaptive approaches with substantially fewer basis functions and training samples.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22979v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] A singularity detecting uniformly convergent quantum wavelet framework for weakly singular nonlocal Emden--Fowler systems with quantum Mittag--Leffler sources</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23023.html</link><guid isPermaLink="false">arxiv:2611.23023v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.CV</category><description>&lt;p&gt;Arushi, Pranay Goswami, Pratibhamoy Das, Sudarshan Santra&lt;/p&gt;&lt;p&gt;We develop a quantum wavelet-based computational framework for coupled systems of Caputo-type quantum ($q$-) fractional Emden--Fowler problems with $q$-Mittag--Leffler source terms, where the solutions exhibit singular behavior in time. Here $q\in(0,1)$ denotes the parameter of $q$-calculus. The highest-order Caputo $q$-fractional derivatives are expanded through the Haar wavelet basis, and the lower-order fractional derivatives are approximated through Jackson $q$-fractional integrals of Haar wavelets. The continuous problem reduces to a nonlinear algebraic system on the midpoint collocation points. Under suitable structural assumptions, the Banach fixed-point theorem yields the existence and uniqueness of the continuous solutions and wellposedness of the discrete solutions on collocation points. The nonlinearity of the given problem is dealt with by the damped Newton&amp;#x27;s iteration. In addition, We prove stability of the scheme and derive rigorous convergence estimates in a weighted norm that remains uniformly controlled despite the appearance of singular weight at $t=0$ in the continuous model. When the highest-order fractional derivatives are Hölder continuous with exponent $σ$, the mathematical error of weakly singular solution and its lower-order fractional derivatives become $\mathcal{O}(τ_L^σ)$, where $τ_L=2^{-(L+1)}$ denotes the width of the finest subintervals for maximum level of resolution $L$. First-order convergence is guaranteed under stronger regularity with $σ=1$. Several test cases are considered to confirm the accuracy and robustness of the present approach, which strongly agrees with the theoretical estimates. In particular, first-order convergence is observed even where the stronger regularity assumption is not satisfied.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23023v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Right shape, wrong time: phase errors of ODE solvers in the flame problem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23027.html</link><guid isPermaLink="false">arxiv:2611.23027v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>physics.comp-ph</category><description>&lt;p&gt;Imre Boros&lt;/p&gt;&lt;p&gt;The flame model $y&amp;#x27;=y^2-y^3$, $y(0)=δ$, is a standard illustration of stiffness: for $δ=10^{-4}$ the stiff MATLAB solvers ode23s and ode15s need only 99 and 140 steps, against 3040 for ode45. We show that these cheap solutions have the right shape at the wrong time: they place the front 29 and 329 time units early, with maximal errors 0.95 and 1.00. Because all solutions are time translates of one master profile, the global error of every numerical solution with values in $[δ,1)$ is exactly a phase error, $y_k=y_δ(t_k-D_k)$. For fixed-step one-step methods of order $p$ we prove $D=h^p\int_δ^{y}g+O(h^{p+1})$ with a remainder bounded uniformly in $δ$, so that the delay grows at most like $h\ln(1/δ)$ for $p=1$ and stays bounded for $p\geq2$. For any computed solution the delay is exactly the sum of its defects with respect to the exact flow, converted into time; a heuristic model, confirmed by MATLAB runs, explains why it is created in the first few steps and why tightening the tolerances is an expensive cure. Integrating for $1/y$, which runs like a clock in the slow phase, with an absolute tolerance reduces the error by several orders of magnitude, at a median cost close to that of the standard formulation. The mechanism needs only that the equation is autonomous; its general form is the subject of a companion paper.&lt;/p&gt;&lt;p&gt;code https://github.com/boros91/flame-phase-errors (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23027v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Finite element nonlinear nudging for the Navier-Stokes equations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23036.html</link><guid isPermaLink="false">arxiv:2611.23036v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><description>&lt;p&gt;Elizabeth Carlson, Rui Fang, Ali Pakzad&lt;/p&gt;&lt;p&gt;Nonlinear nudging augments the classical linear nudging (continuous data as- similation) term with a nonlinear feedback that strengthens as the observed error decreases, and yields super-exponential convergence to the true state. In this paper, we study nonlinear nudging for the 3-dimensional incompressible Navier-Stokes equations with the finite element method, which allows complex geometries and physical boundary conditions. We propose an implicit-explicit (IMEX) finite element scheme with inf-sup stable elements, prove its unconditional long-time stability, and show for the spatially semi-discrete scheme that the error reaches a prescribed tolerance in finite time. Our analysis also suggests that the non- linear nudging term requires the mesh resolution to be fine enough (${χ= O(H^{-1})}$, where $χ$ is the nonlinear nudging intensity and ${H}$ is the observation mesh size). Further, our error estimates suggest that a larger nonlinear exponent $γ$ requires finer observational resolution, which is confirmed by numerical tests. Numerical experiments, including two-dimensional forced viscous flow in a periodic box, flow past a cylinder, and flow over a flat plate, show that nonlinear nudging synchronizes with the true solution considerably faster than linear nudging. We also show that observations in a subregion suffice to synchronize the whole flow&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23036v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] Michelson and Logarithmic Operator Contrasts Spectral Geometry, Tracial Extensions, and Random Products</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21667.html</link><guid isPermaLink="false">arxiv:2611.21667v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><category>math.FA</category><category>math.PR</category><category>math.SP</category><description>&lt;p&gt;Andrej Novikov, Irina Nikolaeva&lt;/p&gt;&lt;p&gt;The Michelson contrast of a positive invertible operator is a bounded coordinate for its condition number. Its logarithmic lift, $\operatorname{OLC}(A)=\frac12\log(\|A\|\|A^{-1}\|)$, connects spectral spread with projective Thompson geometry. This preprint collects the Novikov--Nikolaeva series and the associated single-author extensions by Novikov into one treatment. We develop the equality criterion for product subadditivity, its dimension and Jordan-rank thresholds, quantum-state examples, and contrasts associated with unitarily invariant norms. The latter have a sharp additive defect, while the full Schatten family records a logarithmic spectral profile up to homometry. Tracial extensions give characterisations of traces, dimension-sensitive defects, and spectral-edge asymptotics. Unbounded operators are described through critical exponents and finite sections. Tensor, matrix and free independence lead to distinct growth laws for products. Finally, symmetric cones provide a setting for the equality criterion, Lorentz boosts, and Jordan products. Classical ingredients are distinguished from the refinements developed in the series; conjectural asymptotic statements remain explicitly labelled.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21667v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] Actions of quantum groups: the standard implementation and relatively invariant weights</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21776.html</link><guid isPermaLink="false">arxiv:2611.21776v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><category>math.FA</category><description>&lt;p&gt;Jacek Krajczok&lt;/p&gt;&lt;p&gt;We establish a characterisation of the standard implementation for actions of locally compact quantum groups on von Neumann algebras, extending results of Daws-Skalski-Viselter and Haagerup. As a consequence, we prove that taking the standard implementation respects morphisms of quantum groups. We also prove that several natural conditions expressing relative $ρ$-invariance for n.s.f. weights are equivalent.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21776v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] C*-algebras constructed using acyclic groups</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21817.html</link><guid isPermaLink="false">arxiv:2611.21817v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><category>math.GR</category><description>&lt;p&gt;Jakub Curda, Shanshan Hua, Raz Slutsky&lt;/p&gt;&lt;p&gt;We show that the free group on countably many generators is not $C^\ast$-superrigid. Furthermore, we realize each of $O_{\infty}$ and the Jiang-Su algebra as a crossed product of a commutative $C^\ast$-algebra. Finally, we construct non-trivial, outer actions on classifiable $C^\ast$-algebras whose crossed products exhaust all classifiable $C^\ast$-algebras. The common theme in the proofs is the use of torsion-free, acyclic groups.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21817v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] Obstructions to Hadamard Deformations of Fourier Matrices</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21871.html</link><guid isPermaLink="false">arxiv:2611.21871v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><category>math.CO</category><description>&lt;p&gt;Shuler Hopkins, Remus Nicoara&lt;/p&gt;&lt;p&gt;We study deformations of the Fourier spin model commuting square in the space of commuting squares, or equivalently deformations of the matrix $\sqrt nF_n$, where $F_n$ denotes the Fourier matrix, by complex Hadamard matrices. If $n$ is neither a prime power nor twice a prime, we show that there exist unit vectors in the enveloping tangent space that cannot be realized as directions of convergence of sequential deformations. Consequently, the derivative of any differentiable Hadamard family through $\sqrt nF_n$ has rank strictly smaller than the dimension of the enveloping tangent space at $\sqrt nF_n$ (i.e., the defect of $F_n$). This is particularly surprising because for every $n$ there exist enough one-parameter analytic families to provide a basis of directions in the enveloping tangent space. We obtain cubic obstructions when $n$ has at least three distinct prime divisors, quartic obstructions when it has exactly two and a repeated factor, and quintic obstructions when it is the product of two distinct odd primes. These results extend our order $30$ result from \cite{HN}.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21871v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] The metric theory of tracial matrix algebras does not converge</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22822.html</link><guid isPermaLink="false">arxiv:2611.22822v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><description>&lt;p&gt;Vadim Alekseev, Andreas Thom&lt;/p&gt;&lt;p&gt;We show that the theories of tracial matrix algebras and metric unitary groups do not converge with the dimension. In the main argument, we recover the canonical diagonal using spectral gap and internality. Uniform definability of the diagonal and its normalizer then transfers the distinct theories of universal sofic groups to matrix ultraproducts. The same methods show that isomorphisms preserve every internal subalgebra and give fixed finite distance formulas over six unitaries. Finally, we construct an explicit continuum family of matrix ultraproducts with distinct theories and trivial first-order fundamental groups.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22822v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] The Bessis Moussa Villani conjecture in finite von Neumann algebras</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23122.html</link><guid isPermaLink="false">arxiv:2611.23122v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OA</category><category>math-ph</category><category>math.FA</category><description>&lt;p&gt;Liviu Paunescu, Florin Radulescu, Andreas Thom&lt;/p&gt;&lt;p&gt;We prove the Bessis--Moussa--Villani conjecture, which is known for matrix algebras, for bounded operators in a finite von Neumann algebra with a faithful normal tracial state. Following the approach of Heinavaara, for a pair of positive operators, we construct a tracial joint spectral measure on the punctured plane whose moments are the traces of symmetrized words. We construct a scalar measure by holomorphic spectral selection and a Lyapunov identity. An integral identity for its moments then gives positivity of two coordinate-weighted distributions. From these we obtain the planar measure and the Laplace representation of the trace exponential.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23122v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Asymptotic analysis of sample average approximations for optimal control problems with uncertain dynamics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21831.html</link><guid isPermaLink="false">arxiv:2611.21831v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Maria Soledad Aronna, João Miguel Machado, Oscar Sierra Fonseca&lt;/p&gt;&lt;p&gt;We study sample average approximations (SAA) of optimal control problems with control-affine dynamics depending on an uncertain parameter. The objective is an expected terminal cost plus a Tikhonov regularization term, and the controls are square-integrable functions subject to pointwise convex constraints. We show that the reduced objective is twice continuously differentiable in the square-integrable topology, so that no two-norm discrepancy arises, and that its Hessian is a Hilbert--Schmidt perturbation of a multiple of the identity. This yields Lipschitz regularity of stationary controls and second-order conditions without gap for polyhedral constraints. For the SAA scheme with sample size $M$, we prove almost sure uniform consistency of the empirical minimizers, convergence rates of order $M^{-1/2}$ for the optimal values, independent of the dimension of the parameter space. We then derive the asymptotic distributions. The optimal values satisfy a central limit theorem, obtained from a functional central limit theorem for the SAA objective. The empirical minimizers are asymptotically Gaussian when the constraints are inactive; under polyhedral constraints, their limit solves a quadratic problem on the critical cone with a Gaussian linear term. We also derive confidence intervals for linear functionals of the optimal control and illustrate the results on two numerical examples.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21831v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Primal--Dual Kullback--Leibler Mirror-Prox for Dynamic Mean Field Games</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21837.html</link><guid isPermaLink="false">arxiv:2611.21837v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Erhan Bayraktar, Ibrahim Ekren, Lu Vy, Ziqing Zhang&lt;/p&gt;&lt;p&gt;We compute finite-horizon dynamic mean field equilibria using a primal--dual Kullback--Leibler Mirror-Prox algorithm. Each iteration updates occupation measures by exponential tilting and computes the dual correction by solving a linear PDE, without solving a nonlinear Hamilton--Jacobi--Bellman equation or a best-response control problem. Under assumptions and Lasry--Lions monotonicity, we prove an $O(K^{-1})$ ergodic Minty bound after $K$ iterations and an $O(K^{-1/2})$ approximate-equilibrium bound for the corrected average. We obtain convergence rates for the population flow under strong monotonicity, and for smooth diffusions with uniformly convex control costs under ordinary monotonicity. We also prove convergence of continuous-time Markov chain approximations to diffusion equilibria and, under additional smoothness and convexity assumptions, bound the error in terms of the spatial mesh size and the number of iterations. Galerkin approximations preserve the $O(K^{-1})$ estimates under suitable bounds on the correction errors. Numerical experiments illustrate the method and its convergence.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21837v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Bias-Reduced and Parallel Heavy-Tailed Stochastic Convex Optimization in $\ell_p$ Geometries</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21844.html</link><guid isPermaLink="false">arxiv:2611.21844v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>cs.LG</category><category>stat.ML</category><description>&lt;p&gt;Zhengyun Nie, Anant Shyam, Brian Bullins&lt;/p&gt;&lt;p&gt;We consider the fundamental problem of parallel stochastic convex optimization (SCO), whose aim is to approximately minimize a convex objective when given the ability to query a moment-bounded stochastic gradient oracle multiple times in parallel per round. Whereas most previous results have focused on the variance-bounded Euclidean ($\ell_2$-norm) setting, meaning the objective is Lipschitz with respect to the $\ell_2$-norm over an $\ell_2$-bounded feasible set in $\mathbb{R}^d$, in this work we study parallel SCO in $\ell_p$ settings for $2 \le p &amp;lt; \infty$ under a heavy-tailed noise model. We begin by introducing a new class of $\ell_p$-optimal-distance-convergence (ODC$_p$) algorithms, drawing on prior stochastic bias-reduced techniques [ACJ+21], which combine with multilevel Monte Carlo methods to efficiently estimate the optimum of uniformly convex objectives. As a consequence of our ODC$_p$ algorithms, we first establish rates for projection-efficient $\ell_p$-Lipschitz optimization, composite convex minimization, and efficient $\ell_p$-proximal point estimation. Combining our ODC$_p$ algorithms with a new $\ell_p$-generalized Gaussian-based stochastic gradient estimator ($p$-GREG), we provide two efficient $\ell_p$ parallel algorithms, EpochDA and $\ell_p$-AC-SA, which achieve optimization error $ε&amp;gt; 0$ with at most $\tilde{O}(d^{\frac{p}{2p + 2}} ε^{-\frac{p}{p + 1}})$ query depth, improving upon the sequential heavy-tailed stochastic query depth of $O(ε^{-p})$ for $ε\leq \tilde{O}(d^{-1/(2p)})$. We also establish dimension-dependent lower bounds of $Ω\bigl(\min\{ε^{-p},d^{p/(3p-2)}\}\bigr)$ adaptive rounds for nonsmooth convex optimization over a subset of the unit $\ell_p$ ball. Our results improve upon the $Ω(\min\{ε^{-p},ε^{2/3}d^{1/3}\})$ bounds of [DG19], when adapted to the same feasible set.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21844v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Polylogarithmic Regret via Certainty Equivalence in Degenerate LQR</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21927.html</link><guid isPermaLink="false">arxiv:2611.21927v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>cs.LG</category><category>eess.SY</category><description>&lt;p&gt;Luca Vignola, Melanie Zeilinger, Bruce D. Lee&lt;/p&gt;&lt;p&gt;Singular input penalties, as in minimum variance control, can reduce what must be identified to control an unknown linear system. In online linear quadratic control, certainty equivalence can achieve polylogarithmic regret when the optimal controller is identifiable from data collected under optimal feedback. With a positive definite input penalty, however, this condition is restrictive, since for an invertible state matrix it requires all unknown parameters to be identifiable under optimal feedback. We show that singular input penalties relax this requirement, expanding the class of problems in which certainty equivalence achieves polylogarithmic regret. Specifically, we prove that a certainty-equivalence algorithm with a short initial exploration phase achieves $O(\log^2 T)$ expected regret over $T$ interactions whenever controller identifiability holds. We complement this guarantee with an $Ω(\sqrt{T})$ minimax lower bound for a family containing a system where controller identifiability fails. For minimum variance control, knowing the range of the input matrix suffices for controller identifiability, a weaker requirement than knowing the full input matrix, as assumed in prior work with positive definite input penalties. This condition also covers underactuated systems, as we illustrate with a cart-pole example.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21927v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Projector-Based Conic Formulations and Exact Decompositions for Continuous Multifacility Location</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21942.html</link><guid isPermaLink="false">arxiv:2611.21942v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Víctor Blanco, Diego Laborda-Gutiérrez, Miguel Martínez-Antón&lt;/p&gt;&lt;p&gt;We study the continuous multisource facility location problem, where facility locations and the assignment of demand points must be determined simultaneously. We show that the assignment structure can be represented by orthogonal projection matrices. This observation leads to new mixed-projection conic formulations that avoid the big-M envelopes used in standard mixed-integer models. Based on these formulations, we develop exact decomposition algorithms that separate the discrete selection of the assignment projectors from location convex conic subproblems. We also derive semidefinite relaxation bounds and primal procedures that provide warm starts for the exact methods. The proposed approach draws new connections between continuous multifacility location, orthogonal projectors, and low-rank semidefinite optimization, and applies to general conic-representable distances.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21942v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Decision-Weighted Limit Theorems: Less Conservative Robust Optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21944.html</link><guid isPermaLink="false">arxiv:2611.21944v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Dimitris Bertsimas, Danique de Moor, Dick den Hertog, Federica Donnini&lt;/p&gt;&lt;p&gt;Limit theorems provide a natural way to construct tractable models for optimization under uncertainty. Existing approaches typically apply them to unweighted sums of uncertain parameters and use the resulting bounds to construct uncertainty sets. We show that sharper formulations are obtained by applying limit theorems directly to the uncertain linear expressions in the optimization problem, with the decision variables as weights. For independent random variables with finite variance, the weighted central limit theorem yields a second-order cone constraint with a decision-dependent protection term, and for heavy-tailed random variables governed by stable limit laws, the weighted approach yields power-cone constraints. Using norm duality, we show that, under a condition on the individual bounds, the feasible region of the unweighted formulation is contained in that of the weighted one. In 16,000 knapsack instances with a prescribed violation probability of 5%, the weighted formulation improves the optimal objective value by 20.9% on average, with overall average violation probabilities between 3.45% and 4.95%, whereas those of the unweighted formulation are near zero.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21944v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Causal Input--Output Modeling with Prior Information</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22025.html</link><guid isPermaLink="false">arxiv:2611.22025v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>eess.SY</category><description>&lt;p&gt;Amirhossein Taghvaei, Daran Xu&lt;/p&gt;&lt;p&gt;We study the problem of inferring a causal input--output model from unpaired marginal observations and a given prior coupling. We formulate this problem using entropic causal optimal transport, which seeks a coupling that preserves the observed marginals, satisfies a one--sided causality constraint, and remains close to the prior. For Gaussian marginals and general quadratic costs, we prove that the optimal coupling is Gaussian and reduce the problem to a finite--dimensional optimization over covariance matrices. Using a Cholesky transformation to simplify the causality constraint, we derive a Lagrangian dual formulation and develop a block coordinate descent algorithm with explicit update formulas. We establish linear convergence of the algorithm, with explicit convergence rates, and prove stability of the optimal coupling under marginal covariance perturbations and derive a statistical error bound. We further show its equivalence to Sinkhorn iterations. Numerical experiments demonstrate the computational efficiency of the proposed algorithm and illustrate the predictive advantages of causal couplings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22025v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Finite sample guarantees of MPPI: suboptimality, sample complexity and closed-loop guarantees</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22142.html</link><guid isPermaLink="false">arxiv:2611.22142v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>eess.SY</category><description>&lt;p&gt;Changyi Lei, Dragan Nesic, Ye Pu&lt;/p&gt;&lt;p&gt;This paper considers model predictive path integral (MPPI) control for nonlinear finite-horizon optimal control problems with bounded inputs, allowing nonconvex and nonsmooth costs. We prove theoretical guarantees that quantify the suboptimality caused by positive temperature and finite sampling on MPPI and establish their implications for closed-loop guarantees. Specifically, we derive a suboptimality bound for infinite-sample MPPI that characterizes the effects of temperature and prior coverage, followed by a high-probability finite-sample approximation error bound that reveals the dependence on sample size, temperature, and cost variability. By incorporating these bounds into a terminal-constraint-free MPC framework, we further establish semi-global practical recurrence of the closed-loop system. Numerical examples involving a four-link planar manipulator illustrate the temperature-sampling tradeoff and the influence of prior quality on approximation accuracy and closed-loop performance.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22142v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Decision Stability and Model Reduction for Hamilton--Jacobi Navigation in Multiscale Flows</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22176.html</link><guid isPermaLink="false">arxiv:2611.22176v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>math.NA</category><description>&lt;p&gt;Ruimeng Hu, Byungdoo Kong, Xu Yang&lt;/p&gt;&lt;p&gt;Autonomous vehicles plan time-optimal routes through flow fields that are known only through reduced, finite-resolution models of an underlying multiscale flow. Classical Hamilton-Jacobi homogenization concerns convergence of the value function as the fine scale vanishes; but what a vehicle commits to is a route, and value accuracy need not imply route accuracy. We study this gap for a fixed-resolution reduction rather than in the homogenization limit. The committed route&amp;#x27;s dependence on the model-reduction error splits into two regimes. When the optimal route is a unique, nondegenerate minimizer with a regular value-function neighborhood, it depends Lipschitz-continuously on the reduction error, while the extra travel time from acting on the reduced model grows only quadratically with that error. When two routes are tied on the cut locus of the value function, the value remains stable, but an arbitrarily small change in the flow can switch the selected route, making route selection discontinuous in the reduction error. This dichotomy identifies where a reduced model must be accurate: not where the flow error is largest, but where the route choice is fragile. In the regular regime it yields a resolution-allocation principle, while an oracle marginal-regret benchmark illustrates the potential benefit of decision-aware resolution allocation relative to refinement based on flow-error magnitude.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22176v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Doing Well by Doing Good: Alignment of Revenue and Welfare in Robust Product Line Design through Data-Driven Optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22264.html</link><guid isPermaLink="false">arxiv:2611.22264v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Maoqi Liu, Liangjie Li, Yun Hui Lin, Xiuli Chao, Jiajie Zhang&lt;/p&gt;&lt;p&gt;Product line design (PLD) selects product variants for a firm to maximize expected revenue. Candidate assortments are usually evaluated under random utility maximization (RUM), in which choice probabilities stem from the joint distribution of latent consumer utilities. As this utility distribution cannot be directly observed and is estimated from choice data, distributional uncertainty inevitably arises. This paper studies how to hedge PLD decisions against such ambiguity. We construct a distributionally robust optimization (DRO) model that maximizes worst-case expected revenue over an l1-Wasserstein ball around a nominal utility distribution. We derive a dual reformulation for general nominal distributions and then specialize to two cases. With independent Gumbel utility shocks, the dual simplifies to a closed-form robust multinomial logit. We derive revenue gap bounds for parameters estimated from finite full-assortment choice data. When the true model structure is unknown beforehand, we adopt a data-driven scheme using the empirical distribution of sampled utility vectors and extend optimality-gap analysis to a general RUM oracle. For the NP-hard empirical problem, we propose Adaptive Parametric Search (APS), an algorithm with certified relative optimality guarantees. Numerical experiments show fast computation and better out-of-sample performance.Dual analysis shows that robustness to preference uncertainty endogenously encourages the firm to raise buyer welfare. This incentive takes distinct forms: robustness supports larger assortments in the unconstrained logit setting, whereas under the empirical nominal, it favors products with lower prices and higher utility relative to the outside option. Numerically, we identify a &amp;quot;doing well by doing good&amp;quot; effect: product lines with higher in-sample buyer welfare attain higher out-of-sample revenue and buyer welfare.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22264v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] The Critical Time for Local Controllability of a Water Tank</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22279.html</link><guid isPermaLink="false">arxiv:2611.22279v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Feizheng Huang, Zhaobo Liu&lt;/p&gt;&lt;p&gt;We determine the critical time for local controllability near equilibrium of a water tank governed by the one-dimensional Saint-Venant equations and controlled by its horizontal acceleration. With $C^1$ fluid trajectories and continuous controls, local controllability holds exactly for $T&amp;gt;T_c$. In normalized units, $T_c=2+d_c\approx 2.43674$, where $d_c$ is determined by two transcendental equations. In particular, local controllability fails for $2&amp;lt;T\le T_c$, disproving Coron&amp;#x27;s conjecture that it holds exactly for $T&amp;gt;2$. For times just above $T_c$, we construct a control that cancels the linear and quadratic terms of the endpoint expansion and apply a fixed point argument. At $T_c$, a weighted comparison with a critical plane curve, combined with estimates along the nonlinear characteristics, gives the obstruction.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22279v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] An Inexact Proximal Gradient Method for Composite Multiobjective Optimization with Absolute and Relative Stopping Criteria</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22361.html</link><guid isPermaLink="false">arxiv:2611.22361v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Zhuoxin Fan, Liping Tang, Xinmin Yang&lt;/p&gt;&lt;p&gt;Proximal gradient methods are widely used for composite optimization. In multiobjective optimization, however, the resulting minimax subproblem generally requires an additional inner method to solve, even when the proximal mapping of each nonsmooth component is available in closed form. In addition, most existing convergence results are obtained only under the assumption that the involved subproblems are solved exactly, which is unrealistic and limits the applicability of the proximal gradient methods. To make the proximal gradient methods practical, we propose an implementable inexact proximal gradient method based on proximal computation. Considering an approximate optimality condition and a hybrid stopping criterion including absolute and relative rules for the subproblem, we address the computational challenge by developing an inner inexact projected gradient method that can exploit the proximal mappings of the individual components. The $\mathcal{O}(1/k)$ convergence rate is also established for our method under certain conditions. Numerical experiments illustrate the computational benefits of solving the subproblems inexactly.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22361v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] A 5/2 Guarantee for Echelon Stock (s,S) Policies in One-Warehouse Multi-Retailer Systems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22468.html</link><guid isPermaLink="false">arxiv:2611.22468v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Ming Hu&lt;/p&gt;&lt;p&gt;We study a periodic-review warehouse serving multiple heterogeneous retailers with stochastic demand and fixed costs and lead times at both echelons. We construct a deterministic echelon stock $(s,S)$ policy whose long-run expected average cost is at most $5/2$ times the optimum over all nonanticipative policies. The guarantee holds when the common backlog penalty and retailer holding rates are at least the warehouse holding rate and retailer setup costs are at most $3/2$ times the supplier&amp;#x27;s. The retailer-specific setup-cost condition extends beyond supplier setup-cost dominance: a retailer dispatch may cost up to 50 percent more than a supplier order. Demand vectors are i.i.d. over periods with finite positive means, and demands of different retailers may be correlated. Each retailer selects the full cycle of its single-location plan or a shifted cycle of half its width, and the warehouse serves requests in arrival order, allowing partial shipments. The upper bound on the policy&amp;#x27;s cost includes each retailer&amp;#x27;s mirror cost, which prices the warehouse imbalance created by its batching. The upper and lower bounds share a pooled supplier problem and add one problem per retailer, giving a factor independent of all lead times and the number of retailers. For arbitrary nonnegative setup costs and associated retailer demands, a consolidation policy holds allocated stock until a dispatch threshold is met and gives a factor below $4.9$. On 864 instances built from Walmart store sales, the simulated cost of an integer-rounded implementation of the FIFO policy averages 1.45 times the lower bound and reaches 1.75, and our analytical upper bound on its cost is below 1.94 times the lower bound. With no simulation search, the policy comes within 8.2 and 12.2 percent, on average over 216 instances, of an echelon batch policy and an integer-ratio policy, both tuned by simulation for each instance.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22468v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Balancing Exploration and Exploitation in Constrained Combinatorial Optimization with U(1)-Symmetric Tensor Trains</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22557.html</link><guid isPermaLink="false">arxiv:2611.22557v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>cs.LG</category><description>&lt;p&gt;Sergei Iudin, Mikhail Podobrii, Dmitry Zheltkov, Stanislav Moiseev&lt;/p&gt;&lt;p&gt;Tensor Train (TT) decomposition has emerged as a powerful tool for mitigating the curse of dimensionality in a variety of machine learning and combinatorial optimization tasks. Recent advances show that TT-based generative models can efficiently represent and explore high-dimensional discrete spaces, even when the cost function structure is unknown. However, incorporating hard linear constraints into TT-based optimization remains challenging, as existing interpolation and sampling approaches often fail when feasible points are rare. In this work, we develop a general TT-based framework for constrained combinatorial optimization built upon U(1)-symmetric tensor networks. Our method introduces an expressibility-enhancement mechanism for constructing sparse symmetric tensors and a graph-based diversity measure that guides sample selection during training. On assignment benchmarks, expressibility enhancement and diversity-aware selection improve mean solution quality over their respective baselines. The assignment-selected diversifying strategy also extends to nonpolynomial Set Partitioning, with larger relative gains observed in the higher-tensor-rank data families. Separate runtime benchmarks show substantial speedups over ConstrainTNet and PROTES on non-degenerate assignment workloads; comparisons with simulated annealing depend on constraint information and computational budget, but, overall, support the practicality of the current implementation.&lt;/p&gt;&lt;p&gt;code https://github.com/antientropic-guy/OhMyU1_public (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22557v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Maximin Dispersion over Simple Polyhedral Domains: Strong NP-Completeness and Exact Algorithms</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22578.html</link><guid isPermaLink="false">arxiv:2611.22578v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Linbin Li, Yong Xia, Zhuoyi Xu&lt;/p&gt;&lt;p&gt;In this paper, we prove that the decision version of weighted maximin dispersion over the unit $\ell_1$-ball with rational sites and positive rational weights is strongly NP-complete. The same holds for unweighted dispersion over full-dimensional integer simplices when the sites are exactly their vertices. Both reductions from Exact Cover by 3-Sets rely on a shared quadratic rigidity argument. We also give exact algorithms that run in polynomial time for every fixed dimension. For the simplex problem, a Voronoi decomposition yields rational optimal solutions. For the weighted $\ell_1$-ball problem, an orthant decomposition and a single-paraboloid lifting yield optimal solutions whose coordinates lie in a common real algebraic extension of degree at most two. In both cases, these solutions have polynomial encoding length and provide certificates for NP membership.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22578v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Solution-Set Properties of Absolute Value Equations: Inverse Nonnegativity, Boundedness, and Connectedness</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22598.html</link><guid isPermaLink="false">arxiv:2611.22598v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Abhishek Kumar Singh Sengar, Bharat Kumar, Deepmala&lt;/p&gt;&lt;p&gt;The solution-set properties of the absolute value equation (AVE) \(Ax+|x|=b\) were systematically investigated by Hladík (\emph{SIAM J. Matrix Anal. Appl.} \textbf{44}, 175-195, 2023), who also formulated several related open questions. This paper settles and extends some of those questions. A complete converse characterization of inverse nonnegativity is established without restrictions on the matrix order or symmetry. The characterization is accompanied by equivalent criteria involving nonsingular \(M\)-matrices and spectral radii. A diagonal semidefinite certificate is then developed for the uniform boundedness of solution sets. Unlike regularity conditions, this certificate permits infinitely many solutions, as illustrated by a three-dimensional example whose solution set contains a nontrivial line segment. Connectedness of the solution set for an individual right-hand side is characterized through a finite graph formed from its orthant components. A further sufficient condition is obtained from the \(P_0\)-property of the associated complementarity matrix. The inverse-nonnegativity characterization is finally extended to generalized absolute value equations (GAVE) having a nonnegative absolute-value coefficient matrix.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22598v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Transmission Expansion and Energy Storage Planning under Great Britain&#x27;s Uncertain Energy Transition Pathways</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22711.html</link><guid isPermaLink="false">arxiv:2611.22711v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>eess.SY</category><description>&lt;p&gt;Shengming Cao, Runsheng He, Waqquas Bukhsh&lt;/p&gt;&lt;p&gt;Long term power system planning must account for uncertainty in electricity demand and generation, while recognising the different investment and commissioning characteristics of transmission and energy storage. This paper develops a multi year stochastic framework for coordinated transmission expansion and energy storage planning and applies it to the Great Britain electricity system to assess investment needs through to 2050. The framework integrates multiple energy transition pathways with an enhanced representation of the GB transmission network and captures the different characteristics of transmission and storage investment over time. The coordinated treatment of transmission and storage is considered as a system level benchmark rather than a centralised investment mechanism. In GB, transmission investment is subject to regulated forward looking planning, while storage is largely developed by market participants in response to market signals. The framework therefore quantifies the potential value of improved coordination and identifies where existing investment signals may not encourage complementary storage deployment. Results across alternative transmission only, storage only and coordinated investment strategies show substantial benefits from joint planning. Compared with transmission only planning, coordinated investment reduces additional transmission capacity by 2%, cumulative expected load shedding by 97%, and total expected system cost by 36%, primarily through avoided unserved energy. Transmission preparation periods affect the timing, but not the final portfolio, of investments. Finally, the energy transition pathway materially influences investment requirements, with Electrification and Efficiency requiring 7% more transmission capacity and 45% more storage energy capacity than Falling Behind.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22711v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] KL-Guided Support Selection and Subspace Cubic Newton Methods for Sparse Optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22940.html</link><guid isPermaLink="false">arxiv:2611.22940v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Zihao Xia, Min Tao, Guojian Yin&lt;/p&gt;&lt;p&gt;We study sparse composite optimization with a smooth loss and a possibly nonconvex, nonsmooth regularizer. The objective is locally smooth on each fixed support. Our method combines full-space proximal-gradient steps with inexact cubic-regularized Newton steps on a subspace selected by thresholding. If the iterates are bounded and the objective satisfies the Kurdyka--Łojasiewicz (KL) property, the entire sequence converges to a first-order stationary point. A threshold based on the KL exponent ensures that the selected coordinate set coincides with the support of the limit after finitely many iterations, without requiring a nondegeneracy assumption. We also provide a residual-based threshold when such an exponent exists and its value is unknown. Under an additional continuity assumption on the restricted Hessian, the line search eventually accepts full cubic steps. With bounded cubic regularization parameters and damping parameters chosen to meet the target tolerances, we bound the number of outer iterations needed to reach restricted approximate second-order stationarity after support identification and entry into the full-step regime. We conduct numerical experiments in two settings: when the KL exponent is known and when it is unknown. In the former case, we use a degenerate problem to demonstrate the effectiveness of the proposed method. In the latter case, we compare the proposed method and its adaptive variant with existing solvers on sparse recovery and logistic regression problems.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22940v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Mean Field Games: Large Sparse Network Limits and Laplexion Dynamics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22950.html</link><guid isPermaLink="false">arxiv:2611.22950v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Minyi Huang, Peter E. Caines&lt;/p&gt;&lt;p&gt;Dynamic games are considered with large subpopulations distributed over large sparse graphs, where each agent has mean field coupling with all agents within the same cluster and meanwhile receives impact from neighboring clusters. Tractable limit models are obtained via the network limits of graph Laplacian operators modelling second order interactions. The resulting mean field game (MFG) has what is called Laplexion dynamics. For ring and torus topology cases, solutions for linear quadratic Laplexion MFG systems with infinite populations on infinite node networks are obtained via a second order linear partial differential equation system. This work focusses on the relationship between the finite population model and the sparse network limit model. We prove an $ε$-Nash equilibrium property for the obtained decentralized strategies.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22950v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Sparse optimal control for a class of infinite-dimensional bilinear systems: optimality conditions and uniqueness</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23098.html</link><guid isPermaLink="false">arxiv:2611.23098v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Redouane El Mezegueldy, Zakarya Dardour&lt;/p&gt;&lt;p&gt;We study optimal control of an evolution equation in which a scalar control multiplies a bounded operator acting on the state, with free dynamics given by a $C_0$-semigroup. The cost combines tracking terms, a quadratic control cost and an $L^1$ term promoting sparsity in time. We prove existence, derive optimality conditions, and show that optimal controls are thresholded functions of a switching function whose derivative is governed by the commutator of the drift and control operators. Consequently, commuting problems with a terminal cost admit no temporally sparse controls. The $L^1$ term also matters for uniqueness: two distinct controls satisfying the optimality conditions differ on a set of measure bounded from below, contained in the union of their supports, which yields, for the first time, uniqueness for every horizon in stable problems steered to zero. Second-order sufficient conditions and experiments on a bilinear heat equation complete the study.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23098v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] An algorithm for solving structured problems involving $L$-infimal convolutions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23100.html</link><guid isPermaLink="false">arxiv:2611.23100v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Cong Bang Vu, Xuan Nham Vu&lt;/p&gt;&lt;p&gt;We develop an operator-splitting framework for solving structured minimization problems involving linear compositions of $L$-infimal convolutions. We introduce a primal-dual shadow Douglas-Rachford splitting method and establish its convergence. As a result, we derive a fully primal-dual splitting algorithm for the class of the aforementioned minimization problems.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23100v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Global genetic inference at the scale of mass disasters</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23194.html</link><guid isPermaLink="false">arxiv:2611.23194v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><description>&lt;p&gt;Yourie Weesie, Ritsaart Bergsma, Aafko Boonstra&lt;/p&gt;&lt;p&gt;DNA-based disaster victim identification is commonly performed sequentially, with matches accepted before all genetic evidence is considered jointly. However, early matches may be incorrect or inconsistent with the globally most likely assignment, and treating them as final can affect subsequent identifications. Joint analysis avoids this dependence on decision order, but combinatorial growth has historically made it prohibitive in large cases. In this paper, we show that the general joint identification problem is NP-hard and develop a local-to-global framework for joint genetic inference at scale. We reduce the search using genetic compatibility tests, likelihood-based pruning of unlikely assignments, and symmetry reductions. We represent pedigree likelihoods as polynomials and reformulate the Elston-Stewart algorithm for efficient parallel likelihood evaluation on GPUs. Together, these advances yield a manageable set of candidate assignments and their likelihoods, from which we construct an integer linear program that resolves competing identifications and determines the global maximum-likelihood assignment. In small benchmarks, the method recovers the exhaustive-search optimum with up to 99.96% fewer likelihood evaluations. We also apply it to simulated disasters involving up to 10 thousand victims and missing persons. The framework is not limited to a single global optimum but yields a list of probable alternative assignments, thus providing a flexible tool to be used alongside other forensic evidence.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23194v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] An inexact stochastic variance-reduced gradient method for constrained convex finite-sum optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23221.html</link><guid isPermaLink="false">arxiv:2611.23221v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.OC</category><category>cs.LG</category><description>&lt;p&gt;Zhaosong Lu, Yifeng Xiao&lt;/p&gt;&lt;p&gt;In this paper, we study a class of constrained convex finite-sum optimization problems. In many practical applications, all or some of the constraints are hard constraints that represent imperative requirements. Consequently, any desirable approximate solution must (nearly) satisfy these constraints. Motivated by this, we focus on computing an $ε$-$surely\ feasible\ stochastic\ optimal$ ($ε$-SFSO) solution, in which the constraint violation is deterministically bounded by $ε$, and the expected optimality gap is at most $ε$. While a recently proposed stochastic variance-reduced first-order penalty method can compute an $ε$-SFSO solution, there remains a significant gap between its first-order oracle complexity for computing an $ε$-SFSO solution and that for computing an $ε$-$expected\ feasible\ stochastic\ optimal$ solution, where both the expected constraint violation and the expected optimality gap are bounded by $ε$. To narrow this gap, we propose an inexact stochastic variance-reduced gradient (SVRG) method that significantly improves the previously best-known first-order oracle complexity for computing an $ε$-SFSO solution. Furthermore, when the objective consists of a single function, the proposed method reduces to a novel deterministic first-order method for solving standard convex conic optimization. It achieves a significantly lower gradient evaluation complexity with respect to the objective function compared to existing methods, and can outperform them when computing constraint gradients and projections onto the associated cone is cheaper than evaluating the objective gradient. Preliminary numerical results are presented to illustrate the performance of the proposed method.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23221v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] A Proof of the Achlioptas-Friedgut Convergence Conjecture</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21665.html</link><guid isPermaLink="false">arxiv:2611.21665v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math.CO</category><description>&lt;p&gt;Gaia Carenini&lt;/p&gt;&lt;p&gt;For every fixed integer $q\ge3$, we show that the $q$-colourability transition in a sparse random graph takes place at a limiting edge density, thus proving the Achlioptas-Friedgut convergence conjecture. The proof adapts the argument we recently introduced to settle the satisfiability conjecture.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21665v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Adapted transport inequalities in continuous time</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21815.html</link><guid isPermaLink="false">arxiv:2611.21815v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math.FA</category><description>&lt;p&gt;Erhan Bayraktar, Fang Rui Lim&lt;/p&gt;&lt;p&gt;Given a strong solution $X$ to a stochastic differential equation (SDE), we establish sufficient conditions under which $\text{Law}(X)$ satisfies an adapted quadratic transport cost inequality (AQTCI) with respect to the semimartingale adapted Wasserstein distance. When the drift and diffusion coefficients are Markovian, we further show that the AQTCI tensorizes in a dimension-free manner. As a corollary, we show that various stochastic control problems, e.g. optimal stopping and mean-variance portfolio selection, are stable under bounded, measurable drift perturbations. Additionally, we derive concentration inequalities (with respect to certain dynamic risk measures) for stochastic integrals $\int H_s dX_s$ and deduce appropriate bounds on their tail behavior. Furthermore, using the functional Itô formula, we show that the AQTCI for $\text{Law}(X)$ allows one to deduce classical transport inequalities for $\text{Law}(F(X))$ even when $F$ is not Lipschitz on path space. Finally, we give sufficient conditions for $\text{Law}(X)$ to satisfy AQTCIs when $X$ is a solution to a scalar fractional SDE or stochastic Volterra equation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21815v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Avalanche Sharpness and the Stationary State of the Bak--Sneppen Model on $\mathbb Z^d$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21862.html</link><guid isPermaLink="false">arxiv:2611.21862v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Olivier Hénard&lt;/p&gt;&lt;p&gt;We establish the stationary picture for the nearest-neighbour Bak--Sneppen model on $\mathbb Z^d$, for every $d\ge1$. There exists a critical level $t_c$ such that, as $N\to\infty$, every fixed family of stationary fitnesses on the torus $(\mathbb Z/N\mathbb Z)^d$ converges, in exponential coordinates, to independent random variables with law $t_c+\operatorname{Exp}(1)$. The proof relies on three estimates for avalanches. For $d\ge2$, these replace the interval structure available in dimension one. We show that the threshold at which the mean avalanche range diverges coincides with the threshold for the appearance of an infinite avalanche, using the hierarchical structure of avalanches and an estimate on the creation of new sites under translation. We then prove that an avalanche reaching a macroscopic distance on the torus can, after any fixed positive increase of the level, be amplified into one covering the whole torus. Finally, below criticality, we obtain exponential integrability of the avalanche range and give a finite--infinite volume comparison. These three ingredients allow us to implement the Meester and Znamenski program that connects these avalanche estimates to the stationary law of the finite-volume process.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21862v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Stochastic differential delay equations with random delay driven by fractional Brownian motion</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21881.html</link><guid isPermaLink="false">arxiv:2611.21881v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Carles Rovira&lt;/p&gt;&lt;p&gt;We prove an existence and uniqueness result for stochastic differential delay equations driven by a fractional Brownian motion with Hurst parameter $H &amp;gt; \tfrac{1}{2}$, where the delay is a random process. Extending the pathwise Riemann--Stieltjes approach of Ferrante and Rovira \cite{FR2010}, we show that if the random delay $τ(\cdot,ω)$ has almost surely $γ$-Hölder continuous trajectories with $γδ&amp;gt; (1-H)/H$, where $δ\in(0,1]$ is the Hölder exponent of the gradient of the diffusion coefficient, then the equation has a unique solution with paths in $C^{1-α}(-r_0,T;R^d)\subset W_0^{α,\infty}(-r_0,T;R^d)$ for appropriate $α\in(1-H,\tfrac12)$. We also prove that the solution has moments of all orders when $γ&amp;gt;1/(2H)$ and the Hölder constant of the delay is bounded.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21881v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Fixed-Point Results and Disequilibrium for Negators of Hyperbolic-Valued Probability Distributions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22062.html</link><guid isPermaLink="false">arxiv:2611.22062v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>cs.IT</category><description>&lt;p&gt;Edil D. Molina, Juan Bory-Reyes, José M. Sigarreta&lt;/p&gt;&lt;p&gt;Hyperbolic-valued probability distributions provide a probabilistic setting in which mass, order, and uncertainty take values in the positive cone of the hyperbolic algebra. We study the fixed-point structure of hyperbolic probability negators and the behavior of hyperbolic-valued disequilibrium along their iterates. Starting from a hyperbolic-valued metric on each mass stratum, we define the associated disequilibrium as the separation between a distribution and the uniform distribution determined by its hyperbolic mass. We consider the disequilibria induced by the hyperbolic Euclidean, \(\ell_1\), and Jensen--Shannon metrics. Their hyperbolic Schur-convexity is established and sharp lower and upper bounds are obtained. We also characterize the possible fixed-point sets of hyperbolic negators through an order-theoretic condition and derive criteria ensuring uniqueness of the associated uniform distribution. The behavior of disequilibrium along the iterates of hyperbolic negators is then analyzed through two complementary mechanisms. Domination by Yager&amp;#x27;s negator yields exact decay factors for the Euclidean and \(\ell_1\) disequilibria and a uniform decay factor for the Jensen--Shannon disequilibrium. Independently, Lipschitz conditions for generated negators lead to positive linear comparison maps whose spectral radii control the asymptotic decay of disequilibrium. These results provide structural and quantitative conditions ensuring that hyperbolic-valued disequilibrium converges to zero under repeated probability negation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22062v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] A Brownian web invariance principle: Localized disturbance flows and Hastings-Levitov(0)</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22175.html</link><guid isPermaLink="false">arxiv:2611.22175v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math-ph</category><description>&lt;p&gt;Guanyi Chen, Xinyi Li, Eviatar B. Procaccia, Yuxuan Zong&lt;/p&gt;&lt;p&gt;We establish a Brownian web invariance principle for localized disturbance flows, providing a criterion that strengthens the weak-flow convergence of [Norris--Turner 2015, Ann. Probab. 43, 935--970] to path-Hausdorff convergence of their full trajectory collections. We apply this approach to the radial, stationary, and cylindrical versions of the Hastings--Levitov$(0)$ aggregation model, proving path-Hausdorff convergence of the full harmonic measure path collections to the (Cylindrical) Brownian web, together with joint convergence of the full gap--finger collections to geometric embeddings of the corresponding double Brownian webs. This extends the radial HL$(0)$ small-particle limits of [Norris--Turner 2012, Commun. Math. Phys. 316, 809--841] for the harmonic measure flow and finite gap--finger collections. In the radial and cylindrical HL$(0)$, we also show that the rescaled one-arm domination time converges to a multiple of the global coalescence time of coalescing Brownian motion on $\mathbb T$, with convergence of expectations. The main new ingredient is a three-point survival estimate, proved via a multiscale stopping-time decomposition.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22175v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Approximating Itô Processes in Adapted Wasserstein Distance with Finite Support Laws</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22282.html</link><guid isPermaLink="false">arxiv:2611.22282v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Xihao He, Fengyi Yuan&lt;/p&gt;&lt;p&gt;Motivated by finite-scenario surrogates in stopping and control problems, we study the approximation of Itô diffusion laws by laws supported on $M$ paths in an adapted Wasserstein distance, which we term adapted functional quantization. Under the strict adapted Wasserstein distance, no finite-support approximation can achieve vanishing error, while even under its relaxed counterpart, naive empirical measures still fail to converge. To resolve this, we develop a recursive conditional sampling algorithm and derive constructive upper bounds on the adapted quantization error. In one dimension, this yields the Brownian rate $(\log M)^{-1/2}$ for every diffusion with continuous coefficients of linear growth and pathwise uniqueness. In several dimensions, a quantitative Osgood stability condition with exponent $β$ yields the rate $(\log M)^{-η_p}$, where $η_p=\min\{1/2,β/(β+4p-2)\}$. Without the Osgood condition, we construct a two-dimensional diffusion with smooth bounded coefficients whose adapted quantization error decays more slowly than $(\log M)^{-γ}$ for any $γ&amp;gt;0$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22282v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Uniform spatial Schauder estimates for backward stochastic partial differential equations with random coefficients</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22285.html</link><guid isPermaLink="false">arxiv:2611.22285v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math.AP</category><category>math.OC</category><description>&lt;p&gt;Yunzhang Li, Shanjian Tang, Yuyang Ye&lt;/p&gt;&lt;p&gt;We prove spatial Schauder estimates for super-parabolic backward stochastic partial differential equations. All coefficients can be random and depend on time and space, and the estimates are uniform in probability and time. The key ingredient is a weighted conditional energy norm adapted to the parabolic scale of each frequency block. Together with heat-kernel bounds and coefficient freezing, it controls the gradient-martingale coupling without assuming a bounded martingale integrand. As an application, we establish Schauder solvability for semilinear stochastic Hamilton--Jacobi--Bellman equations.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22285v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Critical heavy traffic and diffusion limits for shortest-of-d dynamic routing</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22569.html</link><guid isPermaLink="false">arxiv:2611.22569v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>cs.PF</category><description>&lt;p&gt;Elmira Yu. Kalimulina&lt;/p&gt;&lt;p&gt;We study shortest-of-$d$ routing, with fixed $d\ge2$, in $N$ parallel queues with independent finite-state Markov service environments switching at rate $κ_N$. At the critical load $ρ_N=1-1/N$, the empirical measure of the centered queue lengths, under stationarity, converges in distribution to a random probability measure determined by its mean. We identify the mean&amp;#x27;s density and the conditional independence of fixed finite collections of centered queues in the limit. On time scales of order $N$, the centered empirical mean converges to a diffusion with explicit drift and constant diffusion coefficient. These limits hold when $κ_N/N\to\infty$, along subsequences with convergent lattice phase. The diffusion limit extends to centered initial empirical measures tight in the first Wasserstein topology, with means converging in law. A short initial layer prepares the limiting family while preserving the limiting mean. Empirical approximation holds in time-integrated Wasserstein distance.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22569v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Dependence properties between marginals of discrete-time maximum processes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22599.html</link><guid isPermaLink="false">arxiv:2611.22599v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Juan Baz, Franco Pellerey&lt;/p&gt;&lt;p&gt;Consider a discrete time sequence $(X_n,n\in\mathbb{N})$ and the corresponding process $(M_n,n\in\mathbb{N})$ which, at any time $n\in\mathbb{N}$, takes the maximum value reached by the process $(X_n,n\in\mathbb{N})$ up to that time. Clearly, there exists a dependence between the values assumed by the process $(M_n,n\in\mathbb{N})$ at two distinct points in time. This paper formally describes such a dependence in terms of the copula of the two random values. Various scenarios with respect to the sequence $(X_n,n\in\mathbb{N})$ are considered, e.g., without assuming independence in its components and/or identical distribution. Such explicit expressions of the copula are then used to provide results that describe how the dependence between the maxima reached by the sequence $(X_n,n\in\mathbb{N})$ in different times varies when both the time interval between them and/or their positions in the sequence are increased. In this context, asymptotic results are also provided.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22599v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Edge behavior of the KPZ fixed point under upper-tail conditioning</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22770.html</link><guid isPermaLink="false">arxiv:2611.22770v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math-ph</category><description>&lt;p&gt;Yuanyuan Liu, Zhipeng Liu, Haoyang Ying&lt;/p&gt;&lt;p&gt;We consider the KPZ fixed point $\mathcal{H}^{\mathrm{KPZ}}(x,t)$ with the narrow-wedge initial profile, conditioned on $\{\mathcal{H}^{\mathrm{KPZ}}(0,1)\ge L\}$ as $L\to\infty$. Our main result describes its fluctuations near the boundary of the region affected by the conditioning. More precisely, in the spatial window $x=t\sqrt L+O(1)$, the centered field converges in finite-dimensional distributions to the KPZ fixed point with a half-Brownian initial profile. The convergence holds jointly at arbitrary positive times, including times before and after the conditioning time. The proof is based on an asymptotic correspondence between conditional narrow-wedge multipoint formulas and those for the half-Brownian KPZ fixed point.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22770v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Non-local Transport Geometry for Papangelou Point Processes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22924.html</link><guid isPermaLink="false">arxiv:2611.22924v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Matthias Erbar, Martin Huesmann, Hanna Stange&lt;/p&gt;&lt;p&gt;We develop new analytical tools for the analysis of interacting point processes and their associated dynamics by introducing a non-local Benamou-Brenier-type transport distance tailored to (stationary) Papangelou point processes. Under a suitable Dobrushin-type condition, quantified by a constant $ζ$, we show that the natural spatial birth-and-death dynamics associated with a Papangelou point process is the EVI$(ζ)$-gradient flow of the (specific) relative entropy. Moreover, we establish $ζ$-geodesic convexity of the (specific) relative entropy and derive new functional inequalities, including HWI, Log-Sobolev, and Talagrand inequalities.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22924v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Stratonovich Waves Driven by Space-Time Gaussian Noise</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23014.html</link><guid isPermaLink="false">arxiv:2611.23014v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math.AP</category><description>&lt;p&gt;Le Chen&lt;/p&gt;&lt;p&gt;Motivated by Xia Chen&amp;#x27;s moment conjecture, we determine the exact second-moment asymptotics of the Stratonovich hyperbolic Anderson model in dimensions $d\in\{1,2,3\}$, driven by a centered Gaussian noise with temporal covariance $|s-t|^{-α_0}$ and an even, nonnegative, positive-definite tempered Radon spatial covariance $Γ$ homogeneous of order $-α$, where $0&amp;lt;α_0&amp;lt;1$, $0&amp;lt;α&amp;lt;d$ or $α=d=1$, and $α+α_0&amp;lt;2$. For initial displacement one and velocity zero, our main result is that $T^{-κ}\log\mathbb{E}u^2(T,x)$ converges, for every fixed $x$, to a constant $C_2(Γ,α_0)$, where $κ=(4-α-α_0)/(3-α)$. The constant is given by an intrinsic variational formula: a supremum over nonnegative smooth compactly supported space-time controls of twice the time integral of the square root of a Rayleigh value built from the covariance mean, minus half of the covariance variance. The variational class includes controls that do not separate in time and space, and the formula retains the original covariance amplitude, kinetic coefficient one and Gaussian cost. The constant is positive and finite when $Γ\neq0$. An independent upper bound establishes finiteness at the scale $T^κ$. The identification of the constant combines Gaussian phase operators, convergence from the regularized noise, estimates uniform in the spatial localization radius, and finite optimization with nonnegative Gram entries. We also bound the constant through spatial energies and occupation measures, with explicit bounds for spatial white noise in one dimension. The work was developed with AI assistance; the proofs have not yet been checked line by line by a human reader, and a public verification ledger records the status of each result.&lt;/p&gt;&lt;p&gt;code https://github.com/chenle02/stratonovich-ham-second-moment (no Lean project); code https://github.com/chenle02/stratonovich-ham-second-moment-lean (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23014v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Compensation Formulas for Branching Lévy Processes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23041.html</link><guid isPermaLink="false">arxiv:2611.23041v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Hao Wu, Wei Xu&lt;/p&gt;&lt;p&gt;This paper aims to establish two compensation formulas for branching Lévy processes. The first expresses expected sums over spatial jumps as integrals against the Lévy measure, with the future family of the jumping particle started from its position immediately after the jump. The second expresses expected sums over reproduction events as time integrals weighted by the branching rate and the offspring distribution, with each event marked by the ordered tuple of branching processes initiated by its offspring. Combined with the fixed-time many-to-one formula, it recovers the whole-tree many-to-one identity for functionals of ancestral spatial paths.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23041v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Spectral Classification of Random Skew-Kernel Matrices</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23095.html</link><guid isPermaLink="false">arxiv:2611.23095v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Guangqian Zhao&lt;/p&gt;&lt;p&gt;We study the unscaled empirical singular spectra of deterministic skew Hilbert--Schmidt kernels evaluated on independent isotropic rows satisfying a uniform quadratic-form variance bound. For arbitrary varying kernels at spatial dimension $d$, tightness and collapse to zero are characterized by boundedness and vanishing, respectively, of the rescaled quadratic energy remaining after deletion of $\lfloor\varepsilon d\rfloor$ leading skew pairs, for every $\varepsilon&amp;gt;0$. A regularized positive-covariance detector proves the necessary direction without a spectral envelope and retains diffuse energy across arbitrarily many small modes. On this exact tightness class, a weighted deterministic source characterizes all probability limits of the empirical spectra through the classical canonical parametrization of symmetric freely infinitely divisible laws. For a fixed kernel, convergence of one bounded resolvent response to a positive deterministic limit, convergence of one normalized logarithmic determinant, and full empirical spectral convergence are each equivalent to a critical Weyl law; the limit is necessarily a possibly degenerate half-Cauchy law. Finally, we give a necessary and sufficient criterion for polygonal Brownian Lévy-area spectra to recover the continuous-time bulk under arbitrary deterministic time partitions, even when the normalized mean-square matrix error diverges.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23095v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Cutoff on abelian groups</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23180.html</link><guid isPermaLink="false">arxiv:2611.23180v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><description>&lt;p&gt;Guy Blachar, Jonathan Hermon, Justin Salez&lt;/p&gt;&lt;p&gt;We prove the long-predicted equivalence between the cutoff phenomenon and the product condition along any sequence of abelian random walks whose inverse transition probabilities grow at most logarithmically with the size of the group. Our result does not require reversibility, and comes with a sharp quantitative estimate on the mixing window. Moreover, we show that our sparsity restriction is optimal by constructing abelian Cayley graphs which satisfy the product condition but fail to exhibit cutoff, and whose degrees are arbitrarily close to being logarithmic in the volume.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23180v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Second-class particle in ASEP. Rarefaction fan</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23191.html</link><guid isPermaLink="false">arxiv:2611.23191v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math-ph</category><description>&lt;p&gt;Alexey Bufetov, Adyan Dordzhiev&lt;/p&gt;&lt;p&gt;We study the asymptotic behavior of a second class particle in ASEP on the integer lattice. We prove a general formula for the distribution of its position at any fixed time for arbitrary initial conditions. As a first application, we obtain its limiting distribution for arbitrary initial conditions in the rarefaction fan case, generalizing the result of Cator--Pimentel from TASEP to ASEP.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23191v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.QA] iBraid group symmetries of iquantum groups via star product</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22344.html</link><guid isPermaLink="false">arxiv:2611.22344v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.QA</category><category>math.RT</category><description>&lt;p&gt;Ming Lu, Xujie Zhou&lt;/p&gt;&lt;p&gt;We establish ibraid group symmetries on universal iquantum groups of symmetrizable Kac-Moody type, proving a conjecture of Wang and Zhang. Building on the star product realization of quantum symmetric pairs $(\widetilde{\mathbf U},\widetilde{\mathbf U}^{\imath})$, we relate these symmetries to Lusztig&amp;#x27;s braid group symmetries, extending the compatibility previously obtained via iHopf algebras in the quasi-split setting. Via the Letzter map $ψ$ from the iquantum group $\widetilde{\mathbf U}^{\imath}$ to the horospherical algebra $\mathcal A\subset \widetilde{\mathbf U}$, we show that the ibraid group symmetry $\widetilde{\mathbf T}&amp;#x27;_{i,-1}$ of $\widetilde{\mathbf U}^{\imath}$ transported to $\mathcal A$ coincides with Lusztig&amp;#x27;s braid group symmetry $\widetilde T_{\mathbf r_i}^{-1}$ on the subalgebra $\mathcal R_{\bullet,i}^{-,r}$. Finally, a mixed product formula, together with a parabolic decomposition, yields an explicit formula for the transported action on the entire horospherical algebra $\mathcal A$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22344v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.QA] $D_n$-quasi-invariant polynomials in characteristic $p$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22534.html</link><guid isPermaLink="false">arxiv:2611.22534v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.QA</category><description>&lt;p&gt;Frank Wang&lt;/p&gt;&lt;p&gt;We give explicit descriptions of the $m$-harmonic polynomials for dihedral groups via hypergeometric functions. Using these, we compute the parameters $m$ for which the Hilbert series of the $D_n$-quasi-invariant polynomials in characteristic $p$ differs from the Hilbert series of $D_n$-quasi-invariant polynomials in characteristic $0$. We also give explicit descriptions of the generators of the $D_n$-quasi-invariant polynomials in characteristic $p$ when this is the case.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22534v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.QA] Riemannian geometry and quantum gravity on trees</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23103.html</link><guid isPermaLink="false">arxiv:2611.23103v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.QA</category><category>gr-qc</category><description>&lt;p&gt;Shahn Majid&lt;/p&gt;&lt;p&gt;We show that the tree graphs that admit a quantum Riemannian geometry (QRG) with a positive ratio metric are exactly the Dynkin graphs of finite type $A,D,E$ and affine type $\widetilde D,\widetilde E$. A metric in this context is an assignment of a nonzero real value to each arrow and positive ratio requires that the two directions on any edge have the same sign. It turns out that the metric value in one direction can be chosen freely and the other is then determined. For finite $A, D, E$ type, the construction involves $q$-integers where $q=e^{\imathπ/h}$ with $h$ the Coxeter number and there is a conjugate pair of $*$-preserving quantum Levi-Civita connections (QLCs). In the case of type $A$, these are necessarily contained in a previously known 1-parameter space of connections. For affine $\widetilde D,\widetilde E$ type, there is only one QLC, with real coefficients. Using the quantum Riemannian geometry, we construct a natural Einstein--Hilbert action and hence new quantum gravity models on $A_3,D_4,\widetilde D_4,\widetilde D_5,\widetilde D_6,\widetilde E_6$ in a functional integral approach, other than the 4-star $\widetilde D_4$ which we revisit.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23103v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.QA] Holomorphic Vector Bundles on the Quantum Projective Line</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23105.html</link><guid isPermaLink="false">arxiv:2611.23105v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.QA</category><category>math-ph</category><description>&lt;p&gt;P. Aschieri, M. Khalkhali, G. Landi&lt;/p&gt;&lt;p&gt;We study Birkhoff--Grothendieck splitting for holomorphic vector bundles on the quantum projective line in the Dolbeault-module framework. We prove that every polynomial holomorphic bundle admitting a finite filtration by standard line objects is a direct sum of standard lines, with uniquely determined splitting integers. The proof uses a Dolbeault differential graded category and the two-arrow Kronecker quiver. For a three-parameter rank-two extension family, we determine the splitting types and distinguish the nonzero splitting strata by the determinant of a quantum connecting map. For general non-diagonal rank-two connections, we derive noncommutative Riccati equations for invariant graph submodules and formulate the global splitting problem in terms of holomorphic projectors. We also discuss twisted positive Hochschild cocycles and formulate a variational principle and a conformal-stability conjecture. On the algebraic side, we explain why both the bare sheaf category of the quantum projective line and the Artin--Zhang category of the quantum plane inherit classical Birkhoff--Grothendieck splitting. We distinguish these results from unrestricted standard-line splitting, which fails for polynomial gauges, and outline a differential quantum GAGA programme with explicit attention to regularity and equivariance.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23105v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] The BMM symmetrising trace conjecture for all exceptional complex reflection groups</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21912.html</link><guid isPermaLink="false">arxiv:2611.21912v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><description>&lt;p&gt;Eirini Chavli, Maria Chlouveraki, Götz Pfeiffer, Kostas Psaromiligkos&lt;/p&gt;&lt;p&gt;We prove the symmetrising trace conjecture of Broué, Malle and Michel for the generic Hecke algebras of all exceptional complex reflection groups. A key ingredient is a new family of bases, constructed via breadth-first search, which generalise the standard basis of an Iwahori-Hecke algebra. These bases provide a uniform proof of the freeness conjecture of Broué, Malle and Rouquier for these groups. The verification for each group reduces to a finite computation, carried out using programs developed with the assistance of a large language model.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21912v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Exotic cluster structures on $Sp_{2n}$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22053.html</link><guid isPermaLink="false">arxiv:2611.22053v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.QA</category><description>&lt;p&gt;Idan Eisner, Salvatore Stella&lt;/p&gt;&lt;p&gt;We modify the seeds of Berenstein, Fomin and Zelevinsky attached to reduced words for~$(w_0,w_0)$, for any simply connected simple complex algebraic group and any aperiodic Belavin--Drinfeld pair. In every type, moves of words act on the resulting seeds by mutations. After a change of coordinates introduced by Gekhtman, Shapiro and Vainshtein, the seeds are, for $SL_N$, seeds of the cluster structures of these authors, and for $Sp_{2n}$ they define regular complete cluster structures with the expected properties. This proves the aperiodic version of their conjecture for $Sp_{2n}$, with its uniqueness part in a refined form.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22053v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] On representation-theoretic and homological properties of distance algebras of finite graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22478.html</link><guid isPermaLink="false">arxiv:2611.22478v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.CO</category><category>math.RA</category><description>&lt;p&gt;Aaron Chan, Bohan Xing&lt;/p&gt;&lt;p&gt;Distance algebras were introduced by Asao and Ivanov to realize magnitude homology and cohomology as bigraded Tor and Ext groups. We study the representation-theoretic and homological properties of the distance algebra $Σ_G$ of a finite connected graph $G$. We characterize the graphs for which $Σ_G$ is representation-finite, multiserial, biserial, or self-injective by an explicit graph-theoretic classification. We also compute the finitistic, self-injective, and dominant dimensions for several natural families of graphs. For a finite modular lattice $L$, we consider the distance algebra $Σ_L$ associated to the Hasse graph of $L$, and show that $Σ_L$ is Auslander--Gorenstein precisely when $L$ is a finite direct product of chains. We also present a family of minimal Auslander--Gorenstein distance algebras, namely, those associated to punctured hypercubes, whose finitistic (equivalently, self-injective; equivalently, dominant) dimension can be arbitrarily large.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22478v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Higher orbifold Euler characteristics of torus representations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22555.html</link><guid isPermaLink="false">arxiv:2611.22555v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.AT</category><description>&lt;p&gt;Nathaniel Peters, Christopher Seaton&lt;/p&gt;&lt;p&gt;We compute the $Γ$-Euler characteristic of a finite-dimensional representation of the compact torus $\mathbb{T}^k$ where $Γ$ is an arbitrary finitely presented group. We additionally compute the $Γ$-Euler characteristic of the unit sphere in such a representation as well as the corresponding symplectic quotient at a nonzero level of the moment map. In each case, the $Γ$-Euler characteristic is expressed in terms of the weight matrix for the representation as well as a description of the abelianization of $Γ$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22555v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Maximal defect $2$-blocks with dihedral defect groups up to splendid Morita equivalence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22560.html</link><guid isPermaLink="false">arxiv:2611.22560v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><description>&lt;p&gt;Shigeo Koshitani, Caroline Lassueur, İpek Tuvay, Deniz Yılmaz&lt;/p&gt;&lt;p&gt;We classify, up to splendid Morita equivalence, all maximal defect blocks whose defect groups are dihedral \(2\)-groups of order at least \(8\). The classification holds for blocks over an algebraically closed field as well as for those over a suitable discrete valuation ring of characteristic zero. As a consequence, Puig&amp;#x27;s conjecture holds for this infinite family of blocks. Beyond the classification result itself, a central feature of the present work is the variety of methods required in its proof. Our arguments combine classical techniques of block theory with a broad range of tools and techniques that have emerged over the past twenty-five years. Amongst others these include in a crucial manner the Gorenstein-Walter classification of finite groups with dihedral Sylow \(2\)-subgroups, Linckelmann&amp;#x27;s glueing of local Morita equivalences to obtain a stable equivalence of Morita type, the modern versions of Fong&amp;#x27;s 1st and 2nd reduction theorems in terms of splendid and endo-permutation source Morita equivalences, the structure of the Dade group of endo-permutation modules, Boltje-Perepelitsky&amp;#x27;s extended theory of Brauer pairs for \(p\)-permutation modules, the fusion systems of the blocks involved, or the concrete knowledge of their decomposition matrices.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22560v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Semisimplicity of Brauer algebras associated with finite Coxeter types</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22741.html</link><guid isPermaLink="false">arxiv:2611.22741v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><description>&lt;p&gt;Shoumin Liu, Yongzhi Luan&lt;/p&gt;&lt;p&gt;A finite-dimensional complex algebra is semisimple if its Jacobson radical is zero. In this paper, we determine the complex parameters for which Brauer algebras associated with finite Coxeter types are semisimple. We also determine semisimplicity at zero for the specified polynomial diagram forms and show that it can depend on the choice of polynomial form.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22741v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Invariant distributions and common denominators in the Bernstein center</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22801.html</link><guid isPermaLink="false">arxiv:2611.22801v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.NT</category><description>&lt;p&gt;Alexander Braverman, David Kazhdan&lt;/p&gt;&lt;p&gt;Let $G$ be a connected reductive group over a non-Archimedean local field. We conjecture that every invariant distribution whose support is compact modulo conjugation belongs to the rational Bernstein center. We also make an explicit conjecture about the ideal of possible denominators (the description is using a version of the local Langlands correspondence and involves working with endoscopic subgroups of $G$). We prove this for products of general linear groups; in this case the above idea is much more explicit and Langlands correspondence is not needed for its description (it is a principle ideal, where the generator is given by some version of the discriminant function). We also prove our general conjecture for $G=\mathrm{SL}(2)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22801v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Effective and explicit version of the Kazhdan - Yom-Din formula for characters of tempered representations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22821.html</link><guid isPermaLink="false">arxiv:2611.22821v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><description>&lt;p&gt;Avraham Aizenbud, Dmitry Gourevitch, David Kazhdan, Eitan Sayag&lt;/p&gt;&lt;p&gt;We provide an effective expression for the character of a tempered representation in terms of its matrix coefficient. This formula is an explicit version of a formula proven in [KYD22] which generalizes Harish-Chandra&amp;#x27;s formula for characters of discrete series representations, see [HC70, Theorem 9].&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22821v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] On Ext-groups between Arthur-type modules of the graded Hecke algebras of type A</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22961.html</link><guid isPermaLink="false">arxiv:2611.22961v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.NT</category><description>&lt;p&gt;Kei Yuen Chan, Peng Zhou&lt;/p&gt;&lt;p&gt;Let $\mathbb H_n$ be the graded Hecke algebra of type $A_{n-1}$. This article establishes a formula for Ext-groups between a Speh $\mathbb H_n$-module and a $W$-type $\mathbb H_n$-module in terms of Littlewood-Richardson coefficients. As a consequence, we obtain an explicit and efficient method to compute Ext-groups between a Speh $\mathbb H_n$-module and an Arthur-type module of $\mathbb H_n$. In particular, this proves new instances of a conjecture of Chan and Prasad on Ext non-vanishing between Arthur-type representations. We also discuss some other non-Ext vanishing results for calibrated modules.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22961v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] A Normal Form for Invertible Semilinear Maps and the Category of Isocrystals Over a Finite Field</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23162.html</link><guid isPermaLink="false">arxiv:2611.23162v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RT</category><category>math.NT</category><description>&lt;p&gt;Yuewen Qi, James Taylor&lt;/p&gt;&lt;p&gt;For a field $L$, and a finite order automorphism $σ$, we classify invertible $σ$-semilinear endomorphisms on finite-dimensional $L$-vector spaces up to equivalence. This is deduced as a consequence of a description, in terms of certain norm equations in finite extensions of $L$, of the semilinear Schur indices for the group $\mathbb{Z}$ acting on $L$ via $σ$. As an application, we give an explicit description of the category of isocrystals over a finite field.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23162v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RA] On continuous unitriangular matrices on \(\mathbb R^2\)</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22213.html</link><guid isPermaLink="false">arxiv:2611.22213v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.RA</category><description>&lt;p&gt;Jürgen Leiterer&lt;/p&gt;&lt;p&gt;Let \(\mathrm{SL}_2(\C)\) be the group of complex \(2\times 2\)-matrices with determinant \(1\). We prove that each continuous map \(A:\R^2\to\mathrm{SL}_2(\C)\) can be written in the form \[A=\begin{pmatrix}1&amp;amp;f_1\\0&amp;amp;1\end{pmatrix} \begin{pmatrix}1&amp;amp;0\\f_2&amp;amp;1\end{pmatrix} \begin{pmatrix}1&amp;amp;f_3\\0&amp;amp;1\end{pmatrix} \begin{pmatrix}1&amp;amp;0\\f_4&amp;amp;1\end{pmatrix} \begin{pmatrix}1&amp;amp;f_5\\0&amp;amp;1\end{pmatrix}, \] where \(f_1,\ldots,f_5:\R^2\to\C\) are continuous functions.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22213v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SP] Precise Eigenvalue Asymptotics for Electrostatic Layer Potential Operators</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22269.html</link><guid isPermaLink="false">arxiv:2611.22269v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SP</category><description>&lt;p&gt;Yong-Gwan Ji, Daisuke Kawagoe, Yoshihisa Miyanishi&lt;/p&gt;&lt;p&gt;We investigate the eigenvalue asymptotics of electrostatic layer potential operators associated with the Laplace equation on smooth bounded domains in two and three dimensions. In two dimensions, we establish precise eigenvalue asymptotics for the single-layer potential operator, up to a remainder of order $O(j^{-\infty})$. In three dimensions, we obtain refined eigenvalue asymptotics for the single-layer potential operator on arbitrary smooth surfaces and for the Neumann--Poincaré operator on smooth surfaces with everywhere positive Gaussian curvature. Under suitable nonperiodicity assumptions on the associated Hamiltonian flows, the remainder estimates in three dimensions improve to $o(j^{-1})$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22269v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SP] The Minimal Background Period for Infinitely Many Spectral Gaps in Anderson-Bernoulli Models</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22703.html</link><guid isPermaLink="false">arxiv:2611.22703v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SP</category><category>math.AP</category><category>math.DG</category><category>math.DS</category><category>math.SG</category><description>&lt;p&gt;Cong Chen, Yong Li&lt;/p&gt;&lt;p&gt;We prove that three is the smallest background period for which a one-dimensional discrete Anderson-Bernoulli operator can have infinitely many gaps in its almost-sure spectrum. For an explicit period-three background and coupling, we construct infinitely many bounded gaps accumulating from the right at a spectral energy, for every nondegenerate Bernoulli law. This property persists on an open set of background and coupling parameters. The proof combines a transverse heteroclinic connection and invariant multicones with spectral points from periodic realizations. A strict geometric window permits integer scale matching, and the required parameter inequalities are verified by exact rational arithmetic.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22703v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] When Is Membership Graded? Identifiability and Resolution Limits of a Graded Gaussian Mixture Model</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21863.html</link><guid isPermaLink="false">arxiv:2611.21863v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Sie Hendrata Dharmawan, Peter Chin&lt;/p&gt;&lt;p&gt;Mixed-membership models describe each unit as a graded blend of latent types. Before the blend is interpreted, the data should be able to rule out the simpler story in which every unit belongs to a single type. We ask when they can, in a scalar graded Gaussian mixture model, in which each observation is a Beta-weighted convex combination of independent Gaussian draws from two types, the mechanism behind functional mixed-membership models and the normal compositional model. The model is identifiable, unequal variances included, but the identifying information sits in the far tails of the marginal. For the symmetric model we give a closed-form hard-membership mixture that matches the graded marginal in five cumulants, and a Le Cam bound turns it into a certified sample size below which no test separates graded from hard membership with summed error under one half. The threshold is governed by the concentration $c$ relative to $c_0\approx d^2$, where $d$ is the type half-separation in within-type standard deviations. At $d=3$ it is about 2,600 observations at $c=3$ and 77,000 at $c=6$. Most of the difficulty comes from learning $c$. On 100 simulated datasets with graded membership, a correctly specified posterior under the default priors of a published Bayesian sampler for this model class reports hard membership every time, a weak prior gives intervals for the concentration spanning orders of magnitude, and the sampler&amp;#x27;s own answers depend on where it starts.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21863v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Simultaneous analysis of approximate leave-one-out cross-validation and mean-field inference II: General convex penalties</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21877.html</link><guid isPermaLink="false">arxiv:2611.21877v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Pierre C Bellec&lt;/p&gt;&lt;p&gt;For smooth penalties and group Lasso, analyzed approximate leave-one-out (ALO) cross-validation by comparing its weights with the trace correction used in mean-field inference. For a $C^2$ penalty $R$, the matrix entering these corrections is $A=[\nabla^2R(\widehat b)+X^TDX]^{-1}$, where $\widehat b$ is the full-data estimator and $D$ is the diagonal matrix of fitted loss curvatures; for group Lasso, the penalty and loss curvatures are first restricted to the active support before taking the pseudoinverse. The obstacle to extending this argument to general convex penalties was the lack of an explicit formula for the matrix $A$ entering these corrections. For every finite-valued strongly convex penalty, we construct such a matrix from ordinary derivatives of the penalty response at the observed subgradient. Its projection--pseudoinverse formula separates the response space and penalty curvature, fixed by conditioning, from the explicit design dependence. This supplies the missing ingredient to extend the probabilistic argument of Part~I. The construction recovers the inverse Hessian for smooth penalties and the active-group inverse for group Lasso, including inactive boundary groups. In the proportional regime, for Gaussian designs with general positive-definite covariance and covariance-scaled strong convexity, we obtain unconditional bounds comparing both ALO and mean-field predictions with exact leave-one-out predictions in regression and single-index models. The expected average squared prediction error is $O(n^{-1})$, and the expected absolute criterion error is $O(n^{-1/2})$, under bounded, 1-Lipschitz loss scores and suitable test functions. The matrix and ALO weights use only observed data; the mean-field correction additionally uses the design covariance. The construction, recovery identities and statistical guarantees are formalized in Lean~4.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21877v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Training Neural Networks to be Locally Adaptive</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22198.html</link><guid isPermaLink="false">arxiv:2611.22198v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><category>stat.ML</category><description>&lt;p&gt;Bilol Banerjee, Soham Sarkar&lt;/p&gt;&lt;p&gt;Deep neural networks fitted by global empirical risk minimization commit to a single model for the entire covariate space. In a regression problem, if the regression function $f_0$ is inhomogeneous --- varying rapidly in one region, while being nearly flat in another --- no single model can be appropriate everywhere, and the fit degrades where the function varies most rapidly. Here we study an alternative in which, instead of fitting the network globally, we fit it locally. For each query point $x$, a \emph{local neural network} is trained on the $k$ nearest-neighbours of $x$ alone, making the training sample and the fitted function query-dependent. We analyze the performance of the resulting estimator through a localization approach, establishing that the pointwise risk of the estimator with an appropriate choice of $k$ attains the rate $n^{-2α/(2α+d^{*})}$, up to logarithmic factors, when $f_0$ is locally $α$-Hölder with $α\in(0,1]$ and the covariates are supported on a $d^{*}$-dimensional manifold embedded in $\mathbb{R}^{d}$. A matching Le Cam lower bound shows that this rate is pointwise minimax optimal. However, the local rate-optimality requires $k$ to be calibrated to the smoothness of $f_0$, which is unknown in practice. We therefore provide a locally adaptive choice of $k$ that makes the neural network adapt to the local Hölder exponent of $f_0$ and to the intrinsic dimension simultaneously, both of which are potentially varying over the covariate domain. An extensive simulation study demonstrates the dominance of the locally adaptive neural network over a globally trained network and several state-of-the-art methods.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22198v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Anytime-valid inference for conditional hazard and survival functions with streaming data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22477.html</link><guid isPermaLink="false">arxiv:2611.22477v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Eni Musta, Valentin Patilea&lt;/p&gt;&lt;p&gt;We consider the nonparametric estimation of the conditional hazard, cumulative hazard and survival functions of a time-to-event variable from streaming data subject to censoring, truncation, or a cure fraction. A time-to-event model is a map from the distribution of the latent variables to that of the observed ones. For a large class of models this map has an explicit inverse, and the conditional hazard is the ratio of the density of the exactly observed durations to an at-risk function. Both are estimated by one-pass learners, in which each observation contributes once and is never revised, such as recursive kernel, series and histogram estimators. Our main result is an asymptotic confidence band sequence for the conditional hazard at a fixed covariate value, uniform in time and in the sample size, which allows monitoring after a burn-in, and stopping at a data-dependent time. The band can shrink at the optimal uniform rate up to a logarithmic factor. Bands for the cumulative hazard and the survival function follow. In simulations, a fixed-sample band inspected repeatedly fails in about half of the streams, while the miscoverage of the recommended bands stays below, or close to, the nominal level.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22477v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Bivariate Renyi Tsallis Divergence</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22510.html</link><guid isPermaLink="false">arxiv:2611.22510v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Suramya Surendran, Rajesh G&lt;/p&gt;&lt;p&gt;In this paper, a bivariate extension of the differential Renyi Tsallis divergence is introduced for comparing two absolutely continuous bivariate probability distributions. Fundamental properties of the proposed divergence are studied, including non negativity, pseudo additivity under component wise independence, and invariance under monotone and nonsingular linear transformations. Relationships with Renyi, Tsallis, alpha, Bhattacharyya, and Hellinger divergence measures are also established. A sensitivity analysis is performed to compare the Renyi, Tsallis and Renyi Tsallis divergences under the Marshall Olkin and Gumbel type bivariate exponential models, taking the magnitude of Kendall&amp;#x27;s rank correlation coefficient as a common scale for dependence. The proposed measure is further developed for bivariate order statistics, with particular emphasis on the joint distribution of the minimum and maximum order statistics for several lifetime distributions, including exponential, Weibull, Pareto, and Rayleigh models. When the underlying distributions are unknown, a nonparametric estimator is constructed using bivariate Gaussian kernel density estimators with plug in bandwidth selection. The proposed estimator is applied to a real life dataset and bootstrap resampling is used to assess estimation uncertainty. The results show the applicability of the proposed divergence for comparing bivariate distributions and indicate that its finite sample performance depends on the order parameter and the distributions being compared.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22510v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Exact and Approximate Maximum Likelihood Estimation for Multivariate Diffusions under High-Frequency Sampling</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22675.html</link><guid isPermaLink="false">arxiv:2611.22675v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><category>econ.EM</category><category>math.PR</category><description>&lt;p&gt;Duy Nguyen&lt;/p&gt;&lt;p&gt;We establish the asymptotic theory of the exact maximum likelihood estimator (MLE) for discretely observed multivariate ergodic diffusions under high-frequency, long-span sampling, solving an open problem posed by \citet{YCW2019} and \citet{Li2013}. The drift may grow linearly, and the volatility is bounded away from zero and either bounded or proportional to $1+|x|$. When the sampling interval decays polynomially, the exact MLE is consistent, asymptotically normal and efficient, with rates $\sqrt{nΔ_n}$ for drift and $\sqrt n$ for diffusion parameters. Under an additional condition on ergodic averages, and when the time span $nΔ_n$ also grows polynomially, its moments converge as well. The proof never analyzes the exact likelihood directly: it shows that a closed-form density expansion of sufficiently high order is uniformly accurate in relative terms at every observed transition, so that the two log-likelihoods differ by $o_P(1)$ uniformly in the parameter. The same argument yields accuracy conditions under which an approximate likelihood is asymptotically equivalent to the exact one; in particular, the approximate MLE of Yang, Chen and Wan converges to the true parameter. For the delta-expansion estimator of fixed order $K\ge1$, we derive the leading bias explicitly. It shows that $nΔ_n^{K+1}\to0$ cannot be weakened when the bias constant is nonzero, and that the bias falls on the drift parameters for even $K$ and on the diffusion parameters for odd $K$. Monte Carlo experiments confirm the predicted biases.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22675v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Covariate-Indexed Inclusion Probabilities on Unbalanced Panels</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22730.html</link><guid isPermaLink="false">arxiv:2611.22730v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><category>q-fin.ST</category><description>&lt;p&gt;Paul Schneider&lt;/p&gt;&lt;p&gt;We estimate the probability that an item with given covariates belongs to a set when the cross-section changes over time and items and periods are dependent. We propose two convex models whose fitted probabilities are nonnegative by construction and remain valid whatever the dependence between items, for which we establish consistency, finite-sample bounds and limit distributions for serially dependent panels. One suits events of moderate or high probability, the other rare events, and half the disagreement between their fits estimates a lower bound on the misspecification error of the worse fit, without knowledge of the true probabilities. On monthly US stock failures, the rare-event model predicts better than the ordinary logit and the classical failure logit. With the eight classical predictors, most of the gain comes from basis functions of the rank angle of each predictor and summary.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22730v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Testing the Pareto law through a Stein-Laplace characterization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22932.html</link><guid isPermaLink="false">arxiv:2611.22932v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Deepesh Bhati, Bruno Ebner, Sakshi Khandelwal&lt;/p&gt;&lt;p&gt;A Stein--Laplace characterization yields two closed-form goodness-of-fit statistics for the Pareto type-I family with unknown shape and known lower endpoint. The signed integral statistic $T_n$ has a standard normal limit after studentization, but explicit non-Pareto alternatives show that it is not omnibus consistent. The integrated squared discrepancy $S_n$ yields a consistent test against every fixed non-Pareto alternative on the specified support with a finite, positive logarithmic moment. We derive the weighted chi-square null limit of $nS_n$ and give conditions for an asymptotically valid parametric-bootstrap and plug-in covariance-operator method. The latter uses Nyström eigenvalue approximation to avoid repeated sample generation and parameter estimation. A large Monte Carlo comparison study shows competitive performance relative to existing procedures in the literature. In the paired study, the two calibrations have similar empirical power, with slightly higher small-sample rejection rates for the bootstrap in some settings. In the timing experiment, covariance-operator calibration is approximately $28$--$37$ times faster at $n=200$. An exploratory threshold-sensitivity analysis of Danish fire-insurance losses illustrates the dependence of Pareto goodness-of-fit conclusions on the specified tail region.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22932v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Identifiability of latent variable models with flexible latent distributions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23052.html</link><guid isPermaLink="false">arxiv:2611.23052v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Chengyu Cui, Gongjun Xu&lt;/p&gt;&lt;p&gt;Latent variable models are popularly used to characterize dependence among many observed variables through underlying latent variables. Recent advances in statistics and machine learning methods have encouraged growing interest in studying latent variable models with flexible latent distributions that capture complex latent structures. This flexibility, however, raises a fundamental question of whether model parameters can be identified when the latent distribution is unknown and must itself be learned. In this paper, we show that exact identifiability fails almost everywhere, in the sense that distinct but arbitrarily close pairs of model parameters and latent distributions can yield exactly the same distribution for the observed variables. Nonetheless, the resulting identification ambiguity is small. In particular, we prove that the identification ambiguity, measured by the diameter of the set of parameters inducing the same marginal distribution, vanishes at a superpolynomial rate of $\exp\{-c(\log p)^2\}$ as the number of observed variables $p$ grows. Building on this result, we show that the failure of exact identifiability need not preclude consistent estimation or valid inference of the model parameters and latent distribution. These results suggest that, when many variables are observed, the identifiability issue is far less of an obstacle to estimation and inference in latent variable models than is commonly expected.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23052v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Asymptotics of Gibbs Posterior Measures on Infinite-Dimensional Hypothesis Spaces</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23214.html</link><guid isPermaLink="false">arxiv:2611.23214v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.ST</category><description>&lt;p&gt;Terje Mildner&lt;/p&gt;&lt;p&gt;We prove almost sure contraction rates and consistency for Gibbs posterior measures on arbitrary hypothesis spaces, in general infinite dimensional, under dependent data, nonadditive and time-dependent losses and learning rates, misspecified models, and unattainable minimisers of the limiting objective. In particular, we develop a novel proof approach in contraction rate theory by studying the asymptotics of Gibbs measures through Lorentz spaces, real interpolation theory, and Laplace transforms dispensing with testing or variational formulations which are unavailable in the considered generality. As a consequence we obtain almost sure contraction rates for dominated Bayes and fractional Bayes posterior measures in the same generality, extending existing theory on misspecified Bayesian inference. Furthermore, we demonstrate our theoretical results on novel applications to Gibbs posteriors for Dirichlet process priors with a nonadditive Wasserstein metric loss function under ergodic, non-Markovian observables.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23214v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SG] The topology of the mean action spectrum</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22145.html</link><guid isPermaLink="false">arxiv:2611.22145v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SG</category><category>math.DS</category><description>&lt;p&gt;Habib Alizadeh, Dan Cristofaro-Gardiner, Abror Pirnapasov, Egor Shelukhin&lt;/p&gt;&lt;p&gt;We prove that if an area-preserving diffeomorphism of the closed two-disk is neither a pseudo-rotation nor a periodic map, then the closure of its mean action spectrum contains an interval of positive length. This partially answers a question of Hutchings. We do not require any additional assumptions on the area-preserving map, such as non-degeneracy or specific behavior near the boundary.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22145v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SG] Lagrangian structures, $r$-matrices and Poisson brackets</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22832.html</link><guid isPermaLink="false">arxiv:2611.22832v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SG</category><category>math.DG</category><description>&lt;p&gt;Daniel Álvarez&lt;/p&gt;&lt;p&gt;We give a global conceptual viewpoint of two constructions of Poisson structures involving $r$-matrices: the first one concerns coupling of generalized dynamical $r$-matrices with actions of quasi-triangular Lie bialgebras, the second one is given by the mixed products of Poisson spaces, which combine two Poisson actions of a quasi-triangular Lie bialgebra to create a new one. When the input Lie algebroids are integrable, we construct symplectic groupoids for both types of Poisson structures by taking fibred products of Lie groupoid morphisms equipped with shifted lagrangian structures. We illustrate our results with explicit examples coming from Lie theory and moduli spaces of flat bundles over surfaces.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22832v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SG] Calabi--Yau dimensions of monotone Fukaya summands from infinitesimal gradings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23163.html</link><guid isPermaLink="false">arxiv:2611.23163v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SG</category><category>math.AG</category><description>&lt;p&gt;Yonghwan Kim&lt;/p&gt;&lt;p&gt;We develop a theory of infinitesimal gradings for $\mathbb{Z}/2$-graded $A_\infty$-categories and use it to detect Calabi--Yau dimensions of monotone Fukaya summands from quantum cohomology. The dimensions we find agree with predictions from Serre functors of Kuznetsov components, such as $2$ for Gushel--Mukai and Verra fourfolds and the fractional value $\frac{n-2}{n}$ for the symplectic Grassmannian $\operatorname{IG}(2,2n)$. An infinitesimal grading induces endomorphisms on cohomological morphism spaces, and we prove a straightening theorem that realizes its weights as an actual grading compatible with the $A_\infty$-structure. We use this grading to show that Dehn twists give faithful braid group representations in the symplectic mapping class groups of Gushel--Mukai and Verra fourfolds.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23163v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] A singular minimizer of a uniformly convex Hessian-dependent functional</title><link>https://pragyaangaur.dev/Paperlane/p/2611.20396.html</link><guid isPermaLink="false">arxiv:2611.20396v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.AP</category><category>math.DG</category><description>&lt;p&gt;Arunima Bhattacharya, Anna Skorobogatova&lt;/p&gt;&lt;p&gt;We construct a smooth, uniformly convex Hessian-dependent energy functional, which admits a singular $C^{1,1}$ minimizer on $\mathbb{R}^5$ that is a two-homogeneous normalization of Cartan&amp;#x27;s five-dimensional cubic. Our construction relies on constructing a quadratic null Lagrangian for the Hessian that is suitably non-degenerate on the image of the Hessian for the candidate minimizer. This complements a partial regularity result previously obtained by the authors in this setting, and demonstrates that one cannot hope for a fourth-order version of classical second-order elliptic regularity theory à la De Giorgi-Nash-Moser.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.20396v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] $H_2$-optimal riblet profiles for turbulence suppression in channel flows</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22249.html</link><guid isPermaLink="false">arxiv:2611.22249v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.flu-dyn</category><category>math.AP</category><category>math.DS</category><category>math.OC</category><description>&lt;p&gt;Daniel W. Hartman, Armin Zare&lt;/p&gt;&lt;p&gt;The drag-reducing properties of streamwise-elongated surface corrugations, commonly referred to as riblets, have been extensively studied through experiments, simulations, and reduced-order modeling. Notably, the linearized Navier-Stokes framework introduced by Ran, Zare, and Jovanovic (J. Fluid Mech., vol. 906, 2021) employs volume penalization to model riblet-induced boundary conditions and predict drag reduction. These approaches typically quantify drag reduction as a function of a single geometric parameter, such as spanwise spacing or groove cross-sectional area, evaluated over fixed riblet shapes. As a result, identifying optimal riblet geometries across a broader design space often necessitates exhaustive parametric studies. To address this problem, we propose an optimization framework for the systematic design of optimal riblet shapes. Accordingly, we reformulate the volume penalization term in the linearized dynamics as a structured state-feedback operator. Targeting maximal suppression of turbulence, we pose a composite optimization problem that minimizes the steady-state variance of velocity fluctuations and riblet-induced dynamical augmentations while maintaining a constant bulk-flux. For a fixed spanwise wavelength (riblet spacing), this framework yields optimal wall-normal profiles that achieve maximal turbulence attenuation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22249v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AP] Stochastic Representation-Inspired Physics-Informed Neural Networks for Incompressible Fluid Flows</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22624.html</link><guid isPermaLink="false">arxiv:2611.22624v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.flu-dyn</category><category>math.AP</category><category>math.PR</category><description>&lt;p&gt;Zihao Guo, Zhongmin Qian&lt;/p&gt;&lt;p&gt;The effectiveness of neural networks in solving partial differential equations depends not only on their approximation capability but also on the suitability of their representations for the underlying solutions. Motivated by stochastic integral representations of incompressible fluid flows and the associated Biot--Savart kernel, we propose a Biot--Savart-informed (i.e. physics-informed) neural network (BS-PINN) for the incompressible Navier--Stokes equations. By extracting a rational profile from a regularized Biot--Savart kernel, we construct a smooth activation function with fixed and learnable kernel scales. Both variants retain the conventional velocity--pressure formulation and physics-informed training framework, allowing the influence of the activation function to be examined independently. We evaluate the method on five benchmarks, including Kovasznay flow, cylinder wake, three-dimensional Beltrami flow, Taylor--Green vortex, and double shear layer. Across 21 benchmark--architecture comparisons, both variants consistently reduce the combined velocity error relative to the conventional $\tanh$-based PINN, achieving mean relative error reductions of 31.7\% and 33.2\%, respectively. Improvements are also observed in reported pressure and vorticity errors. Notably, the double-shear-layer experiments demonstrate improved resolution of localized shear structures and, for BS-PINN-F, qualitatively clearer vortex-roll-up patterns in the long-time simulation. These findings highlight the potential of incorporating analytical flow structures into neural-network representations for incompressible flow simulations.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22624v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Optimal Network Design under Node Failures</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21856.html</link><guid isPermaLink="false">arxiv:2611.21856v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>econ.TH</category><category>math.CO</category><description>&lt;p&gt;Michele Lombardi, Francesco Umutcan, Enjun Liu&lt;/p&gt;&lt;p&gt;Networks are frequently constructed before it is determined which nodes will persist. We address the design problem in scenarios where nodes fail independently, links are costly and must be established in advance, and the benefits to surviving nodes diminish with distance. Examples include supplier, interbank, and infrastructure networks. Among all possible networks, the complete, star, and empty configurations are each welfare-optimal within specific ranges of link costs. However, with four or more nodes, failures introduce a range of costs in which every optimal network contains more links than the star but fewer than the complete network. At the lower end of this range, we show that the optimal networks are exactly those obtained by removing a matching from the complete network. We develop an exact algorithm for complete multipartite networks. It finds an optimal network by dynamic programming in a number of operations that grows with the fourth power of the number of nodes, although the class itself grows superpolynomially. For networks with up to six nodes, restricting the design to this class results in no loss under explicit conditions. We also characterize pairwise-stable networks within this class and establish their existence for every level of link cost. Finally, we quantify the cost of misjudging failure risk. Overestimating node survival leads to overbuilding and can yield lower welfare than building nothing, whereas underestimating it never does. Under uncertain failure risk, design should therefore favor conservative reliability estimates.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21856v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Single-Vertex Metropolis on Minor-Free Graphs: A General EPTAS</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22023.html</link><guid isPermaLink="false">arxiv:2611.22023v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.DS</category><category>math.CO</category><description>&lt;p&gt;Daniel Skachkov, Yuriy Dorn&lt;/p&gt;&lt;p&gt;We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is preserved by taking induced subgraphs and disjoint unions, holds for all edgeless graphs, and can be tested in polynomial time. We study the single-vertex Metropolis process for this class of problems. We show that on graphs excluding an arbitrary fixed minor $H$, this process is a randomized efficient polynomial-time approximation scheme. Starting from any feasible solution on a graph with $n$ vertices, it finds a $(1-\varepsilon)$-approximation within $\exp(O_H(\varepsilon^{-2})) n(n+\log(1/δ))$ steps with probability at least $1-δ$. This includes maximum independent set, maximum induced forest, maximum induced bipartite subgraph, and maximum induced subgraph of degree at most one. The proof uses improving exchanges on one fixed division of the input graph into regions. A recursive separator construction performs each exchange inside a region of size $r$ in at most $2r$ moves, with temporary loss $O_H(\sqrt r)$. We count move sequences through each transition and bound the probability of avoiding all near-optimal states. The general theorem bounds the number of Metropolis steps in terms of the temporary loss along improvement paths. We extend the result to bounded weight imbalance and give a weighted-star obstruction for unrestricted weights.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22023v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Derandomized Sunflowers and Radical Lower Bounds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23109.html</link><guid isPermaLink="false">arxiv:2611.23109v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.CC</category><category>math.CO</category><description>&lt;p&gt;Bruno Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff&lt;/p&gt;&lt;p&gt;Robust Sunflower lemmas imply that any large enough monotone DNF of width $w$ contains a sunflower, i.e., a DNF equivalent to the conjunction of a common core with a DNF that is heavily biased towards $1$. While these lemmas are typically proved in the context of the uniform distribution or i.i.d. distributions, they also hold for $O(w^2)$-wise independent distributions by Bazzi&amp;#x27;s theorem (Bazzi (SICOMP 2009); Tal (CCC 2017)), which states that width-$w$ DNFs cannot distinguish between such distributions and the uniform distribution. We prove a derandomization of robust sunflower lemmas for $O(w)$-wise independent distributions, which recovers the derandomization above with slightly weaker parameters. Notably, our result also holds for distributions whose marginals are &amp;quot;locally independent&amp;quot; and &amp;quot;approximately identically&amp;quot; distributed. It is not known whether such distributions fool general DNFs, which makes the derandomization via DNF-fooling techniques unavailable. Our proof of this derandomization is via the method of moments, which might be of independent interest. We apply this result to obtain improved separations between non-monotone arithmetic circuits and the radical of monotone circuits. Specifically, we construct an explicit family of multilinear polynomials $P_n$ that have small non-monotone arithmetic circuits such that any power of $P_n$ cannot be computed by monotone arithmetic circuits of sub-exponential size. This improves on a recent result of Cavalar, Fabris, Mukhopadhyay, Srinivasan and Yehudayoff (STOC 2026), who proved a non-explicit separation that was quasipolynomial. Our construction uses Nisan-Wigderson designs with an additional linear-algebraic expansion property.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23109v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DG] Structured Design of Layered Sparse Unitary Space-Time Modulation for Integrated Noncoherent and Coherent MIMO Communications</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22763.html</link><guid isPermaLink="false">arxiv:2611.22763v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SP</category><category>math.DG</category><description>&lt;p&gt;Álvaro Pendás-Recondo, Enrique Pendás-Recondo, Rafael González Ayestarán, Jesús Alberto López-Fernández, Ignacio Santamaria&lt;/p&gt;&lt;p&gt;This work presents a novel structured constellation design based on unitary space-time modulation (USTM) for integrated noncoherent and coherent multiple-input multiple-output (MIMO) communications. Information is encoded into the sparse space-time matrices through two layers: a noncoherent layer that distinguishes points on the Grassmann manifold (subspaces) and a coherent layer that distinguishes among the Stiefel representatives associated with each of those points (bases for the subspaces). We consider sequential decoding of the two layers to reduce computational complexity, while explicitly identifying the matrix structures that favor this decoding strategy. The proposed constellation builds on a previous structured Grassmannian signaling design, which has the remarkable property of producing space-time matrices with a single nonzero entry per row, while introducing a novel systematic design for the second layer corresponding to the Stiefel representatives. The design of the second layer preserves the sparsity of the first layer and significantly reduces the decoding computational complexity, while ensuring reliable performance under sequential decoding and enabling a simple yet effective bit labeling, as validated by numerical results in terms of bit error rate (BER) and symbol error rate (SER). Numerical results also show graceful performance degradation under channel correlation and, for limited coherence intervals where channel state information at the receiver (CSIR) can be estimated only imperfectly, improved performance compared with classical space-time block coding (STBC) schemes based on QAM and PSK.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22763v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Cycles of Arbitrary Period in Multidimensional Heterogeneous Hegselmann-Krause Dynamics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21656.html</link><guid isPermaLink="false">arxiv:2611.21656v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.soc-ph</category><category>cs.MA</category><category>cs.SI</category><category>eess.SY</category><category>math.DS</category><category>math.OC</category><description>&lt;p&gt;Anton V. Proskurnikov, Iryna Zabarianska&lt;/p&gt;&lt;p&gt;We study periodic behavior in heterogeneous Hegselmann-Krause opinion dynamics with multidimensional opinions and norm-defined confidence neighborhoods. We prove that, for every dimension $d\ge3$, every $\ell_q$ norm with $q\in[1,\infty]\setminus\{2\}$, and every integer $m\ge2$, a system of five agents admits a periodic trajectory of minimal period $m$; moreover, different periods can coexist for fixed confidence radii. Four agents remain stationary, while the fifth moves along a line segment contained in their convex hull. The stationary agents may share a common strictly positive confidence radius, and all confidence inequalities are strict. A geometric criterion underlying the construction extends these results to further classes of norms. However, this criterion cannot be satisfied in dimensions one and two, regardless of the confidence norm. We also prove that no heterogeneous Hegselmann-Krause system with less than five agents admits a nonconstant periodic trajectory, under any norm and in any dimension; every trajectory with at most three agents converges exponentially.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21656v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Large Language Models as Nonlinear Dynamical Systems: The Three Clocks of Depth, Training, and Generation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21983.html</link><guid isPermaLink="false">arxiv:2611.21983v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.LG</category><category>cs.CL</category><category>math.DS</category><category>nlin.CD</category><description>&lt;p&gt;Maor Farid&lt;/p&gt;&lt;p&gt;Language models are dynamical systems. A transformer is iterated over its layers, over the steps of its training and over the tokens it generates, and on each of these three clocks it shows behavior that nonlinear dynamics has studied for a century: fixed points, bifurcations, synchronization, chaos and noise-driven escape from potential wells. The two communities rarely meet, so this behavior is often rediscovered under new names. We build a bridge between them. To describe, we condense about 200 papers into the Three-Clock Dictionary, which maps fifteen concepts of nonlinear dynamics onto each clock and marks every correspondence as proved, measured or conjectured, and we show each concept in a mechanical system and in a language model side by side. To explain, we derive reduced-order models: the softmax is a Boltzmann distribution, gradient descent an Euler step on a nonlinear spring, a loss spike a ball thrown out of a stiff valley, attention on the circle a Kuramoto model, and a repetition loop a well that deepens while it is occupied. We then test these explanations on open language models, on a laptop CPU. Escape from repetition loops in GPT-2 and Pythia follows the Arrhenius law with the logit gap as the barrier, and the barrier deepens and then saturates, so the temperature needed to leave a loop falls like $1/\ln N$ with the generation length $N$ and rises with model size. Coherent text lives in a narrow window of temperatures, which a small reasoning model shares at its recommended temperature. Training makes each Pythia layer more expansive, and a small transformer trains at a multi-mode edge of stability. The third step, solving problems of language models, is still ahead: controllers derived from the escape analysis remove loops but do not yet beat the best fixed temperature. We state twelve open problems where nonlinear dynamics could get there.&lt;/p&gt;&lt;p&gt;code https://github.com/maorfarid1/three-clocks (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21983v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Strong Transitivity of Group Cellular Automata: Characterization and Decidability</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22365.html</link><guid isPermaLink="false">arxiv:2611.22365v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.DM</category><category>cs.FL</category><category>math.DS</category><description>&lt;p&gt;Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara&lt;/p&gt;&lt;p&gt;A discrete-time dynamical system is strongly transitive if every point can be reached, in finitely many steps, from every non-empty open set. We study this property for group cellular automata, \ie cellular automata over a finite group alphabet whose global map is a group endomorphism, in every dimension $d\geq1$. We prove that no group cellular automaton over a non-abelian group is strongly transitive, and we develop a decomposition of group cellular automata over abelian groups, via quotients by power subgroups, which preserves strong transitivity. For linear cellular automata over $(\mathbb Z/p\mathbb Z)^n$ we use Pontryagin duality to characterize strong transitivity in terms of the characteristic polynomial $χ_A$ of the associated matrix $A$ of Laurent polynomials: the automaton is strongly transitive if and only if $\det(A)\neq0$ and no irreducible factor of $χ_A$ has an invertible constant term. Combining these results, we obtain that strong transitivity is decidable for group cellular automata in every dimension. For every fixed dimension $d$, we give an explicit decision procedure whose running time is polynomial in the group size $N$, the number $k$ of neighbours, and the neighbourhood radius $\varrho$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22365v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Feedback and Resource Competition in Incoherent Feedforward Loops: When Is Cumulative Dose Ordering Preserved?</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22710.html</link><guid isPermaLink="false">arxiv:2611.22710v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>q-bio.MN</category><category>math.DS</category><description>&lt;p&gt;Iva Janković, Fabiana Calandra, Giansimone Perrino, Velia Siciliano, Filippo Menolascina&lt;/p&gt;&lt;p&gt;Biochemical coupling can change the expression levels and timing predicted by an incoherent feedforward loop (IFFL) model without changing cumulative dose ordering. We derive ordering conditions using shared-production identities and Metzler comparison bounds, with tail guarantees beyond finite computation. A nonlinear example exhibits delayed slope reversal at a fixed dose, on an $O(1/η)$ timescale as pathway mismatch $η$ vanishes. At one fixed joint fit, validated bounds establish decreasing cumulative output across 20-100 ng nominal burden, from zero to full target loading, at every positive finite observation time for a translation-blocking model and an RNA-decay model. Full loading at 20 ng reduces 48-hour cumulative output by 13.35% and 10.18%, respectively, while endpoint concentration in the first model changes by only +0.15%. Preserved ordering therefore does not ensure quantitative agreement.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22710v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.DS] Dynamics-preserving graph sparsification</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23176.html</link><guid isPermaLink="false">arxiv:2611.23176v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>nlin.AO</category><category>math.DS</category><description>&lt;p&gt;Emmie Fitz-Gibbon, Maximilian Jerdee, Yuanzhao Zhang, Rosemary Braun, Cristopher Moore&lt;/p&gt;&lt;p&gt;Many dynamical systems unfold on networks of nodes coupled by edge interactions. This work is motivated by the following question: can we remove most edges from a networked dynamical system without significantly altering its behavior? For a given network, our goal is to find a sparser network that approximately preserves the dynamics on the nodes. We first study linear diffusion, where node values evolve according to the graph Laplacian. The dominant network sparsification method, effective resistance sampling, preserves all Laplacian eigenvalues within a uniform multiplicative bound. We show that with a limited edge budget, this is dynamically inefficient: diffusion is dominated by the slowest-decaying modes, so enforcing a uniform guarantee spends edges on fast modes that barely affect long-term dynamics. Based on this observation, we derive Diffusion Spectral Error (DSE), which evaluates in closed form the typical error in trajectories between the original and sparsified graphs over random initial conditions. Minimizing this error, which naturally prioritizes slow modes, yields sparse networks explicitly designed to preserve dynamics. At the same sparsification levels, DSE sparsification often preserves diffusion dynamics with several-fold lower error than effective resistance sampling, and up to two orders of magnitude lower on strongly modular networks. Although derived in a linear context, we empirically find that DSE sparsification gives similar improvements in the Kuramoto model (a nonlinear system of coupled oscillators), where DSE sparsification approximately preserves the synchronization threshold and, at strong coupling, order-parameter trajectories.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23176v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GR] A faster algorithm for commutator length in free groups</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22303.html</link><guid isPermaLink="false">arxiv:2611.22303v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.DS</category><category>math.GR</category><description>&lt;p&gt;Zixing Wang&lt;/p&gt;&lt;p&gt;We compute the commutator length $\cl(w)$ of a reduced word $w\in[F,F]$ of length $M$ in a free group. Given a target $g\ge1$, a deterministic algorithm decides $\cl(w)\le g$ and, when it holds, returns a decomposition into at most $g$ commutators, in $O(M^{3g})$ steps; trying $g=1,2,\dots$ gives $\cl(w)$ in $O(M^{3\cl(w)})$ steps. For $g=1$ the same test takes $O(M)$ expected steps on a uniformly random reduced input in $[F,F]$. All bounds are in the unit-cost model.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22303v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Semantic Communication via Analog RF Computing: When the Radio Computes the Meaning</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22100.html</link><guid isPermaLink="false">arxiv:2611.22100v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SP</category><category>cs.AI</category><category>cs.IT</category><description>&lt;p&gt;Christo Kurisummoottil Thomas&lt;/p&gt;&lt;p&gt;Semantic communication (SC) systems transmit continuous latent representations of meaning, but computing the semantic encoder at resource-constrained edge devices incurs substantial energy and memory costs. To address this challenge, we propose an end-to-end SC framework that executes the semantic encoder in the client&amp;#x27;s RF receiver front end using analog RF computing. A base station (BS) broadcasts encoder weights as RF waveforms, while each edge device reuses its receiver&amp;#x27;s passive mixer to compute semantic latents at ultra-low energy. These latents are transmitted over the uplink for network-side task inference. We show that analog computing noise across encoder layers and channel noise affecting transmitted latents admit a unified mathematical model. We define a task-posterior semantic distortion metric and derive its second-order decomposition into per-client, per-stage semantic sensitivities. Using this decomposition, we obtain a closed-form semantic-aware water-filling allocation of the total client energy budget across clients, encoder layers, and uplinks, assigning tighter accuracy targets to semantically sensitive stages. This allocation induces a broadcast beamforming problem that accounts for client-specific, per-layer accuracy requirements. We further refine the allocation through stochastic optimization and jointly design it with multi-task noise-aware training of the shared semantic model. MNIST simulations show that, at matched total client energy, the proposed allocation reduces network semantic distortion by 9.2\%-19.2\% compared with uniform precision and 5.1\%-13.1\% compared with client-blind allocation. Noise-aware co-design yields a further 46\% reduction.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22100v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] FAST: Functional Adaptive Sensing and Testing for Quickest Change Detection</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22581.html</link><guid isPermaLink="false">arxiv:2611.22581v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>stat.ME</category><category>cs.IT</category><description>&lt;p&gt;Peiyao Liu, Jie Guo, Zhijun Wang, Xueru Zhang, Nan Chen&lt;/p&gt;&lt;p&gt;Quickest change detection (QCD) is studied for partially observed functional data streams. At each sampling epoch, a function is realized over a continuous domain, but its values can be observed at only a fixed number of locations. At an unknown change point, the functional mean undergoes a shift that is assumed to admit a sparse representation in a localized basis. We propose Functional Adaptive Sensing and Testing (FAST), which jointly estimates the unknown post-change parameter, selects sensing locations, and performs sequential detection. A minimax lower bound on the worst-case detection delay is derived under an average-run-length constraint. A non-asymptotic estimation-error bound is established for the policy-dependent observations induced by adaptive sensing. Under the stated regularity conditions, FAST is first-order asymptotically optimal when sensing subsets are optimized exactly. Simulations and a wildfire case study demonstrate the performance of the proposed procedure.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22581v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] Pluggable Subband-Decoupled Fusion and Unlabeled Capture Prototype Calibration: Bridging High-SNR Null-Subcarrier Regrowth and Low-SNR Coherent Preambles for Cross-Domain IoT RF Fingerprinting</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22812.html</link><guid isPermaLink="false">arxiv:2611.22812v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.AI</category><category>cs.IT</category><category>eess.AS</category><category>eess.SP</category><description>&lt;p&gt;Fengchong Yao, Jianbing Li, Qing Liu, Kefeng Song, Haitao Li, Song Wang, Kunpeng Wang&lt;/p&gt;&lt;p&gt;Zero-overhead physical-layer authentication at edge wireless access points (APs) is vital for securing resource-constrained Internet of Things (IoT) transceivers against credential cloning, yet cross-domain IEEE 802.11a/g radio frequency fingerprint identification (RFFI) faces an acute signal-to-noise ratio (SNR) crossover. Power-amplifier spectral regrowth on unpopulated null subcarriers resists indoor multipath at high SNR but decays quadratically below the thermal noise floor, whereas populated active in-band preambles survive low SNR yet degrade under severe multipath, causing static fusion to lose up to 44.7 percentage points (pp). To our knowledge, we propose the first RFFI framework that dynamically modulates active in-band waveforms and unpopulated null-subcarrier regrowth via a blind physical SNR gate: Pluggable Gated Subband-Decoupled Fusion with Unlabeled Capture-Aware Prototype Calibration (GSDF-CAPC). Avoiding the 20-35 dB subband gradient imbalance of joint training, GSDF pairs any frozen pretrained host backbone with a 46.3K null-subcarrier plug-in encoder (NS-Branch), fusing scale-standardized logits and gate-warped spherical embeddings under a source-calibrated lag-64 thermal-SNR gate with exact low-SNR fallback. Over unlabeled target AP captures, forward-only unbalanced optimal-transport calibration (UOT-CAPC) aligns shifted prototypes under packet-arrival skew and recovers parameter-free balanced Sinkhorn (U-CAPC) at equipartition. Across DataPort-WiFi, WiSig, and ORBIT MobRFFI, zero-retrain GSDF wins all 72/72 paired runs across eight backbones with 0.00 pp low-SNR loss, while edge IB-Host + GSDF (92.6K-93.3K active parameters, 1.82 ms single-core CPU latency) and timing-synchronized GSDF-STO / GSDF-Tri reach 57.50%-65.05% three-benchmark Macro-F1 (89.04%-100.00% over 5-10-packet IoT bursts).&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22812v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] blaris: Windowless Random-Access LZSS for Constrained Microcontrollers</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22900.html</link><guid isPermaLink="false">arxiv:2611.22900v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.AR</category><category>cs.IT</category><description>&lt;p&gt;Ihor Lukianov&lt;/p&gt;&lt;p&gt;Embedded LZ77 decompressors (such as heatshrink and tamp) require an in-RAM sliding window that couples memory usage to compression ratio and incurs high latency on random-access reads. We present blaris, a lightweight, windowless LZSS decompressor for execute-in-place (XIP) random access on constrained microcontrollers. By partitioning tokens into bidirectionally traversable streams with power-of-two checkpoints, blaris resolves back-references directly in the compressed payload, achieving compression ratios comparable to high-window heatshrink and tamp configurations without allocating a RAM window. Targeting compress-on-host, decompress-on-device workflows, blaris assumes trusted build-time payloads and omits runtime error and bounds checks. On RV32IMC, it requires just 548-784 B of Flash and 104-112 B of total RAM, achieving orders-of-magnitude faster small-slice random reads than ratio-matched, block-indexed heatshrink and tamp.&lt;/p&gt;&lt;p&gt;code https://github.com/lis05/blaris (no Lean project)&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22900v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.LO] Boxes in Infinite Words: Complexity, Automata, and Point Modules</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21772.html</link><guid isPermaLink="false">arxiv:2611.21772v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.FL</category><category>math.LO</category><category>math.RA</category><description>&lt;p&gt;Jason Bell&lt;/p&gt;&lt;p&gt;Motivated by the geometry of point modules over monomial algebras, we introduce a box-counting function associated to a right-infinite word over a finite alphabet. An extendable box is a family of finite words obtained by choosing letters independently at each position, subject to the condition that all choices admit a common infinite right continuation in the associated subshift. We prove several results for these functions for words of linearly bounded complexity. For $k$-automatic words, we show using techniques from first-order logic that the total box-counting function is $k$-regular. Finally, we apply our results to prove eventual affine growth of the number of positive-dimensional irreducible components in finite projections of point-module spaces associated to semiprime monomial algebras of at most quadratic growth.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21772v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Micro-Macro Tensor Neural Surrogates for Uncertainty Quantification in Collisional Plasma</title><link>https://pragyaangaur.dev/Paperlane/p/2512.24205.html</link><guid isPermaLink="false">arxiv:2512.24205v2</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.LG</category><category>math-ph</category><category>physics.comp-ph</category><category>physics.plasm-ph</category><description>&lt;p&gt;Wei Chen, Giacomo Dimarco, Lorenzo Pareschi&lt;/p&gt;&lt;p&gt;Plasma kinetic equations exhibit pronounced sensitivity to microscopic perturbations in model parameters and data, making reliable and efficient uncertainty quantification (UQ) essential for predictive simulations. However, the cost of uncertainty sampling, the high-dimensional phase space, and multiscale stiffness pose severe challenges to both computational efficiency and error control in traditional numerical methods. These aspects are further emphasized in presence of collisions where the high-dimensional nonlocal collision integrations and conservation properties pose severe constraints. To overcome this, we present a variance-reduced Monte Carlo framework for UQ in the Vlasov--Poisson--Landau (VPL) system, in which neural network surrogates replace the multiple costly evaluations of the Landau collision term. The method couples a high-fidelity, asymptotic-preserving VPL solver with inexpensive, strongly correlated surrogates based on the Vlasov--Poisson--Fokker--Planck (VPFP) and Euler--Poisson (EP) equations. For the surrogate models, we introduce a generalization of the separable physics-informed neural network (SPINN), developing a class of tensor neural networks based on an anisotropic micro-macro decomposition, to reduce velocity-moment costs, model complexity, and the curse of dimensionality. To further increase correlation with VPL, we calibrate the VPFP model and design an asymptotic-preserving SPINN whose small- and large-Knudsen limits recover the EP and VP systems, respectively. Numerical experiments show substantial variance reduction over standard Monte Carlo, accurate statistics with far fewer high-fidelity samples, and lower wall-clock time, while maintaining robustness to stochastic dimension.&lt;/p&gt;&lt;p&gt;new version v2&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2512.24205v2&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Complexity and symmetry: The asymmetry factor approach</title><link>https://pragyaangaur.dev/Paperlane/p/2611.17940.html</link><guid isPermaLink="false">arxiv:2611.17940v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>gr-qc</category><category>math-ph</category><description>&lt;p&gt;L. Herrera&lt;/p&gt;&lt;p&gt;We study the influence of the instantaneous appearance of a time-like Killing vector (TKV) in self-gravitating fluid spheres during their evolution. For doing so we resort to the concept of asymmetry factor which allows the existence of any specific type of symmetry (e.g. a TKV), exclusively, for a given value of the time-like coordinate. We consider adiabatic and dissipative fluids. The analysis of different relevant physical variables in this process shows the imprints of the emergence of TKV at some point of the evolution. Particular attention is paid to the relationship appearing between the TKV, and the complexity factor describing the degree of complexity of the fluid, bringing out for the first time a link between complexity and symmetry.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.17940v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Lifting asymptotic symmetries from metric to tetrad formulation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21296.html</link><guid isPermaLink="false">arxiv:2611.21296v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>gr-qc</category><category>math-ph</category><description>&lt;p&gt;Antoine Vincenti&lt;/p&gt;&lt;p&gt;Metric solution spaces defined by gauge and boundary conditions are associated with a residual symmetry algebra, consisting of the diffeomorphism generators whose action preserves these conditions. Describing a metric solution space in terms of tetrad variables adds a local Lorentz freedom. When part of this freedom is fixed by additional tetrad gauge and boundary conditions, metric residual symmetries must be supplemented by compensating Lorentz transformations. If a residual Lorentz freedom remains, there is an ambiguity in these compensating transformations. The most direct choices generally fail to realize the metric residual symmetry algebra as a subalgebra of the tetrad one, because of a field-dependent cocycle. We show that a reference tetrad, that is a section of the tetrad solution space seen as a principal bundle over the metric one, always provides a lift free of this cocycle, so that the tetrad residual symmetry algebra is the semi-direct sum of the metric one and the ideal of field-dependent residual Lorentz transformations. The construction is independent of the gauge conditions, of the residual group, of the first-order Lagrangian, and reduces to the Kosmann lift on metric isometry generators. We illustrate it on a Weyl BMS-type solution space with time-dependent boundary metric, described in tetrad variables with a residual U(1) Lorentz freedom, for which the cocycle of a naive lift is computed and then explicitly removed.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21296v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Statistical Properties of the $q$-Deformed Monolayer and Bilayer Graphene</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21675.html</link><guid isPermaLink="false">arxiv:2611.21675v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cond-mat.mes-hall</category><category>cond-mat.mtrl-sci</category><category>math-ph</category><category>quant-ph</category><description>&lt;p&gt;Omar Pedraza, Erik Díaz-Bautista, L. A. López, Daniel O-Campa&lt;/p&gt;&lt;p&gt;We investigate the statistical properties of the $q$-deformed Dirac oscillator for monolayer and bilayer graphene in the presence of a constant external magnetic field. Using $q$-deformed creation and annihilation operators, we obtain the corresponding energy spectra and eigenfunctions, as well as their probability current densities, recovering the conventional Landau-level structures in the undeformed limit. For bilayer graphene, the lowest Landau levels are explicitly constructed within the $q$-deformed framework. The partition functions for both systems are derived using zeta-function techniques and the Euler-Maclaurin formula, allowing us to determine their main thermodynamic quantities for small values of the deformation parameter. Our results show that the $q$-deformation modifies the energy spectra, the behavior of the probability current density components, and the thermodynamic response of the systems. A comparison between monolayer and bilayer graphene reveals distinct thermal behaviors, reflecting their different Landau-level structures and highlighting the influence of the $q$-deformation on their statistical properties.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21675v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Localization identities for spectral determinants: two-dimensional QCD and Ising field theory</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21724.html</link><guid isPermaLink="false">arxiv:2611.21724v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Bercel Boldis, Nikolay Gromov, Gregory P. Korchemsky, Alessandro Testa&lt;/p&gt;&lt;p&gt;Spectral determinants encode the meson spectra of planar two-dimensional QCD and of Ising field theory in the two-particle Bethe-Salpeter approximation. We derive localization identities for these determinants which express their logarithmic derivatives with respect to the spectral parameter in terms of Baxter $Q-$functions evaluated at special points, proving previously conjectured relations. Our derivation uses finite-rank commutation relations and virial identities of the underlying integral spectral operators. We identify a sufficient rational closure condition on the symbol of these operators that extends localization to a broader class of spectral problems and determines the evaluation points. Applications include generalized two-dimensional QCD with a quartic gauge-field potential and symbols interpolating between the QCD and Ising cases. We also give a general construction of the spectral operators and establish conditions for the finite-rank reduction on which localization relies.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21724v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Modular Hamiltonian and modular flow of a massive scalar in an interval</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21739.html</link><guid isPermaLink="false">arxiv:2611.21739v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>math-ph</category><category>quant-ph</category><description>&lt;p&gt;Raúl E. Arias, Daniel Fondevila&lt;/p&gt;&lt;p&gt;We obtain the vacuum modular Hamiltonian of a free massive scalar in an interval, for any $mL$. Its eigenvectors are superpositions of massive plane waves emitted from the two end points, with amplitudes given by a linear integral equation whose Neumann series is an expansion in reflections, and a normalization fixed by a Painlevé V transcendent. We follow the modular flow of initially localized wave packets inside the causal diamond. The flow is not geometric: the commutator profiles spread and can develop peaks ahead of the conformal trajectory.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21739v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Robust Passive Quantum Memory in Three Dimensions, Part I: Thermal and Zero-Temperature Perturbative Stability</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21749.html</link><guid isPermaLink="false">arxiv:2611.21749v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>cond-mat.str-el</category><category>math-ph</category><description>&lt;p&gt;Patrick Hayden&lt;/p&gt;&lt;p&gt;Whether a three-dimensional quantum many-body system with geometrically local, bounded-degree interactions can passively protect encoded quantum information has remained a central open question since Kitaev introduced topological quantum computation. Passive protection requires stability against both thermal noise at nonzero temperature and generic static Hamiltonian perturbations Balasubramanian, Davydova, and Lin (BDL) recently established unperturbed three-dimensional thermal self-correction using a recursively defined family of stabilizer Hamiltonians. However, they left open whether their construction remains stable against quantum perturbations, even at zero temperature. In this paper, we show that a slight variant of the BDL code family achieves stability along both boundary axes of the perturbation-temperature phase diagram as the system size grows. Following BDL, in the absence of perturbation it is thermally stable below a critical temperature, achieving a stretched-exponentially long memory lifetime when coupled to any local Markovian thermal bath generated by single-site system-bath interactions satisfying detailed balance with bounded coupling rates. At zero temperature under arbitrary weak, superpolynomially decaying quantum perturbations, the family maintains a uniform bulk spectral gap, superpolynomially small ground-space splitting, and a superpolynomially long closed-system unitary memory lifetime for quasi-locally dressed logical observables. To prove this zero-temperature stability, we establish local topological quantum order across the multiscale hierarchy using a linearly dilated relaxation of the usual Bravyi-Hastings-Michalakis criteria. In the companion paper, we combine the tools developed here with finite-temperature worldline cluster expansions to establish passive self-correction throughout the phase diagram&amp;#x27;s positive-temperature perturbed interior.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21749v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Modular conjugations for thermal states and second worlds</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21750.html</link><guid isPermaLink="false">arxiv:2611.21750v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Alan Garbarz, Gabriel Palau, Guillem Pérez-Nadal&lt;/p&gt;&lt;p&gt;The modular conjugation $J$ maps an algebra of observables onto its commutant. For the vacuum on a Rindler wedge it is a spacetime reflection, but for thermal states in two-dimensional CFTs the known expressions involve chiral fields at the complex points $x\pm iβ/2$, interpreted as belonging to a ``second world&amp;#x27;&amp;#x27;. Here we compute $J$ for the geometric thermal state in explicit cyclic purifications, using either the vacuum vector, through the conformal map to a Rindler wedge, or a vector in the natural cone of a local algebra. The modular images are then fields at real points, and complex coordinates arise only when operators of the commutant outside the image of the thermal representation are written as fields on the original spacetime. For the chiral $U(1)$ current we also purify by doubling the Fock space, obtain explicit formulas for $J$, show that this purification coincides with Sorce&amp;#x27;s canonical purification, and treat all primary thermal states.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21750v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Quantum Reference Frames, Locality, and Microcausality in Quantum Field Theory</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21768.html</link><guid isPermaLink="false">arxiv:2611.21768v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Christopher J. Fewster, Leon Loveridge&lt;/p&gt;&lt;p&gt;As a consequence of the relativistic spectrum condition, quantum reference frames for translations on Minkowski space are never described by projection-valued measures, and in many cases fail a weaker spacetime localisation property known as the norm-$1$ condition. This has several implications for the local and observable structure of quantum field theories described relative to even the best available frame: for a large class of frame states, strict locality is replaced by almost locality, and microcausality by commutators that decay rapidly with increasing separation, corresponding to an effective smearing of the light cone by the localisation density of the frame state. Operations built from finitely many almost local Kraus operators, for example nonselective measurements of relativised local observables, satisfy an approximate no-signalling bound, with a residue attributable to the localisation uncertainty of the frame. Whether causality in its strongest operational form -- non-disturbance under all physically realisable operations -- survives relativisation is left open. An upshot of our finding is that quantum field theories formulated relative to a quantum reference frame cannot rest on the traditional axioms, and some general relational axiomatisation must replace at least some of them by taking into account physically realistic properties of the frame.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21768v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Hidden convexity of the Eliashberg condensation energy: existence, uniqueness and continuity of the superconducting state</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21773.html</link><guid isPermaLink="false">arxiv:2611.21773v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cond-mat.supr-con</category><category>cond-mat.stat-mech</category><category>math-ph</category><description>&lt;p&gt;Davis Rens&lt;/p&gt;&lt;p&gt;Kiessling, Altshuler and Yuzbashyan conjectured the thermodynamic transition picture for the isotropic Eliashberg spin-chain functional with vanishing Coulomb pseudopotential: the normal state is the unique minimizer above and at a critical temperature, the superconducting minimizer below it is unique up to gauge, and the transition is continuous. We establish the nonlinear part of this picture. In the variables $ρ_n=\sin^2θ_n$, the condensation energy restricted to the first quadrant is strictly convex, and folding any admissible chain into that quadrant cannot increase its energy. For every positive, non-increasing interaction with power-law decay, hidden convexity and a compactness estimate give existence and uniqueness of the minimizer up to gauge. The normal state minimizes the energy exactly when its quadratic form is non-negative, including marginal stability. Among admissible chains, a positive solution of the nonlinear Eliashberg equations exists exactly when the normal state is linearly unstable and is then unique. For temperature-dependent families with pointwise continuity and locally uniform decay bounds, the minimizing density is continuous in a weighted $\ell^1$ norm. Together with uniqueness of the linear-stability temperature, these results prove the thermodynamic conjectures for the $γ$-model, Einstein phonons and general phonon spectra; the phonon applications use separately established spectral input. Finite-dimensional algebraic and convex-analytic components are machine-checked in Lean. The proofs were obtained independently of concurrent work that reaches overlapping conclusions.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21773v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] FLZ integrability in the &#x27;t Hooft model</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21787.html</link><guid isPermaLink="false">arxiv:2611.21787v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Alexey Litvinov, Egor Shestopalov, Nikita Slavnov&lt;/p&gt;&lt;p&gt;We study the &amp;#x27;t Hooft equation describing mesons in large-$N_c$ two-dimensional QCD with arbitrary unequal quark masses. Using its Fredholm formulation and the associated Baxter finite-difference equation, we investigate the relations between spectral determinants and canonical Baxter $Q$-functions. We derive special-point identities for the Baxter solutions by exploiting finite-rank commutator relations of the underlying integral operators. We also determine the spectral residues of the inhomogeneous solutions and obtain exact expressions for eigenfunction normalization factors in terms of values at distinguished complex points. These results establish the unit-residue property of the Baxter expressions entering the Fateev-Lukyanov-Zamolodchikov (FLZ) spectral-determinant identities. As a further application, we prove the nondegeneracy of the meson spectrum for arbitrary unequal quark masses. We further identify a broader class of integral operators exhibiting the same mechanism, which we refer to as FLZ integrability, and illustrate its applicability to the meson spectral problem in Ising field theory. Our approach reveals a connection between the analytic structure of Baxter equations and the theory of completely integrable Fredholm operators.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21787v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] A Geometric Framework for Local-to-Global Symmetry: Global Constraints on Local Dynamics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21898.html</link><guid isPermaLink="false">arxiv:2611.21898v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>math-ph</category><description>&lt;p&gt;Connor Terry Weatherly, Roel Tempelaar&lt;/p&gt;&lt;p&gt;Aggregate molecular systems are routinely understood by decomposing them into local structural units, such as monomers in J/H-aggregates, chemical moieties, motifs, and functional groups. Implicit in such decompositions is the assumption that these local structures remain meaningful within the aggregate. Here, we ask how the symmetries of constituent structures relate to aggregate symmetry, and how this relation determines the constraints that global symmetry imposes on transitions between local symmetry sectors. We construct a covariant local-to-global representation from framed local symmetry data and show that its reconstruction map intertwines with a global quantum representation. By identifying which global symmetry sectors overlap each local symmetry sector, we resolve symmetry-enforced dynamical exclusions into site-resolved pathways. Through Frobenius reciprocity, these exclusions can be determined from standard character tables of the local and global symmetry groups, with the character values in the inner product paired according to the relative positions and orientations of local structures within the aggregate. Although motivated by molecular aggregates, the construction is formulated for arbitrary geometries modeled by a homogeneous space of an ambient transformation group.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21898v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Generalized Schrieffer-Wolff transformation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22014.html</link><guid isPermaLink="false">arxiv:2611.22014v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>cond-mat.mes-hall</category><category>cond-mat.quant-gas</category><category>cond-mat.str-el</category><category>math-ph</category><description>&lt;p&gt;Tie-Cheng Guo&lt;/p&gt;&lt;p&gt;The Schrieffer-Wolff transformation (SWT) is a cornerstone of effective-Hamiltonian theory. However, the SWT is predominantly used for weak-coupling problems, while a systematic counterpart for strongly coupled regimes remains largely unexplored. A general closed-form SWT generator and a clear physical principle for gauge fixing remain elusive, obscuring the transformation&amp;#x27;s underlying structure. We introduce the dual SWT to deal with the strong-coupling problems. The generalized SWT (gSWT) is formulated for any Hermitian operator and block partition. We establish the geodesic principle for its canonical gauge. Furthermore, we derive an exact closed-form solution of the gSWT generator at every order as a finite nested-commutator sum whose only input is the active gap set. Both the geometric and algebraic aspects of the SWT physics are revealed. The gSWT framework is illustrated in two quantum many-body models, the collective spin model and the transverse-field Ising model.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22014v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Construction and regularity of lump solutions of the modified KP-I equation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22745.html</link><guid isPermaLink="false">arxiv:2611.22745v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>nlin.SI</category><category>math-ph</category><category>nlin.PS</category><description>&lt;p&gt;Tianwei Qiu, Zhen Wang&lt;/p&gt;&lt;p&gt;We express the $τ$-functions of standard and higher-order lump solutions of the modified Kadomtsev--Petviashvili-I (mKP-I) equation as Gram determinants in integral form. Unlike the KP-I equation, the mKP-I $τ$-function is complex-valued, and its nonvanishing does not follow from the positive definiteness of a Hermitian Gram matrix. We derive explicit spectral conditions for the regularity of these solutions; for higher-order lumps, the sharp condition depends only on the spectral parameter and the largest entry of the index vector. We also prove that the lump solutions and all their spatial derivatives decay algebraically in every spatial direction, uniformly on compact time intervals.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22745v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Quantum-classical dynamical density functional theory for solvation dynamics</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22786.html</link><guid isPermaLink="false">arxiv:2611.22786v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.chem-ph</category><category>math-ph</category><category>quant-ph</category><description>&lt;p&gt;Paul Bergold, Irene Burghardt, Francesco Di Maiolo, Cesare Tronci&lt;/p&gt;&lt;p&gt;We provide a unified modeling framework for thermalization and non-equilibrium spectroscopy in overdamped polar environments. This framework extends dynamical density functional theory to describe the coupled quantum-classical evolution of a molecular electronic subsystem and an overdamped polar solvent represented by a reaction-field coordinate. The nonadiabatic dynamics is formulated in terms of an operator-valued distribution obeying a quantum-classical Ehrenfest--Smoluchowski equation which exhibits nonlinear classical diffusion and non-increasing free energy, thereby retaining detailed balance. In contrast, a quantum-classical Liouville--Smoluchowski model with quantum-classical linear diffusion develops unstable long-time behavior and fails to reach a stationary thermal state. The method is applied to a two-level model of a polar dye in three different solvents: chloroform, dichloromethane, and dimethyl sulfoxide, each differing in polarity and dielectric relaxation time. Absorption and time-resolved emission spectra are obtained from dipole-dipole correlation functions, capturing the solvent-induced spectral broadening, the dynamic Stokes shift, and the time evolution of the emission bandwidth. The calculated solvent spectral response agrees well with the experimental relaxation trends of the three solvents.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22786v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Entanglement cost and classical capacity of multimode Gaussian states and channels</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22915.html</link><guid isPermaLink="false">arxiv:2611.22915v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Yuan Gao, Gerardo Adesso&lt;/p&gt;&lt;p&gt;Gaussian states and operations are central to continuous-variable quantum information and communication. For systems with any finite number of modes, we prove that entanglement of formation, Gaussian entanglement of formation, and entanglement cost coincide for every finite-energy bipartite Gaussian state. Their common value is strongly superadditive and lower-bounds entanglement of formation and entanglement cost for arbitrary non-Gaussian states with the same covariance matrix. We then determine the entanglement cost of every multimode Gaussian channel as well as its classical capacity under a mean energy constraint. These quantities reduce to Gaussian covariance optimizations, and the capacity is attained by pure Gaussian signals with Gaussian displacement modulation, independently across channel uses. The proof combines geodesic convexity of entanglement for pure Gaussian states with a relative-entropy inequality for arbitrary states. We also obtain a closed formula for the entanglement cost of a family of four-mode bound entangled states.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22915v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Non-Invertible Quantum Cellular Automata I: Microscopic Definition of Non-Invertible Symmetries</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22928.html</link><guid isPermaLink="false">arxiv:2611.22928v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cond-mat.str-el</category><category>hep-th</category><category>math-ph</category><category>quant-ph</category><description>&lt;p&gt;Sahand Seifnashri, Shu-Heng Shao&lt;/p&gt;&lt;p&gt;We introduce non-invertible quantum cellular automata (QCAs), defined as locality-preserving quantum channels that are dualizable and pure. This provides an operator-algebraic definition of non-invertible symmetries of quantum lattice systems, formulated in terms of their action on local operators. Focusing on quantum spin chains, we motivate these defining conditions and conjecture that every such quantum channel admits a realization by dualizable topological defects or, equivalently, by dualizable sequential quantum circuits. We construct a broad class of examples, including on-site non-invertible symmetries that are anomalous, as well as higher-dimensional examples. In Part II of this work, we reconstruct topological defects whose boundary algebras yield an index theory that classifies non-invertible QCAs up to blend equivalence.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22928v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] Shell crossing and the dynamical formation of thin shells in the collapse of self-gravitating relativistic dust</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22970.html</link><guid isPermaLink="false">arxiv:2611.22970v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>gr-qc</category><category>math-ph</category><category>math.AP</category><description>&lt;p&gt;Matt Smith&lt;/p&gt;&lt;p&gt;In this paper, we show that shell crossing in the collapse of self-gravitating relativistic dust in spherical symmetry can be understood as dynamical formation of a thin shell of dust. More precisely, we consider the spherically symmetric Einstein-dust system in double null coordinates (E-d), for which first singularities with area radius bounded away from zero are known as &amp;#x27;shell crossing&amp;#x27; singularities. We show that there exists a weak solution of (E-d), in which a thin shell of dust forms, extending beyond any &amp;#x27;non-degenerate&amp;#x27; first shell crossing singularity of a smooth &amp;#x27;collapsing&amp;#x27; solution of (E-d). This local extension is unique in the class of piecewise smooth solutions of (E-d) satisfying a &amp;#x27;determinism condition&amp;#x27;. We then consider the physical problem of smooth data for (E-d) on an initial hypersurface diffeomorphic to $\mathbb{R}^3$, containing a collapsing dust cloud. We show that, for generic such initial data, there exists a maximal globally hyperbolic piecewise smooth development satisfying a &amp;#x27;propagation condition&amp;#x27; (stronger than the determinism condition). The development may contain an arbitrary (finite) number of thin shells which can moreover merge. All shell crossing singularities are &amp;#x27;resolved&amp;#x27; and the area radius extends continuously to zero at any first singularity of the maximal development. We note that, for an open set of initial data in the smooth topology, as shown by Christodoulou, a Cauchy horizon emanates from a central &amp;#x27;shell-focussing&amp;#x27; singularity.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22970v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.MP] CFTs with Large Virasoro Primary Gaps</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23231.html</link><guid isPermaLink="false">arxiv:2611.23231v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>hep-th</category><category>math-ph</category><description>&lt;p&gt;Ziming Ji, Jiahua Tian&lt;/p&gt;&lt;p&gt;We construct the first explicit examples of compact unitary bosonic full conformal field theories (CFTs) in two dimensions with a unique vacuum and an all-spin Virasoro-primary gap greater than two. Our constructions use asymmetric orbifolds of lattice CFTs built from even unimodular lattices of sufficiently large minimum norm, ensuring that no charged state lies below the desired gap. The gauged symmetries combine a common orthogonal action on the left- and right-moving currents with independent sign reversals; the latter project out the dimension-two scalar primary $\sum_i J_L^iJ_R^i$ that survives when the symmetry acts identically on both chiral halves. We prove that the gauging is anomaly-free and determine the exact gaps by analyzing the invariant untwisted spectrum and all twisted sectors. From lattices constructed using ternary quadratic-residue codes, we obtain an infinite family with gap three at $(c_L,c_R)=(p+1,p+1)$ for primes $p\ge71$ with $p\equiv23\pmod{24}$. From Barnes-Wall lattices, we obtain an infinite family with gap four at $(c_L,c_R)=(2^m,2^m)$ for odd $m\ge7$. We also obtain two additional examples, with gap three at $(c_L,c_R)=(48,48)$ and gap four at $(c_L,c_R)=(512,512)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23231v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Robust feedback control of collisional plasma dynamics in presence of uncertainties</title><link>https://pragyaangaur.dev/Paperlane/p/2505.19992.html</link><guid isPermaLink="false">arxiv:2505.19992v2</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.OC</category><category>physics.comp-ph</category><category>physics.plasm-ph</category><description>&lt;p&gt;Giacomo Albi, Giacomo Dimarco, Federica Ferrarese, Lorenzo Pareschi&lt;/p&gt;&lt;p&gt;Magnetic fusion aims to confine high-temperature plasma within a device, enabling the fusion of deuterium and tritium nuclei to release energy. Due to the very large temperatures involved, it is essential to isolate the plasma from the device walls to prevent structural damage and the external magnetic fields play a fundamental role in achieving this confinement. In realistic settings, the physical mechanisms governing plasma behavior are highly complex, involving numerous uncertain parameters and intricate particle interactions, such as collisions, that significantly affect both confinement efficiency and overall stability. In this work, we address particularly these challenges by proposing a robust feedback control strategy designed to steer the plasma towards a desired spatial region, despite the presence of uncertainties. From a modeling perspective, we consider a collisional plasma described by a Vlasov-Poisson-BGK system, which accounts for a self-consistent electric field and a strong external magnetic field, while incorporating uncertainty in the model. A key feature of the proposed control strategy is its independence from the random parameter, making it particularly suitable for practical applications. A series of numerical simulations confirms the effectiveness of our approach and demonstrates the ability of external magnetic fields to successfully confine plasma away from the device boundaries, even in the presence of uncertain conditions.&lt;/p&gt;&lt;p&gt;new version v2&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2505.19992v2&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Control strategies for magnetized plasma: a polar coordinates framework</title><link>https://pragyaangaur.dev/Paperlane/p/2511.10214.html</link><guid isPermaLink="false">arxiv:2511.10214v2</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.OC</category><category>physics.comp-ph</category><category>physics.plasm-ph</category><description>&lt;p&gt;Federica Ferrarese&lt;/p&gt;&lt;p&gt;In this work, we provide an overview of various control strategies aimed at steering plasma toward desired configurations using an external magnetic field. From a modeling perspective, we focus on the Vlasov equation in a two-dimensional bounded domain, accounting for both a self-induced electric field and a strong external magnetic field. The results are presented in a polar coordinate framework, which is particularly well-suited for simulating toroidal devices such as Tokamaks and Stellarators. A key feature of the proposed control strategies is their feedback mechanism, which is based on an instantaneous prediction of the discretized system. Finally, different numerical experiments in the two-dimensional polar coordinate setting demonstrate the effectiveness of the approaches.&lt;/p&gt;&lt;p&gt;new version v2&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2511.10214v2&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Full-horizon magnetic control of the Vlasov--Poisson system for plasma confinement</title><link>https://pragyaangaur.dev/Paperlane/p/2610.26110.html</link><guid isPermaLink="false">arxiv:2610.26110v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.NA</category><category>math.OC</category><category>physics.comp-ph</category><category>physics.plasm-ph</category><description>&lt;p&gt;Giacomo Albi, Giacomo Dimarco, Federica Ferrarese, Lorenzo Pareschi&lt;/p&gt;&lt;p&gt;We study the full-horizon control of a two-dimensional Vlasov--Poisson system through an externally imposed magnetic field. The control is represented by time-dependent coefficients associated with smooth, spatially localized basis functions, and is designed to steer selected position and velocity moments of the distribution function while limiting particle dispersion and the control effort. Starting from the kinetic constrained optimization problem, we derive the continuous first-order optimality conditions, including a backward Vlasov equation, an elliptic adjoint equation, and the variational inequality associated with bounded controls. We then project this system onto a particle--grid representation and identify the resulting particle adjoints and control gradient. The full-horizon field is then computed on a reduced particle ensemble, initialized by an instantaneous control, and subsequently applied to a larger set of particles. Numerical experiments indicate that the instantaneous control field already provides an effective baseline, while the full-horizon correction can further reduce the relative thermal energy near the boundaries and improve confinement over the prescribed time interval.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2610.26110v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Singular layer neural networks for the Navier-Stokes equations at small viscosity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22072.html</link><guid isPermaLink="false">arxiv:2611.22072v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.flu-dyn</category><category>math.NA</category><description>&lt;p&gt;Teng-Yuan Chang, Gung-Min Gie, Youngjoon Hong, Chang-Yeol Jung&lt;/p&gt;&lt;p&gt;We develop neural network methods for the two-dimensional incompressible Navier-Stokes equations at a small viscosity $\varepsilon &amp;gt; 0$, whose accuracy is uniform in $\varepsilon$ and whose residual is evaluated on a grid that does not resolve the vorticity boundary layer. In the vorticity-stream function formulation with the slip boundary conditions, a vorticity layer of width $\sqrt{\varepsilon}$ forms along the walls. The trial function of the singular layer Physics-Informed Neural Network (sl-PINN) contains the corrector of the asymptotic analysis, together with the law that fixes its amplitude at the wall. The amplitude is tied to the wall trace of the network itself, so that the method requires no a priori knowledge of the limit solution. The sl-PINN keeps the error uniform in $\varepsilon$ over six decades, for the Stokes and the Navier-Stokes equations alike, although in the latter the wall trace travels with the flow and is not known in advance. An enrichment that uses the thin scale but leaves the profile and the amplitude of the layer free deteriorates as $\varepsilon\to0$. Since the corrector carries the layer analytically, the Laplacian in the residual can be discretized by a finite volume flux difference on a coarse grid. The resulting singular layer Finite Volume Neural Network (sl-FVNN) attains the same uniform accuracy as the sl-PINN, to within the scatter of the random seed, at about half the cost of a training step. The combination of the asymptotic corrector with the coarse-grid finite volume discretization is the main result of this article.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22072v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.NA] Multilevel Filtering on Manifolds with Light Schrödinger Bridges</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22443.html</link><guid isPermaLink="false">arxiv:2611.22443v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>stat.CO</category><category>math.NA</category><description>&lt;p&gt;Jason Beh, Pierre Del Moral, Ajay Jasra&lt;/p&gt;&lt;p&gt;In this article we consider the filtering of partially observed diffusions when the observations, made at discrete times, are noiseless. Each observation then confines the hidden state to a manifold defined by the data, whose type, for instance a sphere or an affine subspace, may change from one observation time to the next. In practice, the filter is approximated by particle filters, which require the diffusion to be discretized in time. Multilevel Monte Carlo reduces the cost of this discretization only if the particle approximations at consecutive discretization levels stay close, which standard particle filters do not ensure. We develop a new particle filter based on light Schrödinger bridges, which works between changing manifolds and can be coupled across discretization levels. A key insight is that the previous state enters the light Schrödinger bridge only through a few features, so that the bridge only has to be fitted on the new manifold, regardless of the type of the previous one. We bound the bias of this particle filter and the gap between its approximations at consecutive levels, and show numerically, on spheres and on manifolds that change type, that this gap is much smaller than with standard multilevel particle filters, and that, with the cost of the fits included, a hybrid estimator that uses it at the fine levels reduces the cost at small tolerances.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22443v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OA] Cantor correlations II. Synchronicity and bisynchronicity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22048.html</link><guid isPermaLink="false">arxiv:2611.22048v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>math.OA</category><description>&lt;p&gt;Georgios Baziotis, Alexandros Chatzinikolaou, Ivan G. Todorov, Lyudmila Turowska&lt;/p&gt;&lt;p&gt;We study synchronous and bisynchronous no-signalling correlations, defined over Cantor topological spaces, from the perspectives of both continuous variable quantum information and operator algebra theories. We focus on strategies, satisfying a natural no-signalling condition across the Cantor space levels, called graded, identifying a universal C*-algebra, whose tracial states of different types characterise synchronous correlations of respective types. The universal C*-algebra for bisynchronous graded correlations is shown to coincide with the C*-algebra of a projective limit of free wreath products of quantum permutation groups, introduced by Bhowmick, Goswami and Skalski, and a type description, analogous to the one in the synchronous case, is provided. Extending results in the finite case, we show that bisynchronous graded correlations canonically give rise to factorisable maps on type I factors, defined via Cantor permutation matrices. We examine non-local games over Cantor topological spaces, with inputs/outputs that are finite words of equal length, define corresponding game algebras, and characterise the perfect strategies of the games via the respective game algebras. In the case of the Cantor graph isomorphism game, we provide equivalent descriptions of the existence of perfect strategies of quantum commuting type, in terms of bigalois correspondences, factorisable maps, Cantor permutation intertwiners and game algebra non-triviality. Our results supply a quantum information interpretation of a notion of a quantum isomorphism of locally finite graphs, introduced by Rollier and Vaes, canonically arising from Cantor graphs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22048v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] The Impact of Scenario Representation in Scenario-based Optimization Certification</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21795.html</link><guid isPermaLink="false">arxiv:2611.21795v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SY</category><category>cs.RO</category><category>math.OC</category><description>&lt;p&gt;Stephen Crawford, Nora Ayanian&lt;/p&gt;&lt;p&gt;Scenario-based optimization provides finite-sample guarantees for decisions constructed from sampled uncertainty, but its certification procedures can be sensitive to how those samples are represented. We investigate this sensitivity under lossless scenario regrouping, which preserves the sampled information, feasible region, optimizer, and primitive violation probability. For an equal-allocation support-subsample certificate, we derive the distortion factor \(k^2(1-ε)^{k-1}\), establish certification reversals between equivalent representations, and provide sufficient conditions for acceptance dominance under nested coarsening. We further apply nondegeneracy-free Wait-and-Judge theory to coordinatewise scenario envelopes, enabling stronger certification directly from the primitive observations. In paired scenario-MPC experiments, exact regrouping increases certification availability from 318 to 471 of 480 attempts without changing the samples, numerical proposals, or requiring any reduction in witness cardinality. Primitive Wait-and-Judge certification accepts the same 471 attempts without regrouping. These results demonstrate that apparent scenario sample-efficiency gains can arise from certificate accounting rather than additional information or reduced decision risk.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21795v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] First-Order Model-Free Policy Gradient for Undiscounted LQR with Global Optimality and Convergence Guarantees</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21985.html</link><guid isPermaLink="false">arxiv:2611.21985v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SY</category><category>math.OC</category><description>&lt;p&gt;Vipul K Sharma, S Sivaranjani&lt;/p&gt;&lt;p&gt;We provide a first-order model-free policy gradient (PG) framework for learning undiscounted infinite-horizon linear quadratic regulator (LQR) policies with global optimality and convergence guarantees. We first construct a stochastic wrapper policy class parameterized by the LQR gain to enable exploration around a deterministic linear control law. We analyze the additional cost induced by exploration over infinite-horizon, and establish a weak gradient dominance condition that characterizes global optimality under exploration. We then construct a model-free first-order PG algorithm using sampled trajectory information, without identifying the dynamics or approximating a value function. Finally, we establish finite-time convergence guarantees, providing the sufficient number of samples required for near-global optimality with our proposed PG algorithms.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21985v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Safe Reinforcement Learning with Hard Constraints: Policy Gradient Methods with Intersample Guarantees</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21987.html</link><guid isPermaLink="false">arxiv:2611.21987v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SY</category><category>math.OC</category><description>&lt;p&gt;Vipul K. Sharma, S. Sivaranjani&lt;/p&gt;&lt;p&gt;We develop a policy-gradient (PG) reinforcement learning (RL) framework with hard inter-sample control barrier function (CBF)-based safety constraints for nonlinear sampled-data systems. We first design a class of stochastic policies with support truncated to sampling-period-dependent safe control sets, that guarantee safety-by-construction at sampling instants. We then propose a model-free PG algorithm that searches over the class of safe-by-design policies and establish sufficient conditions on sampling-period such that any action sampled from safe control sets remains safe throughout the sampling interval, providing inter-sample guarantees. We further establish finite-time convergence and sample complexity guarantees for the proposed PG algorithm and characterize its global optimality under gradient dominance. Finally, we illustrate inter-sample safety guarantees on a safe quadrotor navigation environment.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21987v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Grid-Responsive Pricing of Dynamic Wireless Charging with Coupled Residential Demand</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22197.html</link><guid isPermaLink="false">arxiv:2611.22197v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SY</category><category>math.OC</category><description>&lt;p&gt;Zhiheng Wang, Dipanjan Ghose, S. Sivaranjani, Junjie Qin, Qin Lv&lt;/p&gt;&lt;p&gt;Dynamic wireless charging (DWC) is an emerging technology that enables electric vehicles (EVs) to recharge while traveling. Its unique operational model creates two revenue streams for DWC operators through lane access tolls and electricity sales. However, these prices influence not only traffic flow and roadway energy delivery but also how much EV charging moves to homes instead, potentially within the same distribution network. Neglecting this coupling can underestimate grid loading and compromise pricing decisions. We develop a coupled traffic, EV energy, driver-response, and AC distribution network model with a model predictive control (MPC) framework that jointly optimizes DWC tolls and charging prices while explicitly accounting for displaced residential charging and network losses. Using 78 days of I-210 West traffic data, we show that conventional MPC exceeds feeder loading limits on 52 days, whereas the proposed residential load aware controller eliminates these violations with only 0.6% lower operator revenue. Under a more constrained feeder configuration, it eliminates 50 overloaded days with a 0.9% revenue reduction. Sensitivity analyses highlight the importance of accurate residential demand estimation and feeder loss modeling, while peak-aware pricing further reduces daily peak loading by 3.7% relative to the base load. These results demonstrate the value of coordinated pricing that captures the interaction between roadway and residential charging.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22197v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] The Multivariate Feedback Particle Filter for State-dependent Multiplicative Noises and Its Application to Attitude and Pose Estimations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22518.html</link><guid isPermaLink="false">arxiv:2611.22518v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.RO</category><category>math.OC</category><description>&lt;p&gt;Jingyao You, Xue Luo&lt;/p&gt;&lt;p&gt;Nonlinear filtering with state-dependent multiplicative measurement noise poses a notable challenge for spacecraft attitude determination and robotic pose estimation. This work develops the FPF-DM, a decomposition scheme for feedback particle filters tailored to this family of filtering problems. Extending prior decomposition techniques for additive noise and polynomial measurement models, the proposed method resolves the key difficulty that state-dependent multiplicative noise breaks the polynomial assumption and prevents Hermite spectral backward recursion for the weighted Poisson&amp;#x27;s equation. By measure transformation and importance reweighting, we incorporate the inverse measurement covariance into particle weights and rescale the feedback gain to restore the polynomial-form Poisson&amp;#x27;s equation, with the decomposition generalized to non-uniformly weighted mixtures for closed-form gain computation. This general FPF-DM is instantiated on quaternion and dual-quaternion manifolds for attitude tracking and point-cloud registration. Simulations on 4D attitude tracking and 8D point-cloud registration verify that the instantiated filters using only 10 particles achieve superior accuracy and computational performance relative to baseline filters.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22518v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Optimising Recruitment and Sample Allocation in Multi-Site Rare Disease Studies</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22907.html</link><guid isPermaLink="false">arxiv:2611.22907v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>q-bio.QM</category><category>math.OC</category><description>&lt;p&gt;Farid Zare, Catherine Clancy, Tal Dattner, Martina Messina, Julian Teinert, Jack McGoldrick, Pavel Ješina, Sabine Weller Grønborg, Ute Spiekerkoetter, James J O&amp;#x27;Byrne, Trine Tangeraas, Maria Luz Couce, José A. Cocho, Javier de las Heras, Niklas Darin, Dorothea Möslinger, Peter Witters, Ina Knerr, Giancarlo La Marca, Ans T. van der Ploeg, Hidde H. Huidekoper, Terry G. J. Derks, Francjan J. van Spronsen, Sandra D. K Kingma, Anibh M. Das, Carlo Dionisi-Vici, Clara D. van Karnebeek, Julia B. Hennermann, Siobhán O&amp;#x27;Sullivan, Sabine A. Fuchs, Luciana Hannibal, M. Rebecca Heiner-Fokkema, Marek J. Noga, Irene M. L. W. Körver-Keularts, Katja Benedikte Prestø Elgstøen, George J. G. Ruijter, J J M Jans, Amy Harms, Thomas Hankemeier, Maurizio Scarpa, Ines Thiele, Shamima Rahman, Stefan Kölker, Ronan M. T. Fleming&lt;/p&gt;&lt;p&gt;Clinical research in rare diseases is challenged by the limited availability and broad geographical distribution of eligible patients. This necessitates multi-centre collaboration and strategic selection of analytical laboratories based on capacity, cost, and capability. We present a mathematical framework based on cardinality optimisation to support key operational decisions in study design, balancing clinical relevance, feasibility, budgetary constraints, and logistical factors. The framework was implemented in the Reconstruction and Computational Modelling for Inherited Metabolic Diseases (Recon4IMD) project, aiming to recruit 1,900 diagnosed patients across 24 healthcare centres and eight metabolomic laboratories. Compared to both proportional heuristic and greedy marginal allocation baselines, the proposed optimisation model consistently achieved higher recruitment yields in simulated multi-centre scenarios and reduced metabolomic analysis costs by approximately 30% under unconstrained conditions. Notably, both the heuristic and greedy allocation baselines became infeasible under progressively tighter laboratory capacity constraints, whereas the optimised model maintained feasibility and cost control. These findings highlight the value of integrated optimisation strategies for improving recruitment, platform selection, and sample allocation in complex, resource-limited research settings.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22907v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Binary Affine Optimization with Nearly-Graphic Constraint Matrices</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22944.html</link><guid isPermaLink="false">arxiv:2611.22944v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.DS</category><category>math.OC</category><description>&lt;p&gt;Qiming Fang, Sihong Shao, Yuxuan Wu&lt;/p&gt;&lt;p&gt;We present a polynomial-time algorithm for binary affine optimization with a linear objective when every column of the constraint matrix has Hamming weight at most 2, and prove that the problem is NP-hard when every column of the constraint matrix has Hamming weight exactly 3. We obtain fixed-parameter tractable (FPT) algorithms for the unrestricted problem provided that a nearly-graphic certificate is given, where the certificate roughly measures how far the constraint matrix is from having columns of Hamming weight at most 2. We apply our FPT algorithm to Max-Lin$_2$ on graphs and obtain FPT algorithms parameterized by the contraction distance and contraction rank of the graph, utilizing the concept of Eulerian-spanning set. In the case of contraction distance, another FPT algorithm can be used to find the corresponding certificate; that is, we obtain an FPT algorithm that requires no information beyond the problem instance itself.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22944v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] On the recursive feasibility and stability of MPC without terminal constraints</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23017.html</link><guid isPermaLink="false">arxiv:2611.23017v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>eess.SY</category><category>math.OC</category><description>&lt;p&gt;Mara Perez, Ignacio Sanchez, Filiberto Fele, Daniel Limon&lt;/p&gt;&lt;p&gt;In this paper, we analyze stability and recursive feasibility of a model predictive control (MPC) scheme that does not rely on terminal ingredients -- such as terminal constraints or a terminal cost based on a terminal controller. In the proposed formulation, we augment the cost function by a weighted finite tail which is optimized online, and we show it plays the role of a stabilizing terminal cost. Under a relaxed, local dynamic programming condition on the tail, we certify a family of regions -- parameterized by the tail&amp;#x27;s weight coefficient -- on which the problem is recursively feasible and the origin is asymptotically stable. These regions are larger as the weight increases: in particular, we show that any state that can be steered within the control horizon to a predefined neighborhood of the origin is contained in a certified region for a sufficiently large weight. Finally, we characterize the closed-loop performance over the certified region, bounding the suboptimality of the closed loop with respect to the infinite-horizon optimal cost. We conclude the discussion by illustrating these results on a simple numerical example.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23017v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Colombo: A Frontier-to-Frontier Autoresearch System for Oracle-Based Optimization</title><link>https://pragyaangaur.dev/Paperlane/p/2611.23080.html</link><guid isPermaLink="false">arxiv:2611.23080v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.AI</category><category>math.OC</category><description>&lt;p&gt;Haihan Zhang, Wendao Wu, Chenheng Zhang, Chunyuan Zheng, Yanyi Li, Cong Fang, Haoxuan Li, Zhouchen Lin&lt;/p&gt;&lt;p&gt;Science advances from frontier to frontier as discoveries reshape what is known and create the basis for further discovery. We present Colombo, a self-organizing AI researcher that drives this renewal, first instantiated in oracle-based optimization. Here, the central question is how efficiently a problem class can be solved through a prescribed information interface and what costs no admissible algorithm can avoid. The gap between achievable guarantees and unavoidable limits defines the frontier recorded in its Complexity Atlas, a living map of frontier settings and the current state of knowledge. Self-Organization turns unresolved gaps into adaptive research programmes, coordinating conjecture formation, mathematical investigation, and replanning as evidence accumulates. Adversarial Co-Ascent develops algorithms and hard families through reciprocal challenge, exposing mechanisms of information use and concealment that guide stronger methods and proofs of unavoidable costs. Independent review and Lean-based formal certification check mathematical claims, while the Long-Term Memory carries supported findings and research experience across settings. To date, Colombo has established optimal or near-optimal rates for more than fifty settings in the Atlas. Colombo thus takes a concrete step toward Autopoietic Science: a scientific process whose validated advances regenerate the conditions of its own progress, continually reshaping how inquiry is organized and what it can discover.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.23080v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Geometry and Stochastic Analysis of Flow and Diffusion Models: A Survey</title><link>https://pragyaangaur.dev/Paperlane/p/2611.12107.html</link><guid isPermaLink="false">arxiv:2611.12107v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>math.DG</category><category>stat.ML</category><description>&lt;p&gt;Ehsan Mirafzali, Razvan Marinescu&lt;/p&gt;&lt;p&gt;Flow-based and diffusion-based models have become the principal means of learning and sampling high-dimensional probability distributions, from images and video to proteins, molecules and physical fields, and increasingly language. Each carries a simple law to the law of the data along a curve of probability measures, and behind the variety of their names lie three geometries, those of the state space on which the data live, of the space of probability measures through which the curve passes, and of the space of paths traced by the generating process. A single analytic idea runs through the subject. Every score identity used to train a diffusion model is an integration by parts, on the noise, on the data or on Wiener space, and Malliavin calculus extends this to nonlinear and infinite-dimensional diffusions. We develop these foundations with full definitions and follow them through normalising flows, flow matching and few-step maps, diffusion models and their convergence theory, conditioning, Schrödinger bridges and stochastic control, and their extension to manifolds, Lie groups, discrete and function spaces and jump processes. We close with statistical physics, renormalisation and, more speculatively, holography, in which the radial direction of anti-de Sitter space can play the role of flow time. A table of the main methods and a collection of open problems complete the survey.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.12107v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Entropy maximization for cube projections</title><link>https://pragyaangaur.dev/Paperlane/p/2611.13533.html</link><guid isPermaLink="false">arxiv:2611.13533v2</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.PR</category><category>cs.IT</category><description>&lt;p&gt;Zhekai Pang&lt;/p&gt;&lt;p&gt;We prove that, in every dimension $n\ge150$, the one-dimensional projections of the uniform distribution on a cube have the largest differential entropy in directions with equal coordinate magnitudes. This establishes the conjecture of Eskenazis, Nayar, and Tkocz in these dimensions.&lt;/p&gt;&lt;p&gt;new version v2&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.13533v2&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] Covariance Cells And Star Products</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21684.html</link><guid isPermaLink="false">arxiv:2611.21684v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>physics.class-ph</category><category>math.PR</category><description>&lt;p&gt;Carlos Alcalde&lt;/p&gt;&lt;p&gt;In classical statistics, a localized preparation is described not only by a point in phase space but also by a covariance cell specifying its finite resolution. We study balanced Gaussian cells on a linear symplectic space and show that they are equivalent to compatible complex structures and positive Lagrangian polarizations. Their parameter space is the Siegel symmetric space. Using the Koopman-von Neumann representation of classical mechanics, we describe the linearized transport of Gaussian amplitudes along a reference motion. Each covariance cell determines a separated star product whose antisymmetric part is fixed by the symplectic form and whose symmetric part is fixed by the covariance. This product is related to the Moyal product by Gaussian smoothing. Quadratic Hamiltonians act through their classical Poisson derivations within a fixed cell algebra exactly when they preserve the cell; squeezing transformations instead relate the algebras associated with different cells. Fronsdal&amp;#x27;s star-polarization construction yields a module whose cyclic element is the Gaussian density of the cell. Its completion is the corresponding Bargmann-Fock space, naturally embedded in the space of classical Koopman amplitudes. Koopman transport carries this Fock space to that of the transported cell. No Planck constant is introduced: the deformation parameter is a classical resolution scale, and physical observables remain commuting multiplication operators.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21684v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.QA] Finite-size Entanglement Certification via Third-Order Local Randomized Measurements</title><link>https://pragyaangaur.dev/Paperlane/p/2609.08635.html</link><guid isPermaLink="false">arxiv:2609.08635v2</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>quant-ph</category><category>math.QA</category><description>&lt;p&gt;Giovanni Scala, Corrado Cosimo Mattiacci, Dorota Pietryka, Gniewomir Sarbicki&lt;/p&gt;&lt;p&gt;Certifying entanglement in high-dimensional systems usually requires full state tomography, whose cost grows rapidly with the system dimension. Local randomized measurements offer a scalable alternative, but existing tests based on second-order correlations access only limited information about the state. Here, we derive a finite-size entanglement certificate that extends local randomized measurements to third order. The additional third-order information reveals entanglement that remains undetected at second order, while a dimension-independent concentration bound provides rigorous control of finite-sample errors. Our result opens a practical route to extracting stronger entanglement information from experimental platforms without the dimension-dependent overhead of state tomography.&lt;/p&gt;&lt;p&gt;new version v2&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2609.08635v2&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SP] On pseudospectra of the relativistic rotated harmonic oscillator</title><link>https://pragyaangaur.dev/Paperlane/p/2611.15180.html</link><guid isPermaLink="false">arxiv:2611.15180v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SP</category><category>math-ph</category><category>quant-ph</category><description>&lt;p&gt;David Krejcirik, Petr Siegl&lt;/p&gt;&lt;p&gt;We establish an upper bound to the norm of the resolvent of a relativistic version of the non-self-adjoint operator obtained by a dilation analytic transformation of the quantum harmonic oscillator. The estimate implies a decay for large complex energies along rays with angles larger than that of the dilation. In this way we positively answer a question left open in [Proceedings of the Royal Society A 2025].&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.15180v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.SP] On Schroedinger operators with subordinated complex potentials</title><link>https://pragyaangaur.dev/Paperlane/p/2611.21141.html</link><guid isPermaLink="false">arxiv:2611.21141v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>math.SP</category><category>math-ph</category><category>math.AP</category><description>&lt;p&gt;David Krejcirik, Vladimir Lotoreichik&lt;/p&gt;&lt;p&gt;We disprove a decade-old conjecture about a spectral stability of Schroedinger operators with potentials which are small in a subordination sense. Our counterexample is based on a complex perturbation of a critical attractive square well.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.21141v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] A mechanistic characterization of missingness at random</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22022.html</link><guid isPermaLink="false">arxiv:2611.22022v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>stat.ME</category><category>math.ST</category><description>&lt;p&gt;Maya B. Mathur, Willi Zhang, Shaun Seaman, Rohit Bhattacharya, Ilya Shpitser&lt;/p&gt;&lt;p&gt;The missingness-at-random (MAR) assumption underlying many missing-data methods describes abstract statistical independences, whereas practitioners reason more naturally about the causal mechanisms that generate missingness. To bridge this gap, we provide a mechanistic characterization of MAR in terms of paths in a directed acyclic graph (DAG) modified to allow certain edges to cease to operate when an incomplete variable is missing, a property termed &amp;quot;context-specific causal irrelevance (CSCI)&amp;quot;. Under a faithfulness condition, MAR holds if and only if the modified DAG contains no MAR-violating paths. Without CSCI, this condition reduces to a previously established d-separation condition, VMAR; thus, MAR without VMAR requires specific kinds of CSCI, as can occur with monotone dropout. These results shift the burden on investigators from passively invoking MAR to justifying, on substantive grounds, the specific mechanisms it requires. We then consider identification of a target law p(v) of variables V by a MAR-assuming analysis, e.g., multiple imputation, that includes complete auxiliary variables Z (variables not in V). Barring a perfect cancellation, such an analysis recovers p(v) if and only if MAR holds with respect to V and Z jointly. We show that if there exists any set of auxiliaries such that (V, Z) obeys MAR, then the complete candidate auxiliaries that are ancestors of the target variables or their missingness indicators form a sufficient set. Contrary to standard recommendations, not all candidate auxiliaries should be used: even complete auxiliaries can introduce MAR violations that would not otherwise occur. We illustrate these results with simulations and an analysis of sexual identity change in the Stockholm Public Health Cohort, where our results indicate that a candidate auxiliary, income, should be excluded; including it attenuated estimates toward the null.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22022v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] COSI: A Framework for Robustly Valid Inference</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22096.html</link><guid isPermaLink="false">arxiv:2611.22096v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>stat.ME</category><category>math.ST</category><category>stat.ML</category><description>&lt;p&gt;Arun K. Kuchibhotla, Sivaraman Balakrishnan, Larry Wasserman&lt;/p&gt;&lt;p&gt;We introduce COSI (COnfidence from Scale Invariance), a framework for constructing confidence sets for statistical functionals. COSI builds on the HulC (Hull-based Confidence), which uses median unbiasedness to construct confidence sets from batch estimates. COSI uses scale-invariance properties shared by many common estimators. We divide the data into batches, compute an estimate in each batch, and retain each candidate parameter value for which the batch estimates pass a test of scale invariance. The resulting confidence sets are asymptotically valid under weaker assumptions than classical Wald and bootstrap procedures require, and their coverage can be closer to the nominal level in small samples. Applications include robust inference for the mean, regression coefficients in misspecified linear models, tensor norms, and Fréchet means.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22096v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] The Price of Hard Coverage Constraints in Online Conformal Prediction</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22646.html</link><guid isPermaLink="false">arxiv:2611.22646v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>cs.LG</category><category>math.ST</category><category>stat.ML</category><description>&lt;p&gt;Mingrui Liu&lt;/p&gt;&lt;p&gt;Conformal prediction provides distribution-free uncertainty quantification, but in sequential deployment, standard coverage guarantees can still allow substantial fluctuations in the number of miscoverages over time. We study an online setting in which prediction sets are produced one round at a time and the cumulative number of miscoverages must stay within a prescribed budget throughout deployment.Such a hard coverage guarantee can be enforced by enlarging prediction sets, but how much additional prediction-set size is fundamentally necessary remains unclear. We characterize this unavoidable efficiency cost over $T$ prediction rounds. Remarkably, the cost persists even with i.i.d.\ data, a known score distribution, and perfect knowledge of the population-optimal prediction set. Under suitable regularity conditions relating coverage and prediction-set size, we determine the minimum cumulative excess prediction-set size required by any online method satisfying the hard coverage constraint. This minimum cost is $Θ(\log T)$ for expected cost at a fixed time known in advance, $Θ(T^{1/3})$ for the largest expected cost over all fixed times up to $T$, and $Θ(\sqrt{T})$ for the expected worst realized cost when the evaluation time is chosen in hindsight. We further show that these rates can be attained using past scores, without knowing the score distribution. Thus, even perfect statistical knowledge does not make sequential reliability free.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22646v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Greedy Empirical Bayes for Density Estimation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22796.html</link><guid isPermaLink="false">arxiv:2611.22796v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>stat.ME</category><category>math.ST</category><description>&lt;p&gt;Taole Sha, Shibo Yu, Edwin Fong&lt;/p&gt;&lt;p&gt;Bayesian nonparametric density estimation is challenging in high dimensions, where traditional approaches like the Dirichlet process (DP) mixture rely on computationally intensive Markov chain Monte Carlo or approximations. We introduce the partition posterior bootstrap (PPB), where a flexible prior is constructed by smoothing a DP over a partition of the sample space. Conditioned on this partition, exact posterior sampling reduces to a simple Bayesian bootstrap-like algorithm. Importantly, we select the partition using a greedy empirical Bayes (GEB) algorithm which scales to high dimensions and large sample sizes. GEB greedily maximizes the closed-form marginal likelihood via local split decisions arising naturally from its factorization, yielding an adaptive binary tree partition. Our key theoretical result is that the GEB tree belongs to an admissible family with high probability, splitting all identifiable signals while avoiding over-splitting noise. As a result, the PPB posterior with the GEB tree attains adaptive contraction rates. Our theory holds under weak, verifiable assumptions, which we demonstrate in numerous examples. Empirically, PPB delivers accurate density estimates and uncertainty quantification at a fraction of the computational cost of other approaches, making it a practical off-the-shelf choice for high-dimensional Bayesian density estimation with theoretical guarantees.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22796v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.ST] Long-Term Quantile Treatment Effects with Combined Experimental and Observational Data</title><link>https://pragyaangaur.dev/Paperlane/p/2611.22984.html</link><guid isPermaLink="false">arxiv:2611.22984v1</guid><pubDate>Wed, 18 Nov 2026 14:31:40 +0000</pubDate><category>econ.EM</category><category>math.ST</category><description>&lt;p&gt;Nan Liu, Yanbo Liu, Yuya Sasaki, Yichong Zhang&lt;/p&gt;&lt;p&gt;This paper studies the identification, estimation, and inference of long-term quantile treatment effects (LTQTEs) when short-term experimental data are supplemented with long-term observational data. Under a latent unconfoundedness framework, we establish identification of the LTQTE curve and derive the corresponding efficient influence functions. Building on these influence functions, we propose a semiparametrically efficient estimation procedure and develop a multiplier bootstrap method for uniform inference on the LTQTE curve, yielding valid simultaneous confidence bands over a continuum of quantile indices.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.22984v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
</channel>
</rss>
