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)

Wednesday 25 February

Group Theory

Quadratic Equations in Graph Products of Groups and the Exponent of Periodicity

In 1977, Makanin established the decidability of equations in free monoids. A key ingredient in his proof is the exponent of periodicity: for a word $w$, it is the largest exponent $e$ such that $w$ contains a nonempty factor of the form $p^e$. Makanin showed the following for a system of equations in free monoids: if the system has a solution with a sufficiently large exponent of periodicity, then it has infinitely many solutions. However, the converse – whether the existence of infinitely many solutions implies the existence of solutions with arbitrarily large exponent of periodicity – remains open. In this paper, we investigate the analogous problem for quadratic equations in finitely generated groups. We use normal forms to define the exponent of periodicity. We then identify structural conditions on groups and their normal forms that guarantee that infinite solution sets of quadratic systems have an unbounded exponent of periodicity. We prove that these conditions are preserved under graph products and, in particular, hold for all finitely generated right-angled Artin groups. In addition, we show that they also hold for finitely generated (graph products of) torsion-free nilpotent and hyperbolic groups, and we characterize the Baumslag-Solitar groups satisfying them.
Read the full abstract

Optimization and Control · Cross-listed from cs.DS

Robust Permutation Flowshops Under Budgeted Uncertainty

We consider the robust permutation flowshop problem under the budgeted uncertainty model, where at most a given number of job processing times may deviate on each machine. We show that solutions for this problem can be determined by solving polynomially many instances of the corresponding nominal problem. As a direct consequence, our result implies that this robust flowshop problem can be solved in polynomial time for two machines, and can be approximated in polynomial time for any fixed number of machines. The reduction that is our main result follows from an analysis similar to Bertsimas and Sim (2003) except that dualization is applied to the terms of a min-max objective rather than to a linear objective function. Our result may be surprising considering that heuristic and exact integer programming based methods have been developed in the literature for solving the two-machine flowshop problem. Next, we show a logarithmic factor improvement in the overall running time implied by a naive reduction to nominal problems in the case of two machines and three machines. We conclude by noting that our reduction appears to have more general consequences for robust optimization problems under budgeted uncertainty having a similar form.
Read the full abstract

Probability

Detection, coverage and percolation in dynamic Boolean models with random radii based on $\alpha$-stable processes

We consider a dynamic network in continuum time and space in which nodes, with initial locations given by a Poisson point process, move according to i.i.d. isotropic $\alpha$-stable processes. Each node is additionally equipped with an i.i.d. detection radius. Inspired by corresponding results by Peres et. al. on mobile networks based on Brownian sausages with fixed width, we investigate the tail behaviour of three stopping times: The detection time of the first discovery of a designated node, the first coverage of an entire set, and the first discovery of a node by the infinite connected component of the system. Broadly speaking, we discover that the stability index as well as the random radii manifest themselves only in constants in the otherwise exponential decay rates. The proofs rest on heat-kernel bounds for the underlying Lévy processes and a detailed multiscale analysis allowing us to control the space-time correlations of the system.
Read the full abstract

All authors Peter Gracar, Benedikt Jahnel, Lukas Lüchtrath, Anh Duc Vu

Probability

On the absence of time-translation symmetry breaking in some non-reversible interacting particle systems

The conditions under which stochastic systems of infinitely many interacting particles can maintain sufficient spatial order to move coherently along a time-periodic orbit, thereby breaking the time-translation invariance of the underlying dynamical equation, have been an elusive issue. Via a free energy technique, we prove that if a non-reversible interacting particle system on $\mathbb{Z}^d$, $d=1,2$, with strictly positive rates admits a product measure as a stationary measure, then it cannot exhibit time-periodic behaviour. This provides a first step towards a general conjecture that time-periodic behaviour cannot occur in one- and two-dimensional systems with short-range interactions and constitutes the first result for non-reversible dynamics in dimension two.
Read the full abstract

Analysis of PDEs

Velocity Reconstruction from Flow-Induced Magnetic Fields

We study the inverse problem of reconstructing an incompressible velocity field $\boldsymbol{v}$ from observations of the induced magnetic field $\boldsymbol{b}$. In the presence of a strong, constant background field $\mathbf{F}$, the evolution of the magnetic perturbation $\boldsymbol{b}$ is governed by the linearized induction equation. We analyze the system on both the entire space $\Omega = \mathbb{R}^d$ and a periodic domain $\Omega = \prod_{i=1}^d [0, L_i)$, which models a homogeneous medium with side lengths $L_i > 0$. We analyze this problem by decomposing it into the injectivity of a parabolic forward map and the solvability of a divergence-free transport sub-problem. On the whole space $\mathbb{R}^d$, we show that the transport sub-problem is well-posed when data is prescribed on a non-characteristic hypersurface transverse to $\mathbf{F}$. On the torus, we establish a sharp uniqueness criterion based on the rational dependence of the ratios $\{F_i/L_i\}_{i=1}^d$ between the background-field components and the corresponding domain periods. Furthermore, we show that for the reconstructed velocity to belong to $L^2$, a sufficient condition is that the background field must satisfy a Diophantine condition. The proof combines injectivity of the parabolic forward map with uniqueness for a steady transport equation along $\mathbf{F}$.
Read the full abstract

All authors Yacine Mokhtari, Christina Frederick, Yunan Yang, Bjorn Engquist

Combinatorics

Linear clique-width and modular decomposition

A hereditary class of graphs has bounded clique-width if and only if its prime members do, but this lifting property fails for linear clique-width. We prove that a hereditary class has bounded linear clique-width if and only if its prime members do and it contains neither all quasi-threshold graphs nor all complements of quasi-threshold graphs. This generalizes a result of Brignall, Korpelainen, and Vatter, who established the result for cographs.
Read the full abstract

Numerical Analysis

Matrix Perturbation Theory in the Tangent Space of Isospectral Matrices

Eigenvalue and eigenvector perturbation theory is a fundamental topic in several disciplines, including numerical linear algebra, quantum physics, and related fields. The central problem is to understand how the eigenvalues and eigenvectors of a matrix $A \in \mathbb{C}^{n \times n}$ change under the addition of a perturbation matrix $E \in \mathbb{C}^{n \times n}$. Much of the existing literature focuses on structured perturbations. For example, in [C.-K. Li and R.-C. Li, Linear Algebra Appl. 2005], the matrix $A$ is assumed to be Hermitian and block diagonal, while the perturbation $E$ is Hermitian and block off-diagonal. In this work, we investigate a different structured setting in which the perturbation has the commutator form $E = AB - BA$ for some matrix $B$, which we show to be a generalization of the block diagonal structure considered by Li and Li. First, we extend their main result by showing that the perturbation of the $i$-th eigenvalue of $A$, denoted by $\lambda_i$, is of order $\|E\|^2 / \eta_i$, where $\eta_i = \min_{j \neq i} |\lambda_i - \lambda_j|$ is the spectral gap associated with $\lambda_i$. Second, we provide a detailed analysis of the role played by the matrix $B$ in the perturbation of the eigenvectors. This analysis is further generalized to the case of block-diagonal matrices with multiple eigenvalues, as well as to perturbed singular values and eigenvalues of Jordan blocks.
Read the full abstract

Information Theory

Multichannel Conflict-Avoiding Codes for Expanded Scenarios

A conflict-avoiding code (CAC) of length L and weight w is used for deterministic multiple-access without feedback. When the number of simultaneous active users is less than or equal to w, such a code is able to provide a hard guarantee that each active user has a successful transmission within every consecutive L time slots. Recently, CACs were extended to multichannel CAcs (MC-CACs) over M orthogonal channels with the aim of increasing the number of potential users that can be supported. While most existing results on MC-CAC are derived under the assumption that M is not less than w, this paper focuses on the case that M is less than w, which is more relevant to practical application scenarios. In this paper, we first introduce the concept of exceptional codewords in MC-CACs. By employing some techniques from additive combinatorics, we derive a series of optimal MC-CACs. Along the way, several previously known optimal CAC results are generalized. Finally, our results extend naturally to AM-OPPTS MC-CACs and mixed-weight MC-CACs, two classes of relevant codes.
Read the full abstract

All authors Tsai-Lien Wong, Kangkang Xu, Yuan-Hsun Lo, Kenneth W. Shum, Yijin Zhang

Group Theory

On a Cauchy theorem for finite skew braces

One of the major problems in the structural theory of skew braces consists in the classification of skew braces of finite order up to isomorphism. In this light, the open question of the existence of a Cauchy theorem for finite skew braces is of great interest. We prove a positive answer for the classes of finite two-sided skew braces and bi-skew braces. Consequences and related structural results are also outlined.
Read the full abstract

Numerical Analysis

Optimal error bounds on the exponential integrator for dispersive equations with highly concentrated potential

We study a one-dimensional linear dispersive equation of differential order $\kappa \geq 2$ with concentrated potential of extension $\varepsilon$ with $0 < \varepsilon \ll 1$, featuring a competition between weak dispersion of strength $\varepsilon^\alpha \ (0 \leq \alpha \leq \kappa)$ and localization induced by the concentrated potential. We first obtain precise regularity estimates of the exact solution in terms of $\varepsilon$. We then apply a natural first-order exponential integrator with step size $\tau$ to discretize the equation, and establish an optimal error bound of the form $O_{L^\infty}(\tau \varepsilon^\beta)$ (up to logarithmic factors in $\tau$ and $\varepsilon$). Salient features of the result are: (i) error bounds are not only uniform in $\varepsilon$ but improve as $\varepsilon \rightarrow 0$; and (ii) no restriction on $\tau$ in terms of $\varepsilon$. The analysis combines iterated Duhamel's expansions and a transformation that exploits cancellations in oscillatory phases that cannot be obtained directly from regularity estimates of the exact solution. We also show that other classical numerical schemes, such as Lie or centered splitting schemes and low regularity integrators, fail to display optimal rates of convergence. Extensive numerical results are presented and confirm the theoretical error estimates.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Spin chains for ADE quiver theories

The spectral problem of four-dimensional superconformal quiver gauge theories can be mapped to one-dimensional spin chains with restricted Hilbert spaces, where the composition of neighbouring spins follows the path algebra of the quiver. To better understand such spin chains, we compute the one-loop planar dilatation operator for the 4d N=2 ADE quiver gauge theories obtained by orbifolding the N=4 Super-Yang-Mills theory and marginally deforming by independently varying the gauge couplings. This extends previous work which was mainly focused on the Z2 quiver. We characterise the general features of the resulting ADE spin-chain models and construct the 2-magnon Bethe ansatz for holomorphic states. We also evaluate, at large N, the N=2 superconformal index of these gauge theories and use it to study their protected spectrum in specific sectors.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Robust Model Selection for Discovery of Latent Mechanistic Processes

When learning interpretable latent structures using model-based approaches, even small deviations from modeling assumptions can lead to inferential results that are not mechanistically meaningful. In this work, we consider latent structures that consist of $K_o$ mechanistic processes, where $K_o$ is unknown. When the model is misspecified, likelihood-based model selection methods can substantially overestimate $K_o$ while more robust nonparametric methods can be overly conservative. Hence, there is a need for approaches that combine the sensitivity of likelihood-based methods with the robustness of nonparametric ones. We formalize this objective in terms of a robust model selection consistency property, which is based on a component-level discrepancy measure that captures the mechanistic structure of the model. We then propose the accumulated cutoff discrepancy criterion (ACDC), which leverages plug-in estimates of component-level discrepancies. To apply ACDC, we develop mechanistically meaningful component-level discrepancies for a general class of latent variable models that includes unsupervised and supervised variants of probabilistic matrix factorization and mixture modeling. We show that ACDC is robustly consistent when applied to unsupervised matrix factorization and mixture models. Numerical results demonstrate that in practice our approach reliably identifies a mechanistically meaningful number of latent processes in numerous illustrative applications, outperforming existing methods.
Read the full abstract

All authors Jiawei Li, Nguyen Nguyen, Meng Lai, Ioannis Ch. Paschalidis, Jonathan H. Huggins

Mathematical Physics

Solving the tetrahedron equation by Teichmüller TQFT

We propose an approach to construct three-dimensional lattice models using line defects in state integral models on shaped triangulations of 3-manifolds. The Boltzmann weights for these models satisfy a variant of the tetrahedron equation, which implies integrability under suitable assumptions on R-matrices and transfer matrices. As an explicit example, we present a solution produced by Teichmüller TQFT.
Read the full abstract

All authors Myungbo Shim, Xiaoyue Sun, Hao Ellery Wang, Junya Yagi

Optimization and Control

A Polyhedral Study on Unit Commitment with a Single Type of Binary Variables

Efficient power production scheduling is a crucial concern for power system operators aiming to minimize operational costs. Previous mixed-integer linear programming formulations for unit commitment (UC) problems have primarily used two or three types of binary variables. The investigation of strong formulations with a single type of binary variables has been limited, as it is believed to be challenging to derive strong valid inequalities using fewer binary variables, and the reduction of the number of binary variables is often accompanied by a compromise in tightness. To address these issues, this paper considers a formulation for unit commitment using a single type of binary variables and develops strong valid inequality families to enhance the tightness of the formulation. Conditions under which these strong valid inequalities serve as facet-defining inequalities for the single-generator UC polytope are provided. For those large-size valid inequality families, the existence of efficient separation algorithms for determining the most violated inequalities is also discussed. The effectiveness of the proposed single-binary formulation and strong valid inequalities is demonstrated through computational experiments on network-constrained UC problems. The results indicate that the strong valid inequalities presented in this paper are effective in solving UC problems and can also be applied to UC formulations that contain more than one type of binary variables.
Read the full abstract

Optimization and Control

Stochastic Optimal Control with Side Information and Bayesian Learning

We study infinite-horizon stochastic optimal control problems with observable side information: a Markov chain that modulates an unknown context-conditional randomness distribution. Since this distribution is unknown, we propose a Bayesian reformulation based on a parametric density model and posterior predictive dynamics, which yields a Bayesian Bellman equation. We prove posterior consistency under Markov samples and, under correct specification and identifiability, uniform convergence of the Bayesian value function. Finally, we establish Bernstein–von Mises-type asymptotic normality for the data-driven contextual optimal value.
Read the full abstract

Information Theory

Maximal Recoverability: A Nexus of Coding Theory

In the modern era of large-scale computing systems, a crucial use of error correcting codes is to judiciously introduce redundancy to ensure recoverability from failure. To get the most out of every byte, practitioners and theorists have introduced the framework of maximal recoverability (MR) to study optimal error-correcting codes in various architectures. In this survey, we dive into the study of two families of MR codes: MR locally recoverable codes (LRCs) (also known as partial MDS codes) and grid codes (GCs). For each of these two families of codes, we discuss the primary recoverability guarantees as well as what is known concerning optimal constructions. Along the way, we discuss many surprising connections between MR codes and broader questions in computer science and mathematics. For MR LRCs, the use of skew polynomial codes has unified many previous constructions. For MR GCs, the theory of higher order MDS codes shows that MR GCs can be used to construct optimal list-decodable codes. Furthermore, the optimally recoverable patterns of MR GCs have close ties to long-standing problems on the structural rigidity of graphs.
Read the full abstract

Analysis of PDEs

Quantitative propagation of chaos for 2D stochastic vortex model on the whole space under moderate interactions

We derive the stochastic 2D vortex model on the whole Euclidean space from moderately interacting particle systems driven by individual and environmental noises, obtaining quantitative estimates in the sense of the entropy and energy functionals. The main novelties lie in combining the control of the Fisher information of the particle system with the Ladyzhenskaya and Donsker-Varadhan inequalities, as well as localization techniques within the probabilistic data setting, to address the nonlinearity and quadratic variation arising from Ito's formula. Moreover, we construct a suitable solution for the limiting process.
Read the full abstract

Analysis of PDEs

Range expansion by growth and congestion

We introduce here a nonlinear and nonlocal model that describes the range expansion of a population resulting from growth and competition for space. This type of phenomenon underlies the expansion of colonies of immotile cells which motivated this work. These colonies display long-range shuffling induced by congestion, and are also subject to jamming. We start by showing the well-posedness of the general evolution equation. We then derive a singular limit of this model corresponding to a regime where dispersal occurs only from saturated areas. The limiting model, which has the structure of an obstacle free boundary problem in time, provides an effective approach to the description of the range expansion of a population as a result of growth, saturation and dispersion. We establish the main mathematical properties of this singular problem by proving a comparison property and describing the dynamics of the free boundary that delimits the saturated area. We identify traveling wave solutions and characterize the asymptotic speed of spreading of compactly supported solutions.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Neural solver for Wasserstein Geodesics and optimal transport dynamics

In recent years, the machine learning community has increasingly embraced the optimal transport (OT) framework for modeling distributional relationships. In this work, we introduce a sample-based neural solver for computing the Wasserstein geodesic between a source and target distribution, along with the associated velocity field. Building on the dynamical formulation of the optimal transport (OT) problem, we recast the constrained optimization as a minimax problem, using deep neural networks to approximate the relevant functions. This approach not only provides the Wasserstein geodesic but also recovers the OT map, enabling direct sampling from the target distribution. By estimating the OT map, we obtain velocity estimates along particle trajectories, which in turn allow us to learn the full velocity field. The framework is flexible and readily extends to general cost functions, including the commonly used quadratic cost. We demonstrate the effectiveness of our method through experiments on both synthetic and real datasets.
Read the full abstract

Metric Geometry

Seventy Years of Fractal Projections

Seventy years ago, John Marstrand published a paper which, among other things, relates the Hausdorff dimension of a plane set to the dimensions of its orthogonal projections onto lines. For some time this paper attracted little attention, but over the past 40 years Marstrand's projection theorems have become the prototype for many results in fractal geometry with numerous variants and applications and they continue to motivate leading research.
Read the full abstract

Optimization and Control

Target controllability for a minimum time problem in a trait-structured chemostat model

In this paper, we consider a minimum time control problem governed by a trait-structured chemostat model including mutation and one limiting substrate. Our first main result proves the well-posedness of the control-to-state mapping. We subsequently analyze the class of auxostat-type controls, feedback laws designed to regulate substrate concentration, and prove that the corresponding solutions converge to a stationary state of the system. These convergence results are used to show the reachability of a target set corresponding to the selection of a population with a low weighted averaged half-saturation constant. Finally, we show the existence of an optimal control for the minimum time problem associated with reaching the target set. These theoretical findings are completed by numerical simulations.
Read the full abstract

Number Theory

Goldfeld conjecture for non-hyperelliptic direction

Since the curve $y^2 = x^6+1$ has a large automorphism group, there exist twist families arising from non-hyperelliptic directions. In this paper, we give an explicit upper bound on the average analytic rank of such a family, assuming the generalized Riemann hypothesis for the $L$-functions. Also, we propose an analogue of the Goldfeld conjecture for the family following Katz–Sarnak philosophy.
Read the full abstract

Geometric Topology

Euler characteristics of $SL(2,\mathbb{Z})$-orbit graphs of origamis

The $SL(2,\mathbb{Z})$-orbits of primitive $n$-squared origamis can be represented by finite four-regular graphs. It is a conjecture of McMullen that the orbit graphs of such origamis in the stratum $\mathcal{H}(2)$ form an expander family. We provide indirect evidence for this conjecture by proving that the absolute values of the Euler characteristics of the graphs in this family go to infinity with the number of squares $n$. This generalises previous work of the authors, in which we established eventual non-planarity for this family, and provides the strongest indirect evidence to date for McMullen's conjecture. We also prove that the same phenomenon holds for primitive origamis in the Prym loci of $\mathcal{H}(4)$ and $\mathcal{H}(6)$. Assuming conjectures of Zmiaikou and Delecroix–Lelièvre, we establish the same in $\mathcal{H}(1,1)$ and for two families of non-Prym origamis in $\mathcal{H}(4)$. Finally, assuming a stronger conjecture concerning orbit growth in low-complexity strata, we establish that for any family of $SL(2,\mathbb{Z})$-orbit graphs of primitive origamis in a stratum with one or two conical singularities, the absolute values of the Euler characteristics of the graphs go to infinity with the number of squares along a density one subsequence. By relating the genus of the elliptic generator orbit graphs to the genus of the associated arithmetic Teichmüller curves, we also recover results of Mukamel and extend results of Torres-Teigel–Zachhuber establishing that the genus of these Teichmüller curves in $\mathcal{H}(2)$ and the Prym loci of $\mathcal{H}(4)$ and $\mathcal{H}(6)$ also go to infinity. The proofs rely on counts of integral points on algebraic hypersurfaces using methods of Bombieri–Pila and Browning–Gorodnik, on counts of orbifold points on Teichmüller curves, and on counts of pseudo-Anosov diffeomorphisms with bounded dilatation.
Read the full abstract

Algebraic Geometry

On combinatorial bounds for the total Tjurina numbers of certain curves and surfaces with isolated singularities

We investigate combinatorial bounds for the total Tjurina numbers of some plane curve arrangements. Focusing on arrangements of lines and conics in $\mathbb{P}^2$ that admit only ordinary quasi-homogeneous singularities, we derive new structural inequalities governing the distribution of multiple intersection points. As a consequence, we establish sharp lower bounds for the total Tjurina numbers of free line arrangements with bounded maximal multiplicity and, more generally, for free conic-line arrangements. In particular, we show that for a free arrangement of $d$ lines and $k$ conics, the total Tjurina number grows at least quadratically in $d$ and $k$, and we demonstrate that this bound is sharp. As an application of these planar results, we construct a special family of surfaces in $\mathbb{P}^{3}$ with only isolated singularities and arbitrarily large total Tjurina numbers. This provides new lower bounds for the total Tjurina numbers of certain hypersurfaces that are independent of detailed homological data. only isolated singularities and arbitrarily large total Tjurina numbers. This provides new lower bounds for the total Tjurina numbers of certain hypersurfaces that are independent of detailed homological data.
Read the full abstract

Probability

Fractal dimension of singular times for SPDEs: Energy bounds, criticality, and weak-strong uniqueness

For several physically relevant SPDEs, it is known that global weak solutions coexist with local strong ones. Typically, weak-strong uniqueness results are known, and ensure that the global and strong solutions coincide as long as the latter exist. Times at which a weak solution does not coincide with a strong one are called singular times. Determining their fractal dimension is fundamental to capturing the regularity of weak solutions. We introduce a probabilistic notion of singular times for a wide class of semilinear SPDEs. We show that sets of singular times have fractal dimension (i.e., Hausdorff and/or Minkowski) at most $ 1-\ell\, \mathsf{Exc}$, where $\ell$ and $\mathsf{Exc}$ are the time integrability and the excess of spatial regularity compared to the critical regularity of the energy bound associated with weak solutions, respectively. Moreover, their corresponding $(1-\ell\,\mathsf{Exc} )$-dimensional measure is zero. We formulate and apply our theory to annealed strong Leray-Hopf solutions of 3D Navier-Stokes equations (NSEs) with physically relevant noises, including rough Kraichnan and Lie transport. In particular, we extend the fundamental $1/2$-dimensional bound of Leray and Scheffer on singular times for 3D NSEs to the stochastic setting, and we prove new conditional results under supercritical Serrin's conditions, irrespective of the roughness of the noise. Our framework is new even in the deterministic case, and provides the first partial regularity results for weak solutions to SPDEs with multiplicative noise.
Read the full abstract

Numerical Analysis

Subspace gradient descent method for linear tensor equations

The numerical solution of algebraic tensor equations is a largely open and challenging task. Assuming that the operator is symmetric and positive definite, we propose two new gradient-descent type methods for tensor equations that generalize the recently proposed Subspace Conjugate Gradient (SS-CG), D. Palitta et al, SIAM J. Matrix Analysis and Appl (2025). As our interest is mainly in a modest number of tensor modes, the Tucker format is used to efficiently represent low-rank tensors. Moreover, mixed-precision strategies are employed in certain subtasks to improve the memory usage, and different preconditioners are applied to enhance convergence. The potential of our strategies is illustrated by experimental results on tensor-oriented discretizations of three-dimensional partial differential equations with separable coefficients. Comparisons with the state-of-the-art Alternating Minimal Energy (AMEn) algorithm confirm the competitiveness of the proposed strategies.
Read the full abstract

Mathematical Physics

Particle, kinetic and hydrodynamic models for sea ice floes. Part II: Rotating floes with environmental forces

This paper builds on the multiscale modeling framework introduced in Part I (Deng and Ha, Physica D: Nonlinear Phenomena 483 (2025) 134951) for sea-ice floe dynamics with non-rotating floes to the case with rotational floes, nonlinear contact interactions, Coriolis force and ocean tilt. Building on the particle-kinetic-hydrodynamic hierarchy developed for non-rotating floes, we generalize the particle model to describe ice floes as rigid bodies characterized by position, linear velocity, angular velocity, size, and moment of inertia. The interaction rules now include nonlinear contact forces and torques arising from short-range compression, restitution, and tangential friction laws, together with both oceanic and atmospheric drags that couple translational and rotational motions. These particle descriptions lead to an enriched Vlasov-type kinetic equation posed on an extended phase space, whose moments yield a hydrodynamic system for mass, momentum, and angular-momentum balances. Compared with Part I, the resulting macroscopic equations feature additional hydrodynamic and stress contributions, rotational transport, and dissipative mechanisms stemming from nonlinear collisions. The proposed framework provides a more accurate description of sea-ice floe dynamics and offers a systematic pathway toward multiscale modeling of sea-ice rheology under complex environmental forcing.
Read the full abstract

All authors Quanling Deng, Seung-Yeal Ha, Jaemoon Lee, Alberto Alberello, Luke G. Bennetts

Logic

Reflection Principles in ZFU

We separate the Collection Principle, the Reflection Principle, and the Partial Reflection Principle in ZF with urelements (ZFU), despite their equivalence under the Axiom of Choice. In particular, Collection and the Partial Reflection Principle are independent of one another, and Collection together with Partial Reflection does not imply the Reflection Principle. We show that Reflection and Collection are equivalent assuming either the Tail axiom or Small Violations of Choice.
Read the full abstract

Analysis of PDEs

A universal bound on the blow-up rate for the focusing mass-critical nonlinear Schrödinger equation

In this paper, we investigate a universal blow-up bound for the focusing mass-critical nonlinear Schrödinger equation for general initial data in $L^2(\mathbb R^d)$, extending previous knowledge for mass near the ground-state threshold due to Merle and Raphaël. The main results are twofold. First, we show the nonexistence of self-similar rate blow-up solutions. Second, under radial symmetry, we establish the sharp log–log correction to the self-similar bound on the blow-up rate. The proofs are based on a new analysis of general blow-up solutions, which does not rely on any ansatz or variational structure.
Read the full abstract

Logic

There are only countably many locally tabular bi-intermediate logics of co-trees

A bi-Heyting algebra validates the Gödel-Dummett axiom $(p \to q) \lor (q \to p)$ iff the poset of its prime filters is a disjoint union of co-trees. Bi-Heyting algebras of this kind are called bi-Gödel algebras and form a variety $\operatorname{\mathsf{bi-GA}}$ that algebraizes the extension $\operatorname{\mathsf{bi-GD}}$ of bi-intuitionistic logic axiomatized by the Gödel-Dummett axiom. In this paper we show that there are only countably many locally tabular bi-intermediate logics of co-trees, all of which are finitely axiomatizable. The theory of canonical formulas of bi-Gödel algebras has shown that $\operatorname{\mathsf{bi-GA}}$ has continuum many subvarieties, among which the locally finite ones coincide with the subvarieties of the $\mathsf{V}_n \coloneqq \{\mathbf{A} \in \operatorname{\mathsf{bi-GA}} \colon \mathbf{A} \models \beta(\mathfrak{C}_n)\}$ (where $\beta(\mathfrak{C}_n)$ is the subframe formula of the $n$-comb). We identify the multiset projectivity relation (a binary relation that, when defined on the set of finite multisets of a better partial order, is necessarily a better partial order) and use it to prove that every $\mathsf{V}_n$ is a Specht variety, hence has only countably many subvarieties, all of which are finitely axiomatizable. By the algebraizability of $\operatorname{\mathsf{bi-GD}}$, the main result follows. We also provide an informative depiction of the lattice of varieties of bi-Gödel algebras.
Read the full abstract