Peer Revenue Equity in science

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Monday 9 March

Numerical Analysis

On $p$-robust convergence and optimality of adaptive FEM driven by equilibrated-flux estimators

Building on existing $hp$-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329–366] and the references therein, we propose a novel $h$-adaptive algorithm for a fixed polynomial degree $p$. We consider a conforming finite element discretization of the Poisson equation in two or three space dimensions. Supposing piecewise polynomial right-hand side of degree $p-1$, we show that the algorithm yields error contraction at each step, with a contraction factor that is independent of $p$ provided that a certain a posteriori verifiable criterion is satisfied. We further show that this algorithm converges at optimal algebraic rate $s$ if the Dörfler marking parameter is chosen below some specified $p$-independent upper threshold. The constants involved here are $p$-robust, although they may depend on the rate $s$. The theoretical results are supported by numerical experiments, in which the a posteriori criterion is always satisfied for one or a few local mesh refinement steps by newest-vertex bisection.
Read the full abstract

All authors Théophile Chaumont-Frelet, Zhaonan Dong, Gregor Gantner, Martin Vohralík

Information Theory

Feedback Does Not Increase the Capacity of Approximately Memoryless Surjective POST Channels

We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are sufficiently close to one another. For this family of channels, under a surjectivity condition on the associated memoryless reference channel, we show that the feedback capacity coincides with the non-feedback capacity. Consequently, for almost all approximately memoryless POST channels whose input alphabet size is no smaller than the output alphabet size, feedback provides no capacity gain. This result extends Shannon's classical theorem on discrete memoryless channels and demonstrates that the phenomenon holds well beyond the strictly memoryless case.
Read the full abstract

Dynamical Systems · Cross-listed from q-bio.MN

Automated Classification of Homeostasis Structure in Input-Output Networks

Homeostasis is widely observed in biological systems and refers to their ability to maintain an output quantity approximately constant despite variations in external disturbances. Mathematically, homeostasis can be formulated through an input-output function mapping an external parameter to an output variable. Infinitesimal homeostasis occurs at isolated points where the derivative of this input-output function vanishes, allowing tools from singularity theory and combinatorial matrix theory to characterize homeostatic mechanisms in terms of network topology. However, the required combinatorial enumeration becomes increasingly intractable as network size grows, and the reliance on advanced graph-theoretic concepts limits accessibility and practical use in biological applications. To overcome these limitations, we develop a Python-based algorithm that automates the identification of homeostasis subnetworks and their associated homeostasis conditions directly from network topology. Given an input-output network specified solely by its connectivity structure and designated input and output nodes, the algorithm identifies the relevant graph-theoretical structures and enumerates all homeostatic mechanisms. We demonstrate its applicability across a range of biological examples, including small and large networks, networks with single or multiple input nodes or parameters, and cases where input and output coincide. This wide applicability stems from our extension of the theoretical framework from single-input-single-output networks to networks with multiple input nodes through an augmented single-input-node representation. The resulting computational framework provides a scalable and systematic approach to classifying homeostatic mechanisms in complex biological networks, facilitating the application of advanced mathematical theory to a broad range of biological systems.
Read the full abstract

Combinatorics

Hierarchical threshold structure in Max-Cut with geometric edge weights

We study a family of weighted Max-Cut instances on the complete graph $K_n$ in which edge weights decrease geometrically in lexicographic order: the $i$-th edge has weight $r^{N-i}$ where $N=\binom{n}{2}$. For $r\ge 2$, the lexicographically first cut is optimal; for $r=1$, all edges have equal weight and the balanced partition wins. In this paper we study the intermediate regime $1< r <2$. The geometric weighting makes early edges dominant and singles out the $k$-isolated cuts $C_k=\{1,\dots,k\}\mid\{k+1,\dots,n\}$ as natural candidates for optimality. For each $n$ and $k\le\lfloor n/2\rfloor-1$, we define threshold polynomials $P^{n,k}(r)$ whose unique roots $r_k(n)\in(1,2)$ determine when $C_k$ and $C_{k+1}$ exchange dominance. We prove that, for fixed $n$, these thresholds are strictly decreasing in $k$ and that $r_k(n)\to 1$ as $n\to\infty$. As our main result, we show that for $r\in(r_k(n),r_{k-1}(n))$ the cut $C_k$ achieves maximum weight among all isolated cuts, yielding a sharp phase diagram for the isolated-cut family. We conjecture that isolated cuts are globally optimal among all $2^{n-1}$ cuts when $n\ge 7$; all counterexamples for small $n$ are characterized completely, and extensive computations for $n\le 100$ support the conjecture.
Read the full abstract

Algebraic Geometry

Cycles on splitting models of Shimura varieties

We construct exotic Hecke correspondences between the special fibers of different PEL type Shimura varieties, when the local groups are restrictions of scalars of unramified groups. In particular, the local groups themselves are not necessarily unramified, and the Shimura varieties can have bad reduction. By adapting the methods of Xiao-Zhu in the case of good reduction, we use this to construct new instances of the geometric Jacquet-Langlands correspondence, including a motivic refinement, and verify generic instances of the Tate conjecture for the special fibers of these Shimura varieties at very special level. Our main tool is to resolve the integral models by the splitting models of Pappas-Rapoport. We also define splitting versions of the moduli stacks of local shtukas and affine Deligne-Lusztig varieties, and study their geometry.
Read the full abstract

Combinatorics

Domination polynomial of co-maximal graphs of integer modulo ring

We investigate the domination polynomial of the co-maximal graph $\Gamma(\mathbb{Z}_n)$ related to the ring of integers modulo $n$. Such a polynomial encodes domination sets of all possible sizes, a NP-hard problem for general graph. We give exact formulas for prime powers, integers with two distinct prime divisors, and products of three distinct primes. A prime-support decomposition gives a finite explicit formula for arbitrary $n$, including repeated prime factors. Further results determine the highest coefficients, the precise threshold beyond which every vertex subset dominates, and the number of non-dominating subsets. We discuss unimodality and log-concavity, and derive justified bounds for nonzero domination roots using the Eneström–Kakeya theorem.
Read the full abstract

Classical Analysis and ODEs

The $p$-Hardy-Rellich-Birman inequalities on the half-line

The classical discrete $p$-Hardy inequality establishes a sharp relationship between the $\ell^{p}$-norms of a sequence and its discrete derivative. In this paper, we generalize this inequality to discrete derivatives of arbitrary integer order $\ell \geq 1$, yielding discrete $p$-Rellich ($\ell=2$) and general $p$-Birman ($\ell \geq 3$) inequalities. As a key step in the proof, we deduce a variant of the Copson inequality with a negative exponent, which may be of independent interest. Furthermore, we demonstrate how the continuous $p$-Birman inequality can be recovered from our discrete version, providing an alternative proof of this classical result. All constants in the obtained inequalities are shown to be optimal.
Read the full abstract

Dynamical Systems

Geometric early warning indicator from stochastic separatrix structure in a random two-state ecosystem model

Under-ice blooms in the Arctic can develop rapidly under conditions where conventional early warning signals based on critical slowing down fail due to strong noise or limited observational records. We analyze noise-induced transitions in a temperature phytoplankton stochastic differential equation model exhibiting bistability between background and bloom states. The committor function defines a stochastic separatrix as its 1/2-isocommittor, and the normal width of the associated transition layer yields a geometric indicator via arc-length averaging. Under systematic variation of noise intensity, this indicator scales linearly with noise strength, while the logarithm of the mean first passage time follows the Freidlin-Wentzell asymptotic law. Eliminating the noise parameter produces an affine scaling between the logarithmic transition time and the inverse square of the geometric indicator. The relation is robust under variations in discretization, neighborhood definition, and diffusion structure, and holds in the weak noise regime where the transition-layer width scales linearly with noise strength. Unlike variance or lag-one autocorrelation, the geometric indicator remains well defined when rapid transitions preclude reliable time-series estimation. These results provide a geometrically interpretable precursor of bloom onset that may support model-based ecological monitoring in high-variability Arctic systems.
Read the full abstract

All authors Yuzhu Shi, Larissa Serdukova, Yayun Zheng, Sergei Petrovskii, Valerio Lucarini

Mathematical Physics · Cross-listed from quant-ph

The Structure of Circle Graph States

Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computation (MBQC); however, MBQC on circle graph states is actually efficiently classically simulable. In this work, we paint a detailed picture of the local equivalence of circle graph states. First, we consider the class of all graph states that are local unitary (LU)-equivalent to circle graph states. In graph-theoretical terms, this LU-equivalence class is the set of all graphs reachable from the family of circle graphs by applying $r$-local complementations. We prove that the only graph states that are LU-equivalent to circle graph states are circle graph states themselves: circle graphs are closed under $r$-local complementation. Second, we show that bipartite circle graph states, i.e., 2-colorable circle graph states, are in one-to-one correspondence with planar code states, on which MBQC is known to be efficiently classically simulable. Leveraging this correspondence, we present alternative, simple proofs that (1) if a planar code state is LU-equivalent to a stabilizer state, they are in fact local Clifford (LC)-equivalent to it and that (2) MBQC on all circle graph states is efficiently classically simulable. Third and finally, we demonstrate that the problem of counting the number of graph states LU-equivalent to a given graph state is $\#\mathsf{P}$-hard.
Read the full abstract

All authors Frederik Hahn, Rose McCarty, Hendrik Poulsen Nautrup, Nathan Claudet

Commutative Algebra

Asymptotic $\mathrm{v}$-number of graded families of ideals and the Newton-Okounkov region

In this paper, we prove that for Noetherian graded families $\mathcal{I} = \{I_k\}_{k \ge 0}$ of homogeneous ideals in a Noetherian $\mathbb{N}$-graded Noetherian domain, $\lim\limits_{k \to \infty} \frac{\mathrm{v}(I_k)}{k}$ exists, and is given by $\frac{\alpha(I_r)}{r}$ for some $r \ge 1$, where $\alpha(I)$ denotes the initial degree. Extending these results to integral closures, we show that $ \lim\limits_{k\to\infty}\frac{\mathrm{v}(\overline{I_k})}{k} = \lim\limits_{k\to\infty}\frac{\alpha(\overline{I_k})}{k}=\lim\limits_{k\to\infty}\frac{\mathrm{v}(I_k)}{k}=\lim\limits_{k\to\infty}\frac{\alpha(I_k)}{k} $. For a graded family of monomial ideals in a polynomial ring, we provide a combinatorial interpretation of these limits via Newton–Okounkov regions $\Delta(\mathcal{I})$. This connection is further generalized to arbitrary homogeneous ideals using good valuations. We also establish that both $\operatorname{reg}(I_k)$ and $\mathrm{v}(I_k)$ are eventually quasi-linear functions of $k$ for any Noetherian graded family. For a stable monomial ideal $I$ we show that $\mathrm{v}(I) < \operatorname{reg}(I)$. Finally, for a zero-dimensional homogeneous ideal $I$ in a polynomial ring $S$, we prove that $\mathrm{v}(I) < e(S/I)$, where $e(S/I)$ denotes the multiplicity.
Read the full abstract

Commutative Algebra

Determinantal computation of minimal local GADs

We study local generalized additive decompositions (GADs) of homogeneous polynomials and their associated points schemes through their local inverse systems. We verify that their construction and algebraic properties are independent of the chosen apolarity action. We propose a determinantal method for computing minimal local GADs by minimizing the rank of a symbolic inverse system. When the locus of minimal supports is finite, this procedure provides a practical tool to determine all minimal local decompositions without tensor extensions. We prove that this finiteness is guaranteed whenever the local GAD-rank of the form does not exceed its degree. We analyze both generic and special cases, provide computational evidence assessing the impact of different choices for minors in the determinantal algorithm, and compare our approach with existing algorithms for local apolar schemes.
Read the full abstract

Mathematical Physics

Spectral transitions in some Rabi models

We consider the transition from discrete to continuous spectrum which occurs in some quantum Rabi models. We present recent developments of the subordinacy theory and their applications to study the spectral properties of the intensity-dependent Rabi model, the anisotropic two-photon Rabi model, and the two-photon Rabi-Stark model for the whole range of parameters. Our analysis allows us to detect and locate the continuous spectrum. Moreover, we prove the absence of eigenvalues in the interior of the continuous spectrum and the absence of a singular spectrum for all models considered.
Read the full abstract

Dynamical Systems

Orbits of the three-body problem with large potential

Consider the planar three-body problem with masses positive $m_1,m_2,m_3$ position vector $q(t) = (q_1(t),q_2(t),q_3(t))\in\mathbb{R}^6$. Let $$U(q) = \frac{m_1m_2}{r_{12}}+\frac{m_1m_3}{r_{13}}+\frac{m_2m_3}{r_{23}}$$ where $r_{ij}=|q_i-q_j|$. Assume that the angular momentum is nonzero so that triple collision is impossible and fix any negative energy.. Then given any constant $K>0$ there are solutions with $U(q(t))\ge K$ for all $t\in\mathbb{R}$. These solutions will have a single close approach to triple collision. The configuration will always be a tight binary with $m_1, m_2$ close and the distance from the binary to $m_3$ diverging as $t\rightarrow\pm\infty$.
Read the full abstract

Combinatorics

Circular chromatic index of small graphs

We systematically determine circular chromatic index of small graphs and multigraphs with maximum degree $4$, $5$, $6$ (and also their number for a given small order). We construct several infinite families of such graphs with circular chromatic index in the set $\{\Delta + 1/2, \Delta + 2/3, \Delta + 3/4$, $\Delta + 1\}$. Our results refute edge-connectivity variants of the “Upper Gap Conjecture” (about the non-existence of graphs with circular chromatic index just below $\Delta + 1$).
Read the full abstract

Combinatorics

The structure of group-labeled graphs forbidding an immersion

A $\Gamma$-labeled graph is an oriented graph with edges invertibly labeled by a group $\Gamma$. We prove a structure theorem for $\Gamma$-labeled graphs which forbid a fixed $\Gamma$-labeled graph as an immersion, for any finite $\Gamma$. Roughly, we show that such graphs admit a tree-cut decomposition in which every bag either contains few high degree vertices or is nearly signed over a proper subgroup of $\Gamma$.
Read the full abstract

Algebraic Geometry · Cross-listed from hep-th

Crystal Melting, Triality and Partition Functions for Toric Calabi-Yau Fourfolds

We extend the study of the recently introduced crystal melting models associated to toric Calabi-Yau 4-folds in several directions. In particular, we investigate in greater detail the structure of these models for general toric CY 4-folds and flavor configurations, using the explicit example of $Q^{1,1,1}$ to illustrate our ideas. To this end, we develop an efficient algorithm for constructing crystals based on periodic quivers. A central goal of this work is to understand the behavior of crystals and their partition functions under triality. We analyze the evolution of crystals along periodic triality cascades and generate detailed data for these systems, including Hasse diagrams, partition functions, and the multiplicities of melting configurations. We introduce the notion of stable variables and show that they lead to the stabilization of the partition functions along cascades. Finally, we define the profile of the crystal partition function and observe that, when expressed in terms of stable variables, it displays interesting behavior. A further motivation for this work is to generate empirical data that may guide the search for a physically motivated generalization of cluster algebras associated with $2d$ (0,2) quiver theories and their triality transformations.
Read the full abstract

Metric Geometry · Cross-listed from cs.IR

Time warping with Hellinger elasticity

We consider a matching problem for time series with values in an arbitrary metric space, with the stretching penalty given by the Hellinger kernel. To optimize this matching, we introduce the Elastic Time Warping algorithm with a cubic computational complexity.

Numerical Analysis · Cross-listed from quant-ph

Quantum algorithm for anisotropic diffusion and convection equations with vector norm scaling

In this work, we tackle the resolution of partial differential equations (PDEs) on digital quantum computers. Two fundamental PDEs are addressed: the anisotropic diffusion equation and the anisotropic convection equation. We present a quantum numerical scheme consisting of three steps: quantum state preparation, evolution with diagonal operators, and measurement of observables of interest. The evolution step relies on a high-order centered finite difference and a product formula approximation, also known as Trotterization. We provide novel vector-norm analysis to bound the different sources of error. We prove that the number of time-steps required in the evolution can be reduced by a factor $\Theta (16^n)$ for the diffusion equation, and $\Theta (4^n)$ for the convection equation, where $n$ is the number of qubits per dimension, an exponential reduction compared to the previously established operator-norm analysis.
Read the full abstract

All authors Julien Zylberman, Thibault Fredon, Nuno F. Loureiro, Fabrice Debbasch

Mathematical Physics · Cross-listed from gr-qc

Partial Orderings of Curvature Invariants

We establish a new set of pointwise inequalities that order curvature invariants across various Petrov and Segre types of spacetimes. In arbitrary spacetime dimension, we systematically analyze inequalities among contractions of the Ricci tensor. We further explore the conditions under which all Zakhary–McIntosh invariants in $(1+3)$-dimensional spacetimes are bounded above (up to appropriate powers) by the Kretschmann scalar. These results establish a practical hierarchy among curvature scalars and clarify the extent to which higher-order invariants are algebraically controlled by lower-order ones or vice versa.
Read the full abstract

Numerical Analysis

An efficient predictor-corrector approach with orthogonal spline collocation finite element technique for FitzHugh-Nagumo problem

This paper constructs a predictor-corrector technique with orthogonal spline collocation finite element method for simulating a FitzHugh-Nagumo system subject to suitable initial and boundary conditions. The developed computational technique approximates the exact solution in time using variable time steps at the predictor phase and a constant time step at the corrector stage while the orthogonal spline collocation finite element method is employed in the space discretization. The new algorithm presents several advantages: (i) the errors increased at the predictor phase are balanced by the ones decreased at the corrector phase so that the stability is preserved, (ii) the variable time steps at the predictor stage overcome the numerical oscillations, (iii) the spatial errors are minimized due to the use of collocation nodes, and (iv) the linearization of the nonlinear term reduces the required operations at the corrector stage. As a result, the new computational technique computes efficiently both predicted and corrected solutions and preserves a strong stability and high-order accuracy even in the presence of singularities. The theoretical results suggest that the constructed approach is unconditionally stable, spatial $mth$-order accurate and temporal second-order convergent in the $L^{\infty}(0,T;[H^{m}(\Omega)]^{2})$-norm. Some numerical experiments are carried out to confirm the theoretical analysis and to demonstrate the applicability and performance of the proposed strategy.
Read the full abstract

Information Theory · Cross-listed from stat.ML

Micro-Diffusion Compression - Binary Tree Tweedie Denoising for Online Probability Estimation

We present Midicoth, a lossless compression system that introduces a micro-diffusion denoising layer for improving probability estimates produced by adaptive statistical models. In compressors such as Prediction by Partial Matching (PPM), probability estimates are smoothed by a prior to handle sparse observations. When contexts have been seen only a few times, this prior dominates the prediction and produces distributions that are significantly flatter than the true source distribution, leading to compression inefficiency. Midicoth addresses this limitation by treating prior smoothing as a shrinkage process and applying a reverse denoising step that corrects predicted probabilities using empirical calibration statistics. To make this correction data-efficient, the method decomposes each byte prediction into a hierarchy of binary decisions along a bitwise tree. This converts a single 256-way calibration problem into a sequence of binary calibration tasks, enabling reliable estimation of correction terms from relatively small numbers of observations. The denoising process is applied in multiple successive steps, allowing each stage to refine residual prediction errors left by the previous one. The micro-diffusion layer operates as a lightweight post-blend calibration stage applied after all model predictions have been combined, allowing it to correct systematic biases in the final probability distribution. Midicoth combines five fully online components: an adaptive PPM model, a long-range match model, a trie-based word model, a high-order context model, and the micro-diffusion denoiser applied as the final stage.
Read the full abstract

Combinatorics · Cross-listed from q-bio.MN

Duality in mass-action networks

Mass-action networks are special cases of chemical reaction networks. For these systems, we argue that conserved quantities are dual to internal cycles. We introduce maximal invariant polyhedral supports, and we conjecture that there is a duality relation between preclusters and maximal invariant polyhedral supports. Given the close relation between maximal invariant polyhedral supports and siphons, we also conjecture that siphons and preclusters are dual objects.
Read the full abstract

Numerical Analysis

A finite element continuous data assimilation framework for a Navier–Stokes–Cahn–Hilliard system

This paper studies a coupled two-dimensional Navier–Stokes–Cahn–Hilliard phase-field model augmented by a transported auxiliary field, and develops a continuous data assimilation (CDA) framework for recovering its trajectories from coarse-in-space observations. We formulate a nudging-based CDA system for the coupled NSCH–auxiliary-field model, in which coarse measurements are incorporated through a general linear observation operator. The observation mechanism is described abstractly by an interpolant satisfying an $H^{2}$-type approximation property, which is compatible with coarse spatial observations obtained from mesh coarsening and reconstruction. At the continuous level, we record two structural properties of the model: a formal energy law for the reference system and an evolution law for the phase mean in the assimilated dynamics. At the discrete level, we introduce a capped fully discrete finite element splitting scheme using continuous quadratic elements for the phase, chemical potential, velocity, and auxiliary field, together with continuous linear elements for the pressure. For this scheme, we prove one-step well-posedness and establish a stepwise a priori estimate for the capped method. Numerical experiments illustrate the practical behavior of the proposed CDA approach. They demonstrate recovery from strongly mismatched initial conditions and show how synchronization depends on the observation resolution, boundary forcing, and feedback strength. A coarse-indistinguishability experiment further shows that identical coarse initial information may correspond to distinct fine-scale evolutions, while the assimilated dynamics select the trajectory determined by the supplied time-dependent observations.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

A proof of conservation laws in gravitational scattering: tails and breaking of peeling

We propose a definition of asymptotically flat spacetimes that is consistent with both null infinities and compatible with known properties of gravitational scattering, incoming and outgoing radiation, and interactions with matter. For this class of spacetimes, we prove three antipodal matching conditions at spatial infinity: one for the so-called dual mass aspect, one for the leading tail of the shear, and one that non-trivially relates the peeling properties of the spacetime at both null infinities to the leading tail and mass aspect at spatial infinity. Furthermore, we reformulate these identities as conservation and flux balance laws defined on the boundary hyperboloid at spatial infinity.
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Approximate QCAs in one dimension using approximate algebras

Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small error, as occurs for local quantum dynamics on the lattice. A priori, approximate QCAs could exhibit genuinely new behavior, failing to be well-approximated by any exact QCA. We show this does not occur in one dimension: every approximate QCA on a finite circle can be rounded to a strict QCA with approximately the same action on local operators, so these systems are classified by the same index as in the exact case. Previous work considered the case of the infinite line, by using global methods not amenable to finite systems. Our new approach proceeds locally and now applies to finite systems, including circles or homomorphisms from sub-intervals. We extract exact local boundary algebras from the approximate QCA restricted to local patches, then glue these to form a strict QCA. The key technical ingredient is a robust notion of the intersection of two subalgebras: when the projections onto two subalgebras approximately commute, we construct an exact subalgebra that serves as a stable proxy for their intersection. This construction uses a recent theorem of Kitaev on the rigidity of approximate $C^*$-algebras.
Read the full abstract

Logic

Four negations and the spectral presheaf

Using Vakarelov's theory of lattice logics with negation, we introduce the (co)quasiintuitionistic logic, and prove its soundness and completeness with respect to the class of (co)quasiintuitionistic algebras. Combining these algebras together, we obtain biquasiintuitionistic algebras and the biquasiintuitionistic logic. Their further extension with the Skolem algebra structure defines Akchurin algebras and the respective logic, which is a product of biquasiintuitionistic and biintuitionistic logics, featuring four distinct negations. Next we generalise the framework of spectral presheaves (which is a main object in the Butterfield–Isham–Döring topos theoretic approach to quantum mechanics) to arbitrary complete orthocomplemented lattices, and show that the orthocomplementation determines two negation operators on the spectral presheaf (one paraconsistent, another paracomplete), equipping the set of all closed-and-open subpresheaves of a spectral presheaf with the structure of a biquasiintuitionistic algebra. Combined with the generic Skolem (i.e. Heyting and Brouwer) algebra structure of this set, this gives a particular instance of an Akchurin algebra. We also show that the underlying orthocomplemented lattice can be reconstructed as an internal object of the spectral presheaf, resulting as the image of a double coquasiintuitionistic (resp., quasiintuitionistic) negation monad (resp., comonad). Finally, we prove a no-go theorem for the claim that the spectral presheaf is a model of a dialectical (or any other) relevance logic.
Read the full abstract

Commutative Algebra

Homogeneous ideals with minimal singularity thresholds

Let $(\mathcal{O}_n, \mathfrak{m})$ denote the ring of germs of holomorphic functions $\mathbb{C}^n\to \mathbb{C}$, and let $I\subseteq \mathcal{O}_n$ be an $\mathfrak{m}$-primary ideal. Demailly and Pham showed that $\mathrm{lct}(I) \geq \frac{1}{e_1(I)} + \dots + \frac{e_{n-1}(I)}{e_n(I)}$, where $e_j(I)$ is the mixed multiplicity $e(I,\dots, I, \mathfrak{m},\dots, \mathfrak{m})$, with $I$ repeated $j$ times and $\mathfrak{m}$ repeated $n-j$ times. We generalize the lower bound to the case of an arbitrary ideal of an excellent regular local (or standard-graded) ring of equal characteristic, with $\mathrm{lct}(I)$ replaced by the $F$-threshold $c^{\mathfrak{m}}(I)$ in positive characteristic. Our main result is a classification of homogeneous ideals in polynomial rings for which the lower bound is attained, resolving a conjecture of Bivià-Ausina in the graded case.
Read the full abstract

Mathematical Physics · Cross-listed from nlin.SI

Soliton solutions to the coupled Sasa-Satsuma equation under mixed boundary conditions

In this paper, we derive general bright-dark soliton solutions to the coupled Sasa-Satsuma (CSS) equation using the Kadomtsev-Petviashvili (KP) reduction method. Since the CSS equation is a special case of the four-component Hirota equation, our approach begins with the construction of two-bright-two-dark soliton solutions for the four-component Hirota equation. By imposing specific parameter constraints, these solutions are subsequently reduced to the bright-dark soliton solutions of the CSS equation. Finally, the dynamical behaviors of the one- and two-bright-dark soliton solutions are thoroughly analyzed and illustrated.
Read the full abstract

All authors Changyan Shi, Xiyao Chen, Guangxiong Zhang, Chengfa Wu, Bao-Feng Feng

Combinatorics

The Lovász conjecture holds for moderately dense Cayley graphs

We show that there is an absolute constant $c>0$ such that every large connected $n$-vertex Cayley graph with degree $d\geq n^{1-c}$ has a Hamilton cycle. This makes progress towards the Lovász conjecture and improves upon the previous best result of this form due to Christofides, Hladký, and Máthé from 2014 concerning graphs with $d\geq \varepsilon n$. Our proof avoids the use of Szemerédi's regularity lemma and relies instead on an efficient arithmetic regularity lemma specialised to Cayley graphs.
Read the full abstract

All authors Benjamin Bedert, Nemanja Draganić, Alp Müyesser, Matías Pavez-Signé

Optimization and Control

Faster Parametric Submodular Function Minimization by Exploiting Duality

Let $f:2^{E} \rightarrow \mathbb{Z}_+$ be a submodular function on a ground set $E = [n]$, and let $P(f)$ denote its extended polymatroid. Given a direction $d \in \mathbb{Z}^n$ with at least one positive entry, the line search problem is to find the largest scalar $\lambda$ such that $\lambda d \in P(f)$. The best known strongly polynomial-time algorithm for this problem is based on the discrete Newton's method and requires $\tilde{O}(n^2 \log n)\cdot$ SFM time, where SFM is the time for exact submodular function minimization under the value oracle model. In this work, we study the first weakly polynomial-time algorithms for this problem. We reduce the number of calls to the exact submodular minimization oracle by exploiting a dual formulation of the parametric line search problem and recent advances in cutting plane methods. We obtain a running time of \[ O\bigl(n^2 \log(nM\|d\|_1)\cdot \text{EO} + n^3 \log(nM\|d\|_1)\bigr) + O(1)\cdot \text{SFM}, \] where $M = \|f\|_\infty$ and EO is the cost of evaluating $f$ at a set. Note that when $\log \|d\|_1 = O(\log (nM))$, this matches the current best weakly polynomial running time for submodular function minimization [Lee, Sidford, Wong '15], and therefore, one cannot hope to improve this running time. Our approach proceeds by deriving a dual formulation that minimizes the Lovász extension $F$ over a hyperplane intersecting the unit hypercube, and then solving this dual problem approximately via cutting-plane methods, after which we round to the exact intersection using the integrality of $f$ and $d$.
Read the full abstract