Commutative Algebra
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 31 March
For a simplicial poset $P$, Stanley assigned the face ring $A_P$, which is the quotient of the polynomial ring $S:=K[t_x \mid x \in P \setminus \{\widehat{0} \}]$ by the ideal $I_P$. This is a generalization of Stanley-Reisner rings, but $S$ and $A_P$ are not standard graded in this case, and $I_P$ is not a monomial ideal. To establish the foundation of the theory on local cohomology $H_{I_p}^i(S)$ and its injective resolution, we give an explicit description of the graded injective envelope ${}^*\! E_S(S/\mathfrak{p}_x)$, where $\mathfrak{p}_x$is the prime ideal associated with $x \in P$, and analyze their behavior in the graded dualizing complex.
Probability
Strong Feller property, irreducibility, and uniqueness of the invariant measure for stochastic PDEs with degenerate multiplicative noise
We establish strong Feller property and irreducibility for the transition semigroup associated to a class of nonlinear stochastic partial differential equations with multiplicative degenerate noise. As a by-product, we prove uniqueness of the invariant measure under no strong-dissipativity assumptions. The drift of the equation diverges exactly where the noise coefficient vanishes, resulting in a competition between the dissipative effects and the degeneracy of the noise. We propose a method to measure the accumulation of the solution towards the potential barriers, allowing to give rigorous meaning to the inverse of the degenerate noise coefficient. From the mathematical perspective, this is one of the first contributions in the literature establishing strong Feller properties and irreducibility in the multiplicative degenerate case, and opens up novel investigation paths in the direction of regularisation effects and ergodicity in the degenerate-noise framework. From the application perspective, the models cover interesting scenarios in physics, in the context of evolution of relative concentrations of mixtures, under the influence of thermodynamically-relevant potentials of Flory-Huggins type.
Read the full abstract
Dynamical Systems · Cross-listed from cs.RO
SafeDMPs: Integrating Formal Safety with DMPs for Adaptive HRI
Robots operating in human-centric environments must be both robust to disturbances and provably safe from collisions. Achieving these properties simultaneously and efficiently remains a central challenge. While Dynamic Movement Primitives (DMPs) offer inherent stability and generalization from single demonstrations, they lack formal safety guarantees. Conversely, formal methods like Control Barrier Functions (CBFs) provide provable safety but often rely on computationally expensive, real-time optimization, hindering their use in high-frequency control. This paper introduces SafeDMPs, a novel framework that resolves this trade-off. We integrate the closed-form efficiency and dynamic robustness of DMPs with a provably safe, non-optimization-based control law derived from Spatio-Temporal Tubes (STTs). This synergy allows us to generate motions that are not only robust to perturbations and adaptable to new goals, but also guaranteed to avoid static and dynamic obstacles. Our approach achieves a closed-form solution for a problem that traditionally requires online optimization. Experimental results on a 7-DOF robot manipulator demonstrate that SafeDMPs is orders of magnitude faster and more accurate than optimization-based baselines, making it an ideal solution for real-time, safe, and collaborative robotics.
Read the full abstract
Analysis of PDEs
Distributed Equilibria for $N$-Player Differential Games with Interaction through Controls: Existence, Uniqueness and Large $N$ Limit
We establish the existence and uniqueness of distributed equilibria to possibly nonsymmetric $N$ player differential games with interactions through controls under displacement semimonotonicity assumptions. Surprisingly, the nonseparable framework of the running cost combined with the character of distributed equilibria leads to a set of consistency relations different in nature from the ones for open and closed loop equilibria investigated in a recent work of Jackson and the second author. In the symmetric setting, we establish quantitative convergence results for the $N$ player games toward the corresponding Mean Field Games of Controls (MFGC), when $N\to+\infty$. Our approach applies to both idiosyncratic noise driven models and fully deterministic frameworks. In particular, for deterministic models distributed equilibria correspond to open loop equilibria, and our work seems to be the first in the literature to provide existence and uniqueness of these equilibria and prove the large $N$ convergence in the MFGC setting. The sharpness of the imposed assumptions is discussed via a set of explicitly computable examples in the linear quadratic setting.
Read the full abstract
Optimization and Control
On Lipschitzian properties of multifunctions defined implicitly by "split" feasibility problems
In the present paper, a systematic study is made of quantitative semicontinuity (a.k.a. Lipschitzian) properties of certain multifunctions, which are defined as a solution map associated to a family of parameterized “split" feasibility problems. The latter are a particular class of convex feasibility problems with well recognized applications to several areas of engineering and systems biology. As a part of a perturbation analysis of variational systems, this study falls within the framework of a line of research pursued by several authors. It is performed by means of techniques of variational analysis, which lead to establish sufficient conditions for the Lipschitz lower semicontinuity, calmness, isolated calmness, Lipschitz upper semicontinuity and Aubin property of the solution map. Along with each of these properties, a quantitative estimate of the related exact bound is also provided. The key elements emerging on the way to achieving the main results are dual regularity conditions qualifying the problem behaviour, which are expressed in terms of convex analysis constructions involving problem data. The approach here proposed tries to unify the study of the aforementioned properties.
Read the full abstract
Quantum Algebra
The discrete quantum group $su_q(2)$ and its dual
Discrete quantum groups were introduced as duals of compact quantum groups by Podleś and Woronowicz in 1990. They have been studied intrinsically by Effros and Ruan (1994) and by the author (1996). In a more recent note (2025), we have given a slightly updated treatment, viewing the duality between discrete and compact quantum groups as a special case of the more general duality of algebraic quantum groups. Along these lines, we start in this paper with the discrete quantum group $su_q(2)$, not constructed as the dual of the compact quantum group $SU_q(2)$ but rather from the Hopf algebra deformation of the enveloping algebra of the Lie algebra of $SU(2)$, as given by Jimbo (1985). The passage to the discrete quantum group as studied in earlier papers is not completely trivial as we will see. This is a known phenomenon. We consider the dual of this discrete quantum group in the sense of duality of algebraic quantum groups and see that this indeed is the compact quantum group $SU_q(2)$.
Read the full abstract
Numerical Analysis
Dissolution of carbonate stones caused by CO2 pollutant: Numerical modelling of erosion scenarios
In this paper, we introduce a mathematical model of carbonate-stone erosion driven by the penetration of CO2-derived acidity into the water-filled pore network. The model couples transport of the reactive aqueous species, calcite dissolution and porosity evolution, thereby representing the feedback by which dissolution increases porosity and modifies subsequent transport. Such model is formulated as nonlinear reaction-transport system in porous media governed by Darcy flow. We propose a numerical algorithm based on finite difference approximation that relies on level-set method at the boundaries and we show numerical tests that are in accordance with the literature in terms of the advancement of the erosion front.
Read the full abstract
Number Theory
Analytic rank-one elliptic curves over function fields and their rank over certain ring class fields
Let $E/k$ be a non-isotrivial elliptic curve over a global function field $k$ of characteristic $p>3$, and $G\subset \mathrm{Gal}(k^{\mathrm{sep}}/k)$ be a topologically finitely generated subgroup. We prove that if $E/k$ has analytic rank $1$, then its rank over the fixed subfield $L^G$ is infinite, where $L$ is the infinite ring class extension of some finite separable extension $K/k$. If $E/k$ has analytic rank $0$, then we prove that the same holds provided there exists an imaginary quadratic extension $K/k$ such that $E/K$ has analytic rank $1$ and satisfies the Heegner hypothesis.
Read the full abstract
Optimization and Control
An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
An algorithm is proposed for solving optimization problems with stochastic objective and deterministic equality and inequality constraints. This algorithm is objective-function-free in the sense that it only uses the objective's gradient and never evaluates the function value. It is based on an adaptive selection of function-decreasing and constraint-improving iterations, the first ones using an Adagrad-type stepsize. When applied to problems with full-rank Jacobian, the combined primal-dual optimality measure is shown to decrease at the rate of O(1/sqrt{k}), which is identical to the convergence rate of first-order methods in the unconstrained case.
Read the full abstract
Metric Geometry
Another simple proof of the 1-dimensional flat chain conjecture
We provide a short proof of the 1-dimensional flat chain conjecture.
Information Theory
Joint Identification and Sensing with Noisy Feedback: A Task-Oriented Communication Framework for 6G
Task-oriented communication is a key enabler of emerging 6G systems, where the objective is to support decisions and actions rather than full message reconstruction. From an information-theoretic perspective, identification (ID) codes provide a natural abstraction for this paradigm by enabling receivers to test whether a task-relevant message was sent, without decoding the entire message. Motivated by the strong impact of feedback on ID and by the growing interest in integrated communication and sensing, this paper studies joint identification and sensing (JIDAS) over state-dependent discrete memoryless channels with noisy strictly causal feedback. The transmitter conveys identification messages while simultaneously estimating the channel state from the feedback signal. For both deterministic and randomized coding schemes, we derive lower and upper bounds on the capacity–distortion function. The results quantify the fundamental limits of JIDAS under noisy feedback and recover existing noiseless-feedback characterizations as special cases.
Read the full abstract
Information Theory
Second-Order Asymptotics for Covert Communication over Quasi-Static Multiple-Antenna Fading Channels
We study the second-order asymptotics of optimal codes for covert communication over quasi-static multi-antenna fading channels, under the covertness metric of Kullback–Leibler (KL) divergence. In particular, we study all four cases regarding the availability of channel state information (CSI) for the legitimate transmitter and receiver, assume that the warden knows perfect CSI for the channel from the legitimate transmitter to itself, whereas the legitimate transmitter knows only that the warden's channel matrix belongs to a bounded deterministic uncertainty set. Specifically, we show that, when the blocklength is $n$, the first-order covert rate satisfies the square root law, scaling as $\Theta(n^{-\frac{1}{2}})$ with the coefficient determined by the traces of the channel matrices of the legitimate users and the warden, and the second-order rate vanishes. We also show that the availability of CSI at the transmitter enables optimal covert power allocation across the spatial sub-channels, which can increase the covert rate, relatively to equal power allocation, without changing the square root law. Furthermore, we reveal the significant spatial diversity gain provided by multiple-antenna systems for covert communication and demonstrate the critical role of the number of antennas to achieve high throughput covert communication. For the covertness analysis, we extend the quasi-$\eta$-neighborhood framework to quasi-static fading channels. For the reliability analysis, due to the vanishing power imposed by the covertness constraint, we refine the non-covert analysis by Yang et al. (TIT, 2014), by carefully controlling higher-order terms and exploiting the properties of covert outage probability.
Read the full abstract
Quantum Algebra
On the Drinfeld double of a finite group scheme and its representation category
We classify equivalence classes of Hopf algebra quotient pairs $(D,\theta)$ of the Drinfeld double $D(G)$ of a finite group scheme $G$ over an algebraically closed field $\mathbf{k}$ of characteristic $p\ge 0$, in terms of group scheme-theoretical data. We prove that such Hopf algebra quotients $D$ are Hopf algebra extensions $\mathscr{O}(K)^{\mathrm{cop}}\#_{\sigma}^{\tau} \mathbf{k}[G/H]$, where $K$ and $H$ are normal subgroup schemes of $G$ that centralize each other and $B:\mathbf{k}[H]\to \mathscr{O}(K)$ is a $G$-equivariant Hopf algebra map, and describe the surjective Hopf algebra map $\theta:D(G)\twoheadrightarrow D$. Using this classification, we determine the tensor subcategories of the center $\mathscr{Z}(G):=\Rep(D(G))$ of $G$, describe their centralizers, determine when they are symmetric or non-degenerate, and give a description of their simple and projective objects using \cite{GS}. Our categorical results generalize those found in \cite{NNW} in characteristic $0$.
Read the full abstract
Combinatorics
On graph products and multi-word-representability
The multi-word-representation number $\mu(G)$ is the minimum number of word-representable graphs whose union is $G$. We investigate $\mu(H)$ for graph products $H$ obtained from $G_1$ and $G_2$ via six fundamental products: lexicographic, Cartesian, rooted, corona, tensor, and strong. We prove $\mu(H) = \max\{\mu(G_1), \mu(G_2)\}$ for Cartesian and rooted products. For the corona product, we show $\max\{\mu(G_1), \mu(G_2)\} \le \mu(H) \le \max\{\mu(G_1), \mu(G_2)\} + 1$, and show that the lower bound is tight when $\mu(G_1) > \mu(G_2)$ or $G_2$ admits a covering by $\mu(G_2)$ word-representable graphs, one of which is a comparability graph. For the lexicographic product, we show $\max\{\mu(G_1), \mu(G_2)\} \le \mu(H) \le \mu(G_1) + \mu(G_2)$, and show that the lower bound is tight when $\mathrm{cov}_{\mathrm{comp}}(G_2) \le \max\{\mu(G_1), \mu(G_2)\}$. We provide logarithmic bounds for tensor and strong products. We prove $G^{[k]}$ is word-representable if and only if $G$ is a comparability graph. We establish bounds $\mu(G^{[k]}) \le \mathrm{cov}_{\mathrm{comp}}(G)$ and $\mu(G^{[k]}) \le k$ for non-comparability word-representable graphs. Using lexicographic powers, we obtain the sublinear bound $\tau(n) \le n^{\log_8 6+\epsilon}$ for the extremal function $\tau(n)$. Finally, we address the Word-representable Bipartition (WB) problem, proving a negative answer for $n \geq 433$: showing that for every such $n$, there exists a graph of order $n$ that cannot be vertex-partitioned into two word-representable induced subgraphs.
Read the full abstract
Combinatorics
Seymour-tight orientations
We investigate `almost counterexamples' to Seymour's second neighbourhood conjecture. In what we call Seymour-tight orientations, the size of the first neighbourhood of each vertex equals the size of its second neighbourhood. We give several examples and constructions. Specifically, we prove that the class of Seymour-tight orientations is closed under taking (generalized) lexicographic products. Moreover, the lexicographic product of a putative counterexample to Seymour's second neighbourhood conjecture and a Seymour-tight orientation is again a counterexample. Using lexicographic products, we show that if the conjecture is false, then there exist counterexamples that are close to regular tournaments, and moreover that any digraph occurs as an induced subgraph of a counterexample. We then use this same machinery to construct special putative counterexamples to Sullivan's conjecture. The inherent symmetry of these orientations give access to an algebraic perspective. Seymour-tight orientations that are also Cayley digraphs correspond to special pairs of critical sets in groups, which connects potentially to additive combinatorics. We use Kemperman's theorem to characterize those Seymour-tight orientations that are the Cayley digraph of an abelian group.
Read the full abstract
Combinatorics
Certified Return-Word Induction for a Perturbed Hofstadter Recursion
We study the parity-perturbed Hofstadter recursion $$ Q(1)=Q(2)=1,\qquad Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n. $$ We prove that it is well-defined for every $n\ge 1$ by a computer-assisted return-word induction. The recurrence is first reduced to a binary sequence $s_n$ together with two backward cursor heads. Its local semantics is encoded by 13 return-word types, 92 synchronized cursor states, and 122 exact two-source transition rules. Exhaustive finite checks verify the local recurrence identity, cursor synchronization, rule selection, and exclusion of the unique configuration that could produce a nonbinary value. The global argument is not inferred from a long finite trace. Instead, all unbounded word families are handled by explicit induction: four stationary chunk families and four linear bridge-tail families reduce to ten parameterized zero-loop schemas. Ordered rank-word factorizations assemble complete epochs and bridges at every level. A marked factor induction then propagates absolute source-block addresses through the resulting four-factor cycle, while a finite potential certificate yields the uniform lag bounds $$ j-p_A\ge 38,\qquad j-p_B\ge 38, $$ so every source read lies strictly in the previously generated prefix. Finally, defining $Q(n)=n+1-T_{n+1}$ from the constructed binary system gives a two-periodic recurrence residual that vanishes in the two base cases. Hence the original recursion holds globally, all recursive arguments are positive and strictly smaller than the current index, and the sequence is uniquely determined.
Read the full abstract
Numerical Analysis
Solving the (Navier-)Stokes equations with space and time adaptivity using deal.II
In this article, we solve the Stokes and Navier-Stokes equations with the deal$.$II finite-element library. In particular, we use its multigrid, adaptive-mesh, and matrix-free infrastructures to design efficient linear and nonlinear iterative solvers, respectively. We solve the stationary Stokes equations on hp-adaptive meshes with a hp-multigrid approach, the transient Stokes equations with space-time finite elements and space-time multigrid, and, finally, the stabilized incompressible Navier-Stokes equations on locally refined meshes with a monolithic multigrid solver. The selected examples underline the flexibility and modularity of the multigrid infrastructure of deal$.$II.
Read the full abstract
Analysis of PDEs
The Euler system of gas dynamics
This is a survey highlighting several recent results concerning well/ill posedness of the Euler system of gas dynamics. Solutions of the system are identified as limits of consistent approximations generated either by physically more complex problems, notably the Navier- Stokes-Fourier system, or by the approximate schemes in numerical experiments. The role of the fundamental principles encoded in the First and Second law of thermodynamics in identifying a unique physically admissible solution is examined.
Read the full abstract
Numerical Analysis
Modeling tumor growth with variable mass and angiogenesis-driven perfusion through a 3D-1D coupled framework
Tumor growth beyond a critical size relies on the development of a functional vascular network, which ensures adequate oxygen and nutrient supply. In this work, we present a modeling framework based on an optimization-based 3D-1D coupling strategy to simulate perfusion in a tumoral tissue with growing mass, interacting with a dynamically evolving capillary network. The tumor is described as a multiphase system including tumor cells and interstitial fluid, governed by a non-linear PDE system for cell volume fraction, pressure, oxygen, and VEGF, and discretized via finite elements. Capillary growth is tackled using a continuous-discrete hybrid tip-tracking approach. The vascular geometry is updated over time according to angiogenic signals, and coupled to the tissue model through a constrained optimization formulation that enforces fluid and nutrient exchange via interface variables. A sensitivity analysis using the Morris elementary effect method identifies key parameters influencing system behavior. Results highlight the critical role of vascular development in regulating tissue perfusion and tumor progression. Overall, the proposed numerical approach provides a versatile tool for investigating tumor-vascular interactions and can support further quantitative analysis of angiogenesis and tumor perfusion dynamics.
Read the full abstract
Combinatorics · Cross-listed from hep-th
Critical dimensions and small cycle dominance from all-orders asymptotics of $d$-matrix theory
Supersymmetric sectors of $\mathcal{N}=4$ super-Yang-Mills theory motivate the study of the partition function for the counting of gauge-invariant functions of $d=2,3$ matrices transforming under the adjoint action of $U(N)$. The partition function $ \mathcal{Z}_d ( x) $ in the large $N$ limit has a known Hagedorn phase transition at $ x = d^{-1} $ which provides a simple model for the phase structure of the thermal partition function of SYM. We study the all-orders asymptotic expansion of $ \mathcal{Z}_d(x)$ based on a geometric picture of concentric circles of poles in the complex plane accumulating in a natural boundary at $|x| =1$. We find that the order by order structure has a precise combinatorial interpretation organized in terms of increasing cycle size of permutations arising in the enumeration of the invariants. We refer to this organization as small-cycle dominance, and find that it extends to refined versions of the partition functions depending on several complex variables. An analysis of the coefficients in the asymptotic expansion of $ \mathcal{Z}_d(x) $ using the modular property of the Dedekind eta function reveals that the asymptotic expansion is actually convergent for $d\ge d_{ \rm crit } = 13$. A fermionic version of $\mathcal{Z}_d (x)$ has an analogous critical dimension of $ d_{ \rm crit} = 7$. This distinction indicates that the partition functions of the matrix models can be completely reconstructed from their high-energy (UV) limit for $d\ge d_{ \rm crit}$ whereas additional input is required to reconstruct the exact coefficients of the low-energy (IR) expansion for $2\le d \le d_{ \rm crit } -1 $.
Read the full abstract
Algebraic Geometry
On intersections of function fields
Let $X:\mathcal{E}\rightarrow\mathcal{R}$ and $Y:\mathcal{E}\rightarrow\mathcal{T}$ be holomorphic maps between compact Riemann surfaces such that $X^*M(\mathcal{R})\cdot Y^*M(\mathcal{T})=M(\mathcal{E})$, where $M(\mathcal{S})$ denotes the field of meromorphic functions on a Riemann surface $\mathcal{S}$. We study the problem of determining when the degree $[M(\mathcal{E}):X^*M(\mathcal{R})\cap Y^*M(\mathcal{T})]$ is finite and attains the minimal possible value $\mathrm{deg}\,X\cdot\mathrm{deg}\,Y$. When $X$ is a Galois covering, we give a complete characterization in terms of factorizations of $Y$ into an equivariant map followed by a Galois covering. We also establish some results without the maximality condition, as well as general results on the functional equation $A\circ X=B\circ Y$ when one of the maps involved is a Galois covering.
Read the full abstract
Group Theory
Large subgroups of fusion systems and localities
Saturated fusion systems are categories modeling properties of conjugacy of p-subgroups in finite groups. It was shown by Chermak that they correspond nicely to group-like structures called localities. In this paper we start to explore how concepts and results from a program of Meierfrankenfeld, Stellmacher and Stroth, aiming to reprove and generalize parts of the classification of the finite simple groups, translate to fusion systems and localities. Central in the program is the notion of a large $p$-subgroup. The presence of a large $p$-subgroup in a finite group turns out to be strong enough information to nearly classify the entire $p$-local structure, while also accommodating a very large class of groups of interest including many groups of Lie type in defining characteristic $p$. Utilizing the group-theoretical definition of a large $p$-subgroup as a blueprint, we define large subgroups of fusion systems and localities. We then analyze how the three definitions relate to each other, showing in particular that the newly defined notions behave well under the correspondence between saturated fusion systems and localities with certain properties. We further proceed with an example of how classification results from the program of Meierfrankenfeld et.al. translate to fusion systems and localities. In more detail, we give a new characterization of the $2$-fusion system of $\operatorname{Aut}(\operatorname{G}_2(3))$ following the strategy in a paper of Meierfrankenfeld and Stroth, where the group $\operatorname{Aut}(\operatorname{G}_2(3))$ is characterized in a similar fashion.
Read the full abstract
Group Theory
Permutation modules for Ramsey structures
Suppose $R$ is a commutative ring and $G$ is a group acting on a set $W$. We consider the $RG$-module $RW$ in the case where $G$ is the automorphism group of an $\omega$-categorical structure $M$ and $W$ is, for example, $M^n$ (for $n \in \mathbb{N}$). We develop methods which may provide information about two questions in the case where $R$ is a field $F$: whether $FW$ has a.c.c. on submodules; and in the case where $M$ is finitely homogeneous, whether $FW$ is of finite composition length. In the case where $M$ is a Ramsey structure and so $G$ is extremely amenable, we give a simple `decision procedure' for membership in a submodule of $RW$ specified by a given generating set. If $F$ is a field, we show that there is a duality between submodules of $FW$ and the topological $FG$-module of definable functions from $W$ to $F$.
Read the full abstract
Numerical Analysis
On the application of the SCD semismooth* Newton method to solving Stokes problem with stick-slip boundary conditions
The paper deals with the 3D Stokes problem with Navier-Tresca stick-slip boundary conditions. A weak formulation of this problem leads to a variational inequality of the second kind, coupled with an equality constraint. This problem is then approximated using the mixed finite element method, yielding a generalized equation, to the numerical solution of which we implement a variant of the SCD semismooth* Newton method. This includes also a globalization technique ensuring convergence for arbitrary starting points. Numerical experiments demonstrate the effeciency of this approach.
Read the full abstract
Classical Analysis and ODEs
Uniform optimal-order Wasserstein quantisation
We address Steinerberger's Wasserstein transport problem on the cube $Q=[0,1]^d$. For every $d\ge2$, we consider a dyadic digital sequence $(x_n)\subset Q$ and prove that every prefix $\{x_1,\dots,x_N\}$ admits an exact equal-mass transport partition at the optimal scale. More precisely, for every $N\in\mathbb{N}$, there exist pairwise disjoint Borel sets $A_1,\dots,A_N\subset Q$ such that \[ \lambda_d(A_n)=\frac1N,\qquad A_n\subset B(x_n,6\sqrt d\,N^{-1/d})\qquad(1\le n\le N), \] and $\lambda_d\!\bigl(Q\setminus\bigcup_{n=1}^N A_n\bigr)=0$. In other terms, every prefix of the sequence supports an exact transport allocation of Lebesgue mass to its points with uniformly controlled radius $O(N^{-1/d})$. By an elementary partition criterion, this yields \[ W_\infty\!\left(\frac1N\sum_{n=1}^N\delta_{x_n},\,\lambda_d\right)\le 6\sqrt d\,N^{-1/d} \qquad(N\in\mathbb{N}). \] The bound holds for every $1\le p\le\infty$. The exponent $1/d$ is optimal, so it gives the sharp uniform prefix rate on the cube. The result settles Steinerberger's problem for all $d\ge1$ and all $1\le p\le\infty$.
Read the full abstract
Differential Geometry
Construction of a spiral with given boundary conditions by inversion of the involute of a circle
To construct a curve with a monotonic curvature (spiral), and given tangents and curvatures at the ends, the author proposed the following method. From given boundary conditions, the values of two inverse invariants are determined. Then, on some base spiral (initially, a logarithmic spiral was chosen), an arc with the same invariant values is sought for. A linear-fractional map of the found arc solves the problem. It seems that choosing the involute of a circle as the base spiral yields the simplest solution, which we present here.
Read the full abstract
Optimization and Control
Quantitative Uniqueness of Kantorovich Potentials
This paper studies the uniqueness of solutions to the dual optimal transport problem, both qualitatively and quantitatively (bounds on the diameter of the set of optimisers). On the qualitative side, we prove that when one marginal measure's support is rectifiably connected (path-connected by rectifiable paths), the optimal dual potentials are unique up to a constant. This represents the first uniqueness result applicable even when both marginal measures are concentrated on lower-dimensional subsets of the ambient space, and also applies in cases where optimal potentials are nowhere differentiable on the supports of the marginals. On the quantitative side, we control the diameter of the set of optimal dual potentials by the Hausdorff distance between the support of one of the marginal measures and a regular connected set. In this way, we quantify the extent to which optimisers are almost unique when the support of one marginal measure is almost connected. This is a consequence of a novel characterisation of the set of optimal dual potentials as the intersection of an explicit family of half-spaces.
Read the full abstract
Optimization and Control
Adaptive Mitigation of Insider Threats via Off-Policy Learning
An insider is a team member who covertly deviates from the team's optimal collaborative strategy to pursue a private objective while still appearing cooperative. Such an insider may initially behave cooperatively but later switch to selfish or malicious actions, thereby degrading collective performance, threatening mission success, and compromising operational safety. In this paper, we study such insider threats within an insider-aware, game-theoretic formulation, where the insider interacts with a decision maker (DM) under a continuous-time switched system, with each time interval characterized by a distinct insider behavioral pattern or threat level. We develop a periodic off-policy mitigation scheme that enables the DM to learn optimal mitigation policies from online data when encountering different insider threats, without requiring a priori knowledge of insider intentions. By designing appropriate conditions on the inter-learning interval time, we establish convergence guarantees for both the learning process and the closed-loop system, and characterize the corresponding mitigation performance achieved by the DM.
Read the full abstract
Rings and Algebras
Polynomial interpolation of partial functions in finite algebras with a Mal'cev term
We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and Słomczyńska introduced the completeness concept of being polynomially rich: a finite algebra is polynomially rich if every function preserving congruences and the Tame Congruence Theory labelling of prime quotients in the congruence lattice is a polynomial function of the algebra. We call a finite algebra strictly polynomially rich if every partial congruence and type preserving function is a polynomial function, and we describe strictly polynomially rich algebras in congruence permutable varieties.
Read the full abstract
Analysis of PDEs
Regularity of fractional Schrödinger equations and sub-Laplacian multipliers on the Heisenberg group
We define functions of the sub-Laplacian $\Delta$ on the Heisenberg group $\mathbb H^d$ as Fourier multipliers. In this setting, we show that the solution $u$ of the free fractional Schrödinger equation $i\partial_tu + (-\Delta)^\nu u = 0, u|_{t=0} = u_0$, for any $\nu > 0$, satisfies the Hardy space estimate that $$ \|u(t,\cdot)\|_{H^p(\mathbb H^d)} \leq C_p (1 + t)^{Q|1/p-1/2|}\|(1-\Delta)^{\nu Q|1/p-1/2|}u_0\|_{H^p(\mathbb H^d)}, $$ with $Q = 2d + 2$, for all $p \in (0,\infty)$, and the corresponding estimate with $p = \infty$ in $\mathrm{BMO}(\mathbb H^d)$. This is done via a general regularity result for parameter dependent sub-Laplacian Fourier multipliers. We prove also that Bessel potential spaces on the Heisenberg group correspond to Sobolev spaces in the same way as in Euclidean space, also for Hardy spaces.