Analysis of PDEs
Fractured membranes under determinant constraints: the case of cohesive surface energies
Nicola Pio Melillo and Dario Reggiani
This paper is devoted to the variational derivation of reduced models for elastic membranes with fracture under constraints on the determinant of the deformation gradient. We consider two physically relevant settings: the orientation-preserving regime, in which the deformation is required to preserve orientation locally ($\det \nabla u > 0$), and the incompressible regime, in which the deformation preserves volume ($\det \nabla u = 1$). In both cases, the surface energy density is allowed to depend on the jump amplitude, thus encompassing cohesive fracture models with activation threshold. The main technical contribution is the construction of recovery sequences that simultaneously satisfy the determinant constraint and optimize the surface energy. This is achieved through a combination of $C^\infty$ diffeomorphisms converging to the identity (which rotate the normal to the jump set so as to minimize the reduced surface energy), and a new smooth approximation result for $GSBV^p$ functions.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.CG
Flip Distance of Non-Crossing Spanning Trees: NP-Hardness and Improved Bounds
Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist et al. (+2 more)
We consider the problem of reconfiguring non-crossing spanning trees on point sets. For a set $P$ of $n$ points in general position in the plane, the flip graph $F(P)$ has a vertex for each non-crossing spanning tree on $P$ and an edge between any two spanning trees that can be transformed into each other by the exchange of a single edge. This flip graph has been intensively studied, lately with an emphasis on determining its diameter diam$(F(P))$ for sets $P$ of $n$ points in convex position. The current best bounds are $\frac{14}{9}n-O(1) \leq$ diam$(F(P))<\frac{15}{9}n-3$ [Bjerkevik, Kleist, Ueckerdt, and Vogtenhuber; SODA 2025]. The crucial tool for both the upper and lower bound are so-called *conflict graphs*, which the authors stated might be the key ingredient for determining the diameter (up to lower-order terms). In this paper, we pick up the concept of conflict graphs and show that this tool is even more versatile than previously hoped. As our first main result, we use conflict graphs to show that computing the flip distance between two non-crossing spanning trees is NP-hard, even for point sets in convex position. Interestingly, the result still holds for more constrained flip operations, concretely, compatible flips (where the removed and the added edge do not cross) and rotations (where the removed and the added edge share an endpoint). Extending the line of research from [BKUV SODA25], we present new insights on the diameter of the flip graph. Their lower bound is based on a constant-size pair of trees, one of which is *stacked*. We show that if one of the trees is stacked, then the lower bound is indeed optimal up to a constant term, that is, there exists a flip sequence of length at most $\frac{14}{9}(n-1)$ to any other tree. Lastly, we improve the lower bound on the diameter of the flip graph $F(P)$ for $n$ points in convex position to $\frac{11}{7}n-o(n)$.
Read the full abstract ▾
All authors Håvard Bakke Bjerkevik, Joseph Dorfer, Linda Kleist, Torsten Ueckerdt, Birgit Vogtenhuber
Representation Theory
Entropy of affine permutations and universality of affine atomic lengths
Nathan Chapelier-Laget, Thomas Gerber, Nicolas Jacon et al. (+1 more)
We introduce and study the notion of
entropy of affine permutations and prove that it coincides with the atomic length associated with the sum of the fundamental weights for a type $A$ affine root system, as defined by the first two authors. We then establish an analogue of the Granville-Ono
theorem by showing that any nonnegative integer can be realised as the
entropy of an affine permutation or alternatively, as the size of a core multipartition as introduced by the last two authors. Our proof uses an additive combinatorics
theorem due to
Hall on difference sets of permutations modulo $n$. More generally, we give a
polynomial expression of the atomic length associated with any dominant weight in affine type $A$ and investigate the problem of its universality. Beyond type $A$, we are able to prove that the
entropy of affine type $C_n$ permutations is universal when $2n+1$ is
prime. This is achieved by establishing an analogue of
Hall's
theorem for the hyperoctahedral group based on Alon's combinatorial Nullstellensatz. We also propose
conjectures generalising the results presented in the paper, each supported by computational evidence. Finally, we show that in any affine classical type, the problem of the universality of the atomic length simplifies in large rank when the weight considered is conveniently adjusted.
Read the full abstract ▾
All authors Nathan Chapelier-Laget, Thomas Gerber, Nicolas Jacon, Cédric Lecouvey
Representation Theory
On corank 4 unitary representations of classical groups
Baiying Liu, Chi-Heng Lo and Brian Wen
In this paper, we explicitly classify the corank 4
unitary representations of
symplectic or split odd special orthogonal groups over non-Archimedean local fields of characteristic zero, by classifying Arthur representations of corank 4 and verifying the corresponding
unitary dual
conjecture recently proposed by Hazeltine-Jiang-Liu-Lo-Zhang in [HJLLZ24].
Read the full abstract ▾
Dynamical Systems
New Anosov flows via bicontact structures
Tali Pinsky and Federico Salmoiraghi
We present a new approach to
hyperbolic plugs, via a construction of bicontact plugs on 3-
manifolds with boundary that are surface bundles over the circle. The boundary components are quasi transverse
tori, and we prove a gluing
theorem that allows us to produce closed
manifolds carrying new transitive Anosov flows. We show that a toroidal
manifold produced by gluing two copies of the figure eight
knot complement may carry many nonequivalent Anosov flows, and likewise a
manifold composed of a figure eight complement and a trefoil complement. We further show that certain generalized Handel–Thurston surgeries can be realized as sequences of Goodman–Fried surgeries and produce new examples of different surgery sequences resulting in the same Anosov flow.
Read the full abstract ▾
Information Theory · Cross-listed from cs.LG
Confidence-Based Decoding is Provably Efficient for Diffusion Language Models
Changxiao Cai and Gen Li
Diffusion language models (DLMs) have emerged as a promising alternative to autoregressive (AR) models for
language modeling, allowing flexible generation order and parallel generation of multiple
tokens. However, this flexibility introduces a challenge absent in AR models: the decoding strategy – which determines the order and number of
tokens generated at each iteration – critically affects sampling efficiency. Among decoding strategies explored in practice, confidence-based methods, which adaptively select which and how many
tokens to unmask based on prediction confidence, have shown strong empirical performance. Despite this success, our theoretical understanding of confidence-based decoding remains limited. In this work, we develop the first theoretical analysis framework for confidence-based decoding in DLMs. We focus on an
entropy sum-based strategy that continues unmasking
tokens within each iteration until the cumulative
entropy exceeds a threshold, and show that it achieves $\varepsilon$-accurate sampling in KL divergence with an expected number of iterations $\widetilde O(H(X_0)/\varepsilon)$, where $H(X_0)$ denotes the
entropy of the target data distribution. Notably, this strategy yields substantial sampling acceleration when the data distribution has low
entropy relative to the sequence length, while automatically adapting to the intrinsic complexity of data without requiring prior knowledge or hyperparameter tuning. Overall, our results provide a theoretical foundation for confidence-based decoding and may inform the design of more efficient decoding strategies for DLMs.
Read the full abstract ▾
Category Theory
A strengthened $(\infty, n)$-categorical pasting theorem
Clémence Chanavat
We extend Campion's pasting
theorem for $(\infty, n)$-categories to a larger class of polygraphs, called the directed complexes with frame-acyclic molecules. It follows, for instance, that this pasting
theorem applies to any polygraph presented by a semi-simplicial set, and that a large subclass of directed complexes with frame-acyclic molecules is compatible with the Gray tensor product. We also set up a comparison between directed complexes and Henry's regular polygraphs, and show that they coincide up to dimension $3$. As a corollary of our main results, the pasting
theorem also applies to the class of regular $3$-polygraphs.
Read the full abstract ▾
Information Theory
Parametric and structure-aware information theory for multi-scale analysis of composition
Rohit Sahasrabuddhe and Renaud Lambiotte
Compositional data is common across the natural and social sciences, requiring methods to measure the diversity of compositions and the heterogeneity of collections of them. Via Bregman geometry, a strictly concave diversity index induces a measure of heterogeneity that decomposes across scales. A canonical example is Shannon
entropy inducing mutual information. We develop this framework by incorporating category similarity into $\alpha$-logarithmic
entropy, a parametric diversity index. We disprove an existing general concavity result and prove that, for $\alpha=3$, the region of strict concavity is always convex, complementing previous results for $\alpha=1$ and $2$. The resulting geometry provides methods to compare compositions substantially faster than optimal transport. Applied to occupation compositions across England and Wales, they reveal distinct regionalisations based on different notions of occupation relatedness. Applied to ecological data, they recover established patterns of functional and taxonomic $\beta$-diversity, and reveal sensitivity to the diversity parameter.
Read the full abstract ▾
Combinatorics
Cyclotomic generating functions, empty weighted complete intersections and positivity
Mona Gatzweiler, Fabián Levicán-Santibáñez and Atsuro Yoshida
We give a sufficient combinatorial condition for the non-negativity of the coefficients of
polynomial quotients of products of $q$-integers, also known as cyclotomic generating functions (CGFs). This slightly extends work by Iano-Fletcher, Pizzato, Sano and Tasin, who studied this condition as a criterion for quasismoothness of complete intersections in weighted projective spaces. As a consequence, we solve a problem by Billey and Swanson, prove most cases of an unpublished
conjecture by Stanton and most cases of two
conjectures by Gatzweiler and Krattenthaler. We also study sufficient conditions given by structural properties of the division
lattice.
Read the full abstract ▾
Metric Geometry
Higher moments of intrinsic volumes of random beta-prime polytopes
Ferenc Fodor, Balázs Grünfelder and Péter Kevei
We consider beta-
prime polytopes, i.e., the convex hulls of iid random points chosen according to beta-
prime distributions in $\mathbb{R}^d$. After suitable scaling, beta-
prime polytopes converge in distribution to the convex hulls of Poisson point processes with power-law intensity functions. We prove moment convergence for the volume and all intrinsic volumes. Beta-
prime polytopes are the push-forwards of spherical random polytopes on the upper open half-sphere of the unit sphere $S^d\subset \mathbb{R}^{d+1}$. We prove convergence of moments of the spherical volume difference of the half-sphere and the spherical random polytopes.
Read the full abstract ▾
Dynamical Systems
Dynamics of the Takagi function and the shadowing property
Zoltán Buczolich and Jesús Llorente
The Takagi function $T:[0,1]\to \mathbb{R}$ is a classical example of a continuous nowhere differentiable function. In this paper, we study the discrete dynamical system generated by the Takagi function. First, we prove that for almost every point $x\in [0,1]$, the orbit $(T^n(x))_n$ converges to $2/3$. We introduce the family of Takagi maps, given by $\textbf{T}_\gamma=\gamma \cdot T$, where $\gamma>0$ is a parameter. We also study the shadowing property for this family of maps. We show that the Takagi function has the shadowing property. Additionally, we provide two distinct techniques that allow us to find values of the parameter $\gamma$ for which $\textbf{T}_\gamma$ fails to have the shadowing property. Finally, we pose some open questions.
Read the full abstract ▾
Metric Geometry
Affine Angles via Area Cross Ratio and Isoptic Hyperbolas
Masanori Nakazato
Affine geometry is usually regarded as a framework in which metric notions such as distance and angle are absent. However, just as projective geometry produces various metric geometries by introducing additional structures on the line at infinity, affine geometry can also serve as a natural basis for an angular geometry once certain directions at infinity are fixed. In this paper we introduce an affine angle determined by two fixed directions on the line at infinity and defined via an area cross ratio. This quantity is invariant under affine transformations preserving the chosen directions. We show that the locus of points from which a fixed segment is seen under a constant affine angle is a hyperbola whose asymptotes are parallel to the chosen directions. This provides an affine analogue of the classical fact that in Euclidean geometry the isoptic curve of a segment is a circle. Furthermore, we establish that this angle arises as a
parabolic degeneration of the Cayley–Klein angle, and that the same quantity naturally appears in a power
theorem associated with hyperbolas. These results provide a unified perspective linking affine angles, isoptic hyperbolas, and
hyperbolic power through the area cross ratio.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.CG
Separators for intersection graphs of spheres
Jacob Fox and Jonathan Tidor
We prove the existence of optimal separators for intersection graphs of balls and spheres in any dimension $d$. One of our results is that if an intersection graph of $n$ spheres in $\mathbb{R}^d$ has $m$ edges, then it contains a balanced separator of size $O_d(m^{1/d}n^{1-2/d})$. This bound is best possible in terms of the parameters involved. The same result holds if the balls and spheres are replaced by fat convex bodies and their boundaries.
Read the full abstract ▾
Dynamical Systems
Double Recurrence and Almost Sure Convergence: Primes and Weighted Theory
Jan Fornal and Ben Krause
Let $(X,\mu)$ be a probability space equipped with an invertible, measure-preserving transformation $T\colon X \to X$. We exhibit a wide class of weights $w$ so that whenever $f,g \in L^{\infty}(X)$, the bilinear ergodic averages \[ \frac{1}{N} \sum_{n \leq N} w(n)\, T^{an}f \cdot T^{bn}g, \qquad a,b \in \mathbb{Z} \] converge $\mu$-almost surely. This class encompasses the von Mangoldt function, resolving Problem 12 from Frantzikinakis' survey on open problems in ergodic theory, the divisor function, the sum-of-two-squares representation function, etc., as well as their restrictions to lower-density Piatetski-Shapiro sequences of the form $\{\lfloor k^{c}\rfloor : k \in \mathbb{N}\}$, $1 \leq c < 7/6$. Our methods combine combinatorial number theory and higher-order
Fourier analysis with classical
Fourier-analytic/martingale-based methods; the role of $U^{3}$ analysis is particularly significant.
Read the full abstract ▾
Geometric Topology
Non-smoothable surfaces in the 4-sphere
Anthony Conway and Daniel Galvin
We construct examples of non-smoothable surfaces in the $4$-sphere, thereby answering Question 4.32 on the K3 problem list. These surfaces are non-orientable and have
knot group of order $2$, thus simultaneously answering Question 4.29(a) on the K3 problem list.
Category Theory
On the semi-abelianness of cocommutative Hopf monoids
Andrea Sciandra and Zhenbang Zuo
By providing a suitable generalization of Newman's bijective correspondence known for cocommutative
Hopf algebras, we prove that the category of cocommutative
Hopf monoids in any abelian symmetric monoidal category is semi-abelian, once faithful (co)flatness conditions are satisfied. This result unifies and generalizes the semi-abelianness of cocommutative
Hopf algebras and of cocommutative color
Hopf algebras known up to now. As a consequence of the semi-abelianness, the category of cocommutative
Hopf monoids is also action representable. Finally, we prove that abelian objects in the category of cocommutative
Hopf monoids coincide exactly with commutative and cocommutative
Hopf monoids, which form so an abelian category.
Read the full abstract ▾
Algebraic Geometry
Weil restriction, normal bundles and motivic Thom spaces
Guangzhao Zhu
Recent developments in motivic homotopy theory, particularly the construction of norm functors by Bachmann and Hoyois, have revealed deep connections between algebraic geometry and homotopy-theoretic structures. In this paper, we investigate certain
geometric aspects of norm functors through the Weil restriction of schemes, which underlies these constructions. We show that Weil restriction preserves vector bundles and extend existing results concerning normal bundles. We then relate the Weil restriction to norm functors and, using a result of Bachmann and Hoyois, establish its compatibility with motivic Thom spaces. Finally, in the setting of motivic
cohomology with rational coefficients, we prove that the Weil restriction map agrees with the norm map induced by a norm functor and that it preserves Thom classes.
Read the full abstract ▾
History and Overview of Mathematics
A Rightly Forgotten Mathematician? Jozsef Sutak (1865–1954) and Budapest Mathematics between Bolyai and the Numerus Clausus
Andras Batkai
József Suták (1865–1954), a Piarist priest, gymnasium teacher and from 1912 full professor of geometry at the University of Budapest, is scarcely more than a footnote in the history of Hungarian mathematics. His name survives mainly because he co-signed, with Lipót Fejér, the acceptance of John von Neumann's 1926 dissertation on the axiomatic construction of set theory. Drawing on his printed works, on the records of the Budapest Faculty of Philosophy and of the Catholic Saint Stephen Academy, and on a hitherto unknown part of his personal papers, this article reconstructs his career. It follows his Hungarian translation of Bolyai's Appendix (1897), his empiricist lecture on the axioms of geometry (1898), his papers on the logical problems of set theory (1911) and on the axiomatic construction of projective geometry (1914), and his later differential-
geometric work. It analyses his appointment in 1911/12, when the faculty preferred him to Frigyes Riesz and Alfréd Haar, and his role as chairman of the admissions committee in implementing the numerus clausus after 1920. The answer to the title's question is twofold: as a mathematician, Suták is largely rightly forgotten; for the history of Budapest mathematics and its university, he is not.
Read the full abstract ▾
Combinatorics · Cross-listed from hep-th
CayleyPy-4: AI-Holography. Towards analogs of holographic string dualities for AI tasks
A. Chervov, F. Levkovich-Maslyuk, A. Smolensky et al. (+41 more)
This is the fourth paper in the CayleyPy project, which applies AI methods to the exploration of large graphs. In this work, we suggest the existence of a new discrete version of
holographic string dualities for this setup, and discuss their relevance to AI systems and mathematics. Many modern AI tasks – such as those addressed by GPT-style
language models or RL systems – can be viewed as direct analogues of predicting particle trajectories on graphs. We investigate this problem for a large family of Cayley graphs, for which we show that surprisingly it admits a dual description in terms of discrete strings. We hypothesize that such dualities may extend to a range of AI systems where they can lead to more efficient computational approaches. In particular, string
holographic images of states are proposed as natural candidates for data
embeddings, motivated by the "complexity = volume" principle in AdS/CFT. For Cayley graphs of the symmetric group S_n, our results indicate that the corresponding dual objects are flat, planar polygons. The diameter of the graph is equal to the number of integer points inside the polygon scaled by n. Vertices of the graph can be mapped holographically to paths inside the polygon, and the usual graph distances correspond to the area under the paths, thus directly realising the "complexity = volume" paradigm. We also find evidence for continuous CFTs and dual strings in the large n limit. We confirm this picture and other aspects of the duality in a large initial set of examples. We also present new
datasets (obtained by a combination of ML and conventional tools) which should be instrumental in establishing the duality for more general cases.
Read the full abstract ▾
All authors A. Chervov, F. Levkovich-Maslyuk, A. Smolensky, F. Khafizov, I. Kiselev, D. Melnikov, I. Koltsov, S. Kudashev, D. Shiltsov, M. Obozov, S. Krymskii, V. Kirova, E.V. Konstantinova, A. Soibelman, S. Galkin, L. Grunwald, A. Kotov, A. Alexandrov, S. Lytkin, D. Fedoriaka, A. Chevychelov, Z. Kogan, A. Natyrova, L. Cheldieva, O. Nikitina, S. Fironov, A. Vakhrushev, A. Lukyanenko, V. Ilin, D. Gorodkov, N. Bogachev, I. Gaiur, M. Zaitsev, F. Petrov, L. Petrov, T. Gaintseva, A. Gavrilova, M. N. Smirnov, N. Kalinin, A. Khan, K. Jung, H. Mousset, H. Isambert, O. Debeaupuis
Complex Variables
Kodaira-Iitaka dimension and multiplicity: an analytic perspective
Siarhei Finski
We express the Kodaira-Iitaka dimension and the multiplicity of graded linear series in terms of the intersection theory of the plurisubharmonic envelope associated with the linear series, and obtain two refined versions of these formulas at the pointwise and at the metric levels. At the pointwise level, we focus on the weak convergence of the partial Bergman kernel associated with the linear series and a Bernstein-Markov measure. At the metric level, we compute the asymptotic ratio of the volumes of unit balls defined by the sup-norms on the linear series. Based on our findings, we introduce a non-pluripolar version of the numerical Kodaira-Iitaka dimension for a line bundle, show that this invariant dominates the classical Kodaira-Iitaka dimension and is, in turn, bounded above by the numerical versions proposed so far.
Read the full abstract ▾
Statistics Theory
Stable Algorithms Lower Bounds for Estimation
Xifan Yu and Ilias Zadik
In this work, we show that for all statistical estimation problems, a natural MMSE instability (discontinuity) condition implies the failure of stable
algorithms, serving as a version of OGP for estimation tasks. Using this criterion, we establish separations between stable and
polynomial-time
algorithms for the following MMSE-unstable tasks (i) Planted Shortest Path, where Dijkstra's
algorithm succeeds, (ii) random Parity Codes, where Gaussian elimination succeeds, and (iii) Gaussian Subset Sum, where
lattice-based methods succeed. For all three, we further show that all low-degree
polynomials are stable, yielding separations against low-degree methods and a new method to bound the low-degree MMSE. In particular, our technique highlights that MMSE instability is a common feature for Shortest Path and the noiseless Parity Codes and Gaussian subset sum. Last, we highlight that our work places rigorous algorithmic footing on the long-standing physics belief that first-order phase transitions–which in this setting translates to MMSE-instability impose fundamental limits on classes of efficient
algorithms.
Read the full abstract ▾
Probability · Cross-listed from stat.AP
Generalized Sequential Monte Carlo Sampling for Redistricting Simulation
Philip O'Sullivan, Kosuke Imai and Cory McCartan
Simulation methods have become important tools for quantifying partisan and racial bias in redistricting plans. We generalize the Sequential Monte Carlo (SMC)
algorithm of McCartan and Imai (2023), one of the commonly used approaches. First, our generalized SMC (gSMC)
algorithm can split off regions of arbitrary size, rather than a single district as in the original SMC framework, enabling the sampling of multi-member districts with a varying number of representatives. Second, the gSMC
algorithm can operate over various sampling spaces, providing additional computational flexibility. Third, we derive optimal-variance incremental weights and show how to compute them efficiently for each sampling space, leading to more efficient sampling. Finally, we propose a hybrid gSMC-MCMC
algorithm by incorporating Markov chain Monte Carlo (MCMC) steps to handle large-scale redistricting applications without changing the target distribution. We demonstrate the effectiveness of the proposed methodology through analyses of the Irish Parliament, which uses multi-member districts of varying sizes, and the Pennsylvania House of Representatives, which has more than 200 single-member districts.
Read the full abstract ▾
Rings and Algebras
Twisted group algebras of faithful split metacyclic groups $C_p \rtimes C_m$ over finite fields
Sanjit Bhowmick, Javier de la Cruz and Edgar Martínez-Moro
Let $\mathbb{F}_\ell$ be a finite field with $\ell$ elements and let $G = C_p \rtimes C_m$ be a faithful split metacyclic group. In this paper, we develop a complete theory for the twisted group
algebra $\mathbb{F}_\ell^\alpha G$. Using the Lyndon–Hochschild–Serre spectral sequence, we prove that the second
cohomology group of $G$ is isomorphic to $\mathbb{F}_\ell^\times/(\mathbb{F}_\ell^\times)^m$, and we show that all twisting occurs only on the $C_m$ factor. We determine the primitive central idempotents by analyzing the combined action of the Frobenius
automorphism and the group action on the character group of $C_p$. Using crossed product theory and the structure of finite fields, we obtain the complete Wedderburn decomposition of $\mathbb{F}_\ell^\alpha G$ into
matrix algebras over explicitly determined fields $\mathbb{F}_{\ell^{d_j}}$. Finally, the irreducible projective representations of $G$ over $\mathbb{F}_\ell$ are also determined.
Read the full abstract ▾
Analysis of PDEs
Cross-diffusion and fast-reaction in pattern formation: a structural analysis
Brocchieri Elisabetta and Soresina Cinzia
Cross-
diffusion systems play a central role in mathematical modelling, in which density-dependent dispersal and multiscale mechanisms can lead to spatial segregation and
diffusion-driven instabilities. In several relevant examples, including generalised SKT-type competition models, cross-
diffusion terms can be rigorously derived as fast-reaction limits, thereby providing a clear biological interpretation while posing significant analytical challenges. In this work, we investigate the impact of biologically derived cross-
diffusion on Turing instability. For a generalised SKT framework, we characterise instability conditions for a broad class of cross-
diffusion functions arising from fast-reaction mechanisms. We then propose an alternative fast-reaction formulation leading to a different
diffusion structure and show that, in this case,
diffusion-driven pattern formation is prevented. We further discuss an example motivated by dietary diversity and starvation dynamics, and analyse how the sign structure of the reaction Jacobian interacts with cross-
diffusion in determining the onset of patterns. Our results clarify structural features that promote or inhibit spatial self-organisation in competitive systems.
Read the full abstract ▾
Analysis of PDEs
The Cahn–Hilliard–Darcy–Forchheimer system with surfactant: Existence and long-time behavior of global weak solutions
Maurizio Grasselli, Bohan Ouyang, Andrea Poiatti et al. (+1 more)
We consider a diffuse-interface model for two-phase incompressible viscous flows with a soluble surfactant in a bounded porous medium. This hydrodynamic system consists of a Darcy–Forchheimer equation for the seepage velocity $\boldsymbol{u}$ coupled with two Cahn–Hilliard equations involving Flory–Huggins type singular potentials, one for the phase-field variable $\phi$, the difference in volume fractions of the two fluids, and the other for the surfactant concentration $\psi$. We study the initial boundary value problem in two or three dimensions, with impermeability boundary conditions for $\boldsymbol{u}$ and homogeneous Neumann boundary conditions for $(\phi, \psi)$ and their associated chemical potentials. First, we establish the existence of global weak solutions via an implicit-explicit time-discretization scheme based on the energy dissipation law. Furthermore, applying the seminal results of the first and third authors (arXiv:2510.17296), we prove that every weak solution satisfying an energy inequality converges to a single
equilibrium as time tends to infinity. In sharp contrast with the available literature on similar models, in this case weak solutions are enough to guarantee the uniqueness of asymptotic limits, without the necessity of any further eventual regularization.
Read the full abstract ▾
All authors Maurizio Grasselli, Bohan Ouyang, Andrea Poiatti, Hao Wu
Algebraic Geometry
The exceptional locus of a motivic local system
Luca Terenzi
To every Nori motivic local system over a smooth, connected complex algebraic variety, we associate an exceptional locus controlling the variation in the complexity of its stalks; the definition is given explicitly in terms of motivic Galois groups and Artin motives. We prove a motivic analogue of the Cattani–Deligne–Kaplan
Theorem, asserting that the exceptional locus is a countable union of closed algebraic subvarieties. Moreover, we show that it is defined over any algebraically closed subfield over which the motivic local system admits a model, and stable under Galois conjugation when the latter descends to a smaller subfield. This extends and strengthens previous results by André in the pure case. We obtain a similar description for the splitting locus of the motivic weight filtration.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Dissipative free fermions in disguise
Kohei Fukai, Hironobu Yoshida and Hosho Katsura
Recently, a class of
spin chains known as “free
fermions in disguise” (FFD) has been discovered, which possess hidden free-
fermion spectra even though they are not solvable via the standard Jordan-Wigner transformation. In this work, we extend this FFD framework to open
quantum systems governed by the Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) equation. We establish a general class of exactly solvable open
quantum systems within the FFD framework: if the Liouvillian frustration graph is claw-free and has a simplicial clique, the Liouvillian possesses a hidden free-
fermion spectrum. In particular, the (even-hole, claw)-free condition automatically guarantees this, enabling exact computation of the Liouvillian gap and an infinite-temperature autocorrelation function. Our results provide the first realization of the FFD mechanism in open
quantum systems.
Read the full abstract ▾
Operator Algebras
The Unitary Conjugation Groupoid as a Universal Mediator of the Baum–Connes Assembly Map
Shih-Yu Chang
We show that the Baum–Connes assembly map factors canonically through the
unitary conjugation groupoid, which serves as a universal mediator among groupoid models that are Morita equivalent to a given transformation groupoid. This establishes a structural link between groupoid-based index theory and the Baum–Connes program at the level of K-theory. Building on our previous development of
unitary conjugation groupoids and their associated index theory, we extend the $K_1$ index framework beyond the Type I setting to non-Type I examples, including the irrational rotation
algebra and amenable crossed products. Using Morita equivalence, we relate
unitary conjugation groupoids to transformation and action groupoids, enabling the transfer of descent-type index constructions to these settings. Our main result shows that, among all groupoid realizations that are Morita equivalent to a transformation groupoid, the factorization through the
unitary conjugation groupoid is canonical at the level of K-theory. This identifies the
unitary conjugation groupoid as a universal intermediary for the Baum–Connes assembly map. As applications, we recover the classical index pairing with the tracial state for the irrational rotation
algebra in the sense of Connes, and we prove that for amenable crossed products the descent construction agrees with the analytic Baum–Connes assembly map under Morita equivalence. These results provide a conceptual interpretation of the assembly map in terms of internal
symmetries of crossed product
algebras and suggest a unified framework connecting Fredholm-type index data with equivariant K-theory via groupoid methods.
Read the full abstract ▾
Combinatorics
Trace identities for quiver representations
Adrien Kassel and Thierry Lévy
We give an expression for the determinant of the twisted
Laplacian associated with any linear representation of a finite quiver in terms of traces of the holonomy of its cycles. To establish this expression, we prove a general identity for the determinant of a block
matrix in terms of traces of products of its blocks. We give two proofs, one purely enumerative and one using generating series. In the special case of a finite graph equipped with a vector bundle and a connection, the twisted
Laplacian determinant admits a combinatorial interpretation as a weighted count of tuples of oriented cycle-rooted spanning forests, where the weights involve traces of holonomies along cycles formed by combining the edges of the forests.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
RAMPAGE: RAndomized Mid-Point for debiAsed Gradient Extrapolation
Zhankun Luo, M. Berk Sahin, Antesh Upadhyay et al. (+2 more)
A celebrated method for Variational Inequalities (VIs) is Extragradient (EG), which can be viewed as a standard discrete-time integration scheme. With this view in mind, in this paper we show that EG may suffer from discretization bias when applied to non-linear vector fields, conservative or otherwise. To resolve this discretization shortcoming, we introduce RAndomized Mid-Point for debiAsed Gradient Extrapolation (RAMPAGE) and its variance-reduced counterpart, RAMPAGE+, which leverages antithetic sampling. In contrast with EG, both methods are unbiased. Furthermore, leveraging negative correlation, RAMPAGE+ acts as an unbiased,
geometric path-integrator that completely removes internal first-order terms from the variance, provably improving upon RAMPAGE. We further demonstrate that both methods enjoy provable $\mathcal{O}(1/k)$ convergence guarantees for a range of problems including root finding under co-coercive, co-hypomonotone, and generalized Lipschitzness regimes. Furthermore, we introduce symmetrically scaled variants to extend our results to constrained VIs. Finally, we provide convergence guarantees of both methods for
stochastic and deterministic smooth convex-concave games. Somewhat interestingly, despite being a randomized method, RAMPAGE+ attains purely deterministic bounds for a number of the studied settings.
Read the full abstract ▾
All authors Zhankun Luo, M. Berk Sahin, Antesh Upadhyay, Behzad Sharif, Abolfazl Hashemi