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)

Tuesday 24 February

Number Theory

On the Asymptotic Behavior of a Multiplicative Arithmetic Function Related to the Divisor Function Over Perfect Squares Integers Generated by Shifting

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum \begin{equation*} \sum_{n \leq x} D(n + s(n)), \end{equation*} where \begin{equation*} D(n) = \frac{\tau(n)}{2^{\omega(n)}}. \end{equation*} Here, $\tau(n)$ denotes the number of positive divisors of $n$, and $\omega(n)$ stands for the number of distinct prime factors of $n$.
Read the full abstract

Number Theory

A Diophantine inequality with five squares of Piatetski-Shapiro primes

Let $[\,\cdot\,]$ denote the floor function. Assume that $\lambda_1, \lambda_2, \lambda_3, \lambda_4, \lambda_5$ are nonzero real numbers, not all of the same sign, that $\lambda_1/\lambda_2$ is irrational, and that $\eta$ is a real number. Let $\frac{71}{72}<\gamma<1$ and $\theta>0$. We prove that there exist infinitely many quintuples of primes $p_1,\, p_2,\, p_3,\, p_4,\, p_5$ satisfying the Diophantine inequality \begin{equation*} \big|\lambda_1p^2_1 + \lambda_2p^2_2 + \lambda_3p^2_3+ \lambda_4p^2_4 + \lambda_5p^2_5+\eta\big|<\big(\max p_j\big)^{\frac{71-72\gamma}{29}+\theta}\,, \end{equation*} where $p_i=[n_i^{1/\gamma}]$, $i=1,\,2,\,3,\,4,\,5$. We also prove analogous theorems by raising the last variable in the inequality to the third and fourth powers.
Read the full abstract

Spectral Theory

Non-negative persymmetric realizability of certain classes of spectra

Identifying the collection of scalars that represent a non-negative matrix's eigenvalues is known as the non-negative inverse eigenvalue problem (NIEP). Conditions for the existence of a non-negative matrix with a certain spectrum are examined in this work. The classical NIEP restricted to non-negative matrices having a persymmetric structure is the persymmetric non-negative inverse eigenvalue problem (PNIEP). We resolve the open problem stated in \cite{Ana}, and furthermore, equivalence of the PNIEP and NIEP is established for trace-zero spectra of five complex numbers. Also we obtain new sufficient conditions for the realizability of certain classes of spectra with non-negative persymmetric matrix realization. Based on generic structural features of persymmetric matrices and their characteristic polynomials, our method is constructive in nature. The effects of perturbations on imaginary part of complex eigenvalues are also analyzed and some perturbation results are derived.
Read the full abstract

Optimization and Control

Implicit Decision Diagrams

Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a generalized greedy heuristic for finding feasible solutions, and relaxed DDs compute combinatorial relaxed bounds. There is substantial theory that leverages DD-based bounding, yet the complexity of constructing the DDs themselves has received little attention. Standard restricted DD construction requires $O(w \log(w))$ per layer; standard relaxed DD construction requires $O(w^2)$, where $w$ is the width of the DD. Increasing $w$ improves bound quality at the cost of more time and memory. We introduce implicit Decision Diagrams, storing arcs implicitly rather than explicitly, and reducing per-layer complexity to $O(w)$ for restricted and relaxed DDs. We prove this is optimal: any framework treating state-update and merge operations as black boxes cannot do better. Optimal complexity shifts the challenge from algorithmic overhead to low-level engineering. We show how implicit DDs can drive a MIP solver, and release ImplicitDDs, an open-source Julia solver exploiting the implementation refinements our theory enables. Experiments demonstrate the solver outperforms Gurobi on Subset Sum. Code (https://github.com/IsaacRudich/ImplicitDDs.jl)
Read the full abstract

Combinatorics

A structure theory for signed graphs with fixed smallest eigenvalue

In this paper, we give a structure theory for signed graphs with fixed smallest eigenvalue. As a consequence, we prove that for every $\lambda\in(-1-\sqrt{2},-2]$, if a connected signed graph has smallest eigenvalue at least $\lambda$ and sufficiently large minimum valency, then its smallest eigenvalue is at least $-2$ and it is $1$-integrable. Thus, every such signed graph admits a representation by a family of $\{0,\pm1\}$-vectors of squared norm $2$ and may therefore be viewed as a natural signed generalization of generalized line graphs.
Read the full abstract

All authors Meng-Yue Cao, Jack H. Koolen, Jing-Yuan Liu, Qianqian Yang

Combinatorics

Semi-magic dihedral squares

Let $\Gamma$ be a group of order $n^2$ and $SMS_{\Gamma}(n)=(a_{i,j})_{n\times n}$ be an $n\times n$ array whose entries are all distinct elements of $\Gamma$. If there exists an element $\mu\in\Gamma$ such that for every row $i$, there exists an ordering of elements such that $$ a_{i,j_1} a_{i,j_2} \dots a_{i,j_{n-1}} a_{i,j_n} = \mu $$ and for every column $j$ there exists an ordering of elements such that $$ a_{i_1,j} a_{i_2,j} \dots a_{i_{m-1},j} a_{i_m,j} = \mu, $$ then $SMS_{\Gamma}(n)$ is called a \emph{$\Gamma$-semi-magic square of side $n$} and $\mu$ is called a magic constant. We provide a complete characterization of semi-magic squares of side $n$ whose entries belong to a dihedral group $D_k$. Moreover, we show that in our constructions a single semi-magic square may admit two distinct magic constants, depending on the order in which the products are computed.
Read the full abstract

Analysis of PDEs

Continuous Data Assimilation for Semilinear Parabolic Equations: A General Approach by Evolution Equations

This article develops a general framework for continuous deterministic data assimilation for semilinear parabolic equations by means of evolution equations. Introducing a nudged model driven by partial observations, the global well-posedness of the reference and the approximating systems is established under natural assumptions. In addition, it is shown that the approximating solution converges exponentially to the solution of the reference system, provided the observational resolution and the nudging parameter are suitably chosen. The approach allows us to consider many systems, such as the Allen-Cahn, Cahn-Hilliard, Sellers-type energy balance, and bidomain systems, for the first time.
Read the full abstract

All authors Gianmarco Del Sarto, Matthias Hieber, Filippo Palma, Tarek Zöchling

Combinatorics

The $d$-dimensional realisation number of a rigid graph

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary dimensions: (i) we prove that subgraph inclusion translates to realisation number divisibility; and (ii) we provide lower bounds on realisation numbers under specific graph operations in all dimensions. We use these methods to prove that every triangulated sphere with $n$ vertices has at least $2^{n-4}$ edge-length equivalent realisations in 3-dimensions, extending a 2-dimensional result of Jackson and Owen in the case of planar graphs. Additionally, our tools solve a family of conjectures set by Grasegger regarding how 1-extensions, X-replacements, and V-replacements affect realisation numbers.
Read the full abstract

Combinatorics

Preserving Hodge Vectors of Lattice Polytopes

Given lattice polytopes $P_1, \ldots, P_k$ contained in a $k$-dimensional subspace $U \subseteq \mathbb{R}^d$ and a $d$-dimensional lattice polytope $Q \subset \mathbb{R}^d$, we compute the Hodge vector of the Cayley polytope $P_1 * \cdots * P_k * Q$, and show that it equals the mixed volume of $P_1, \ldots, P_k$ times the Hodge vector of the projection of $Q$ along $U$. Here, the Hodge vector of a lattice polytope is its local $h^*$-vector with leading and trailing zeroes removed. This result allows finding infinitely many high-dimensional lattice polytopes with the same Hodge vector that are not free joins. The proof relies on a closed formula for the Hodge-Deligne polynomial of generic complete intersections in the torus in terms of the bivariate/mixed $h^*$-polynomial. A special case of our construction is what we call Lawrence twists: extending the Gale transform by centrally-symmetric pairs of vectors. As applications, we can produce many new thin polytopes answering a question by Borger, Kretschmer and the second author, and we provide an alternative explanation of the thinness of $B_k$-polytopes answering a question of Selyanin.
Read the full abstract

Numerical Analysis · Cross-listed from physics.plasm-ph

Entropy stable numerical schemes for divergence diminishing Chew, Goldberger & Low equations for plasma flows

Chew, Goldberger & Low (CGL) equations are a set of hyperbolic PDEs with non-conservative products used to model the plasma flows, when the assumption of local thermodynamic equilibrium is not valid, and the pressure tensor is assumed to be rotated by the magnetic field. This results in the pressure tensor, which is described by the two scalar components. As the magnetic field also evolves, controlling the divergence of the magnetic field is important. In this work, we consider the generalized Lagrange multiplier (GLM) technique for the CGL model. The resulting model is referred to as the GLM-CGL system. To make the system suitable for entropy-stable schemes, we reformulate the GLM-CGL system by treating some conservative terms as non-conservative. The resulting system has a non-conservative part that does not affect entropy evolution. We then propose entropy stable numerical methods for the GLM-CGL model. The numerical results for the GLM-CGL system are then compared with the CGL system without the GLM divergence diminishing approach to demonstrate that the GLM approach indeed leads to significant improvement in the magnetic field divergence diminishing.
Read the full abstract

All authors Chetan Singh, Harish Kumar, Deepak Bhoriya, Dinshaw S. Balsara

Category Theory

The direction functor for Schreier extensions of monoids

We observe that the process of associating an action to any Schreier extension of monoids with commutative and cancellative kernel is functorial. We show that this functor is a generalisation of the direction functor, used to give a categorical description of non-abelian cohomology in terms of extensions. We further prove that our functor is a conservative, product preserving cofibration and from this we conclude that its fibres are endowed with a canonical symmetric monoidal structure. The commutative monoids obtained as connected components of these symmetric monoidal categories are isomorphic to Patchkoria second cohomology monoids of a monoid with coefficients in semimodules.
Read the full abstract

Algebraic Geometry

Dualizing complexes and $t$-structures for algebraic spaces

This work is concerned with $t$-structures on Noetherian algebraic spaces admitting dualizing complexes. In particular, we study their behavior in the étale topology. As a consequence, we classify all tensor $t$-structures on their bounded derived category of coherent sheaves.
Read the full abstract

Dynamical Systems

Dynamic interactions and equilibrium configurations of pulses in the two-dimensional complex quintic Ginzburg-Landau equation

This paper constructs a fast and effective novel numerical scheme which accurately calculates the dynamics of weakly-interacting pulses in the two-dimensional quintic-complex Ginzburg-Landau equation (QCGLE). The numerical scheme uses a global centre-manifold reduction, where the solution to the QCGLE is constructed as the sum of the individual pulses plus a remainder function, which is chosen to be orthogonal to the zero adjoint eigenmodes of the QCGLE linear operator. Projecting this constructed solution onto the stable centre-manifold leads to a fast-slow system of equations consisting of slow ordinary differential equations for the position and phases of the individual pulses and a fast partial differential equation for the remainder function. By considering the pulses to be well-separated, the system can be expanded asymptotically in terms of the small parameter $\epsilon=e^{-\lambda_r d}\ll1$, where $\lambda_r$ is the spatial decay rate of the pulse, and $d>0$ is the minimum pulse separation distance. Here the remainder function is determined via a stationary partial differential equation that can be readily solved in an efficient manner using GMRES. Results for $N=2,3,4$ and $5$ pulses are considered, and it is found that different equilibrium solutions are possible such as stable fixed points and limit cycles. The interaction of two stable $N=3$ coherent structures is also considered, where the common tendency found is for the structure to degenerate into pairs of pulses which propagate away from the initial configuration of pulses.
Read the full abstract

Number Theory

On local characterizations of Hida families of Siegel modular forms

We provide new local characterizations of Hida families of Siegel modular forms with genus two arising from stable Yoshida lifts, that is, automorphic inductions of nearly ordinary Hilbert modular eigenforms over real quadratic fields. Our characterizations involve (i) density of de Rham at $p$ specializations at the singular weights $(k,2)$ and (ii) local decomposability at $p$ of the associated $\Lambda$-adic Galois representation. These are analogous to the characterizations of Hida families of CM modular forms provided by Ghate–Vatsal. Our approach is similar to that of Castella–Wang-Erickson who provided an alternate strategy to reproving Ghate–Vatsal's main results by applying Ribet's method when an anti-cyclotomic class group is assumed to be pseudo-null and cyclic as a $\Lambda$-module. Along these lines, one key input to our methods involves an assumption of pseudo-nullity of Selmer groups that are defined by imposing stricter conditions at $p$ than those imposed for the usual Greenberg Selmer groups appearing in the Asai main conjectures over real quadratic fields.
Read the full abstract

Logic

Existential theories of henselian valued fields under a formal smoothness assumption

We study existential theories of henselian valued fields of positive characteristic with parameters from a trivially valued subfield. Compared to previous work, we relax perfectness and separability assumptions, and instead work with the weaker algebraic hypothesis of formal smoothness over the parameter field, which we discuss in detail in our setting. Assuming a weak consequence of resolution of singularities, which was already used in previous work, we obtain an axiomatisation of the existential theory of such a valued field in terms of the existential theory of the residue field, both over the same parameter field. This result has natural applications to asymptotic theories of completions of function fields of curves. We work these out in detail for the case of function fields over fairly general pseudo-algebraically closed fields, where we obtain decidability of the sets of universal/existential sentences holding in all completions or all but finitely many completions, respectively.
Read the full abstract

Information Theory · Cross-listed from cs.NI

Deep Reinforcement Learning Based Block Coordinate Descent for Downlink Weighted Sum-rate Maximization on AI-Native Wireless Networks

This paper introduces a deep reinforcement learning-based block coordinate descent (DRL-based BCD) algorithm to address the nonconvex weighted sum-rate maximization (WSRM) problem with a total power constraint. Firstly, we present an efficient block coordinate descent (BCD) method to solve the problem. We then integrate deep reinforcement learning (DRL) techniques into the BCD method and propose the DRL-based BCD algorithm. This approach combines the data-driven learning capability of machine learning techniques with the navigational and decision-making characteristics of the optimization-theoretic-based BCD method. This combination significantly improves the algorithm's performance by reducing its sensitivity to initial points and mitigating the risk of entrapment in local optima. The primary advantages of the proposed DRL-based BCD algorithm lie in its ability to adhere to the constraints of the WSRM problem and significantly enhance accuracy, potentially achieving the exact optimal solution. Moreover, unlike many pure machine-learning approaches, the DRL-based BCD algorithm capitalizes on the underlying theoretical analysis of the WSRM problem's structure. This enables it to be easily trained and computationally efficient while maintaining a level of interpretability. Through numerical experiments, the DRL-based BCD algorithm demonstrates substantial advantages in effectiveness, efficiency, robustness, and interpretability for maximizing sum rates, which also provides valuable potential for designing resource-constrained AI-native wireless optimization strategies in next-generation wireless networks.
Read the full abstract

Numerical Analysis

The Adaptive Solution of High-Frequency Helmholtz Equations via Multi-Grade Deep Learning

The Helmholtz equation is fundamental for modeling wave propagation in acoustics, electromagnetics, and geophysics; however, high-frequency regimes remain notoriously difficult due to the severe numerical “pollution effect.” We propose FD-MGDL, an adaptive framework that synergizes finite difference discretizations with Multi-Grade Deep Learning (MGDL) to efficiently resolve high-frequency wavefields. Unlike standard physics-informed neural networks (PINNs), which frequently suffer from spectral bias and heavy automatic differentiation overhead, FD-MGDL employs a progressive, grade-wise training strategy that incrementally incorporates shallow sub-networks to refine residual errors. By leveraging ReLU activations in refinement grades, the framework reformulates the highly non-convex global optimization problem into a sequence of tractable convex subproblems, dramatically improving training stability and convergence reliability. Extensive numerical experiments in two and three dimensions with wavenumbers up to $\kappa=200$ demonstrate that FD-MGDL significantly outperforms single-grade networks and standard benchmark neural solvers in both accuracy and computational efficiency. When applied to an inhomogeneous concave velocity model, the proposed method accurately captures wave focusing and caustic formations, markedly outperforming classical five-point finite difference schemes in resolving sharp phase transitions and peak amplitudes. These results establish FD-MGDL as a robust, scalable, and mathematically grounded paradigm for high-frequency wave simulation in complex media.
Read the full abstract

All authors Peiyao Zhao, Rui Wang, Tingting Wu, Yuesheng Xu

Differential Geometry

A flow approach to the Toda system

In this paper we introduce a flow to study the Toda system, which we call Toda flow. More generally, we introduce a flow of the Liouville systems, formulated as a coupled parabolic system with nonlocal interactions. Finite-time singularities are characterized and both necessary and sufficient conditions for convergence are provided in this general setting, even when the prescribed functions are allowed to change sign. As an application, we prove a global existence for the Toda flow in the critical case without restricting the sign of the prescribed functions. We provide a detailed description of blow-up behavior at infinity and obtain a sharp lower bound for the functional in cases where global convergence fails. By constructing appropriate test functions, we further establish a sufficient condition for the global convergence of the flow. These results are not affected by the sign-changing nature of the prescribed functions, and extend the theorem of Jost, Lin and Wang (Comm. Pure Appl. Math. 59, 526-558, 2006) to systems of multiple equations under this more general and physically relevant condition.
Read the full abstract

Probability · Cross-listed from cs.DM

The Careless Coupon Collector's Problem

We initiate the study of the Careless Coupon Collector's Problem (CCCP), a novel variation of the classical coupon collector, that we envision as a model for information systems such as web crawlers, dynamic caches, and fault-resilient networks. In CCCP, a collector attempts to gather $n$ distinct coupon types by obtaining one coupon type uniformly at random in each discrete round, however the collector is careless: at the end of each round, each collected coupon type is independently lost with probability $p$. We analyze the number of rounds required to complete the collection as a function of $n$ and $p$. In particular, we show that it transitions from $\Theta(n \ln n)$ when $p = o\big(\frac{\ln n}{n^2}\big)$ up to $\Theta\big((\frac{np}{1-p})^n\big)$ when $p=\omega\big(\frac{1}{n}\big)$ in multiple distinct phases. Interestingly, when $p=\frac{c}{n}$, the process remains in a metastable phase, where the fraction of collected coupon types is concentrated around $\frac{1}{1+c}$ with probability $1-o(1)$, for a time window of length $e^{\Theta(n)}$. Finally, we give an algorithm that computes the expected completion time of CCCP in $O(n^2)$ time.
Read the full abstract

Algebraic Geometry

Quotients by $(p-1)/p$-klt Foliations on Surfaces

We study the relation between birational singularities of 1-foliations and those of their quotients. We prove that the quotient $X/\mathcal{F}$ is log canonical (resp. klt) if and only if $\mathcal{F}$ is $\frac{p-1}{p}$-log canonical (resp. $\frac{p-1}{p}$-klt). Moreover, we obtain the classification of klt quotients by 1-foliations on regular surfaces in the cases $p=2,3$ and $5$.
Read the full abstract

Analysis of PDEs

Global self-similar solutions for Hardy-Hénon equations with linear and quasilinear diffusion

Global self-similar solutions to the parabolic Hardy-Hénon equation $$ u_t=\Delta u^m+|x|^{\sigma}u^p, \quad (x,t)\in\mathbb{R}^N\times(0,\infty), $$ are classified in the range of exponents $m\geq1$, $p>m$ and $\sigma>\max\{-2,-N\}$. The classification varies strongly with respect to the celebrated Fujita and Sobolev critical exponents $$ p_F(\sigma)=m+\frac{\sigma+2}{N}, \quad p_S(\sigma)= \begin{cases} \frac{m(N+2\sigma+2)}{N-2}, & \mbox{if } N\geq3, \\[1mm] \infty, & \mbox{if } N\in\{1,2\}. \end{cases} $$ Indeed, if $p\in(p_F(\sigma),p_S(\sigma))$, both equations admit self-similar solutions with either compact support (if $m>1$) or Gaussian-like tail as $|x|\to\infty$ (if $m=1$), as well as a one-parameter family satisfying $$ u(x,t)\sim C|x|^{-(\sigma+2)/(p-m)}, \quad {\rm as} \ |x|\to\infty. $$ If $p\geq p_S(\sigma)$, there are only self-similar solutions with the latter algebraic tail, while for $m<p\leq p_F(\sigma)$ no global solutions exist. The results open the way for a deeper study of the role of these solutions in the dynamics of the Hardy-Hénon equations.
Read the full abstract

Numerical Analysis

Reduced-order computational homogenization for hyperelastic media using gradient based sensitivity analysis of microstructures

We propose an algorithm for the computational homogenization of locally periodic hyperelastic structures undergoing large deformations due to external quasi-static loading. The algorithm performs clustering of macroscopic deformations into subsets called "centroids", and, as a new ingredient, approximates the homogenized coefficients using sensitivity analysis of micro-configurations with respect to the macroscopic deformation. The novel "model-order reduction" approach significantly reduces the number of microscopic problems that must be solved in nonlinear simulations, thereby accelerating the overall computational process. The degree of reduction can be controlled by a user-defined error tolerance parameter. The algorithm is implemented in the finite element framework SfePy, and its performance effectiveness is demonstrated using two-dimensional test examples, when compared with solutions obtained by the proper orthogonal decomposition method, and by the full "FE-square" simulations. Extensions beyond the present implementations and the scope of tractable problems are discussed.
Read the full abstract

Analysis of PDEs

On the singular nature of shallow-water convergence of the intermediate long wave equation on the real line

We investigate regularity properties of the solution map for the intermediate long wave equation (ILW) on the real line. More precisely, we study the scaled ILW which was shown to converge to the Korteweg-de Vries equation (KdV) in $L^2(\mathbb R)$ in the shallow-water limit in a recent work by the first, third, and fourth authors with T. Zhao (2025). By decomposing the dynamics into the low frequency part and the residual part, we show that, when the depth parameter is sufficiently small, the solution map for the low frequency part is analytic in $L^2(\mathbb R)$, while the solution map for the residual part fails to be $C^2$. Moreover, we establish shallow-water convergence in $L^2(\mathbb R)$ of the low frequency dynamics to KdV. This explains the mechanism of the regularity gain of the solution map in the shallow-water limit.
Read the full abstract

All authors Andreia Chapouto, Benjamin Harrop-Griffiths, Guopeng Li, Tadahiro Oh

Mathematical Physics · Cross-listed from quant-ph

Spatial Entanglement Sudden Death in Spin Chains at All Temperatures

We prove a finite entanglement length for the Gibbs state of any local Hamiltonian on a spin chain at any finite temperature: After removing an interval of size at least equal to the entanglement length, the remaining left and right half-chains are in a separable state.

Statistics Theory

Statistical Inference in Causal Partial Identification with Smooth Densities

Many causal quantities are only partially identifiable due to the inherent missingness of potential outcomes, and the associated partial identification (PI) sets can be obtained by solving an optimal transport (OT) problem. Covariates often provide additional information about the potential outcomes and thus yield tighter PI sets, which can be obtained via conditional optimal transport (COT). However, COT-based PI set estimators are susceptible to the curse of dimensionality in the covariates and outcomes, which precludes the asymptotic normality and hinders statistical inference. In this paper, we exploit smoothness in the marginal densities of covariates and potential outcomes and develop a wavelet-based primal method for COT with multivariate outcomes and covariates. Moreover, for quadratic cost functions, we establish a stability result for COT and prove asymptotic normality of the proposed estimator. This characterization of the asymptotic distribution enables valid statistical inference for the partial identification set. Empirically, we validate the estimation and inference performance of our approach through numerical experiments in comparison with existing benchmarks.
Read the full abstract

All authors Sirui Lin, Zijun Gao, Jose Blanchet, Peter Glynn

Numerical Analysis

Implicit-explicit all-speed schemes for compressible Cahn-Hilliard-Navier-Stokes equations

We propose a second-order implicit-explicit (IMEX) time-stepping scheme for the isentropic, compressible Cahn-Hilliard-Navier-Stokes equations in the low Mach number regime. The method is based on finite differences on staggered grids and is specifically designed to handle the challenges posed by the low Mach number limit, where the system approaches to an incompressible behavior. In this regime, standard explicit schemes suffer from severe time-step restrictions due to fourth-order diffusion terms and the stiffness induced by fast acoustic waves. To overcome this, we employ an IMEX strategy which splits the governing equations into stiff and non-stiff components. The stiff terms, arising from pressure, viscous forces and fourth-order Cahn-Hilliard contributions, are treated implicitly, while the remaining are dealt explicitly.
Read the full abstract

Analysis of PDEs

Analytical solutions for long cylindrical shells under radial deformations based on the isotropic relaxed micromorphic continuum

This study presents a closed-form analytical solution for the elastostatic response of long cylindrical shells composed of microstructured materials within the framework of the isotropic relaxed micromorphic continuum. The formulation accounts for microstructural effects by introducing an independent micro-distortion tensor field in addition to the classical displacement field. Under the assumptions of axisymmetric deformation and plane strain conditions, the governing equilibrium equations reduce to a coupled system of ordinary differential equations in the radial coordinate. By introducing suitable auxiliary variables, the system is reformulated into a non-homogeneous modified Bessel equation, which admits an exact analytical solution. Explicit expressions are derived for the radial displacement field and the non-zero components of the micro-distortion tensor. Numerical examples are presented to illustrate the influence of material parameters and the characteristic length on the displacement. The results demonstrate that the relaxed micromorphic model predicts deviations from classical elasticity where microstructural effects are more pronounced. The obtained solution provides valuable physical insight into the mechanics of cylindrical shells and serves as a benchmark for validating numerical implementations of relaxed micromorphic models.
Read the full abstract

Logic

On chromatic number of countable graphs

This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fraïssé limits, we show that instability forces the chromatic number to be infinite, yielding a complete classification of homogeneous graphs with a finite chromatic number. In contrast, Hrushovski construction always produces graphs of finite chromatic number, though the value can be made arbitrarily large. In tame settings – such as stable graphs of $U$-rank one and graphs definable in o-minimal structures – an infinite chromatic number necessarily yields arbitrarily large cliques. These results provide a unified framework connecting structural model theoretic properties with chromatic behavior.
Read the full abstract

Optimization and Control

Convergent Lifted Lasserre Hierarchy of SDPs for Minimizing Expectation of Piecewise Polynomial Loss over Wasserstein Balls

This paper investigates the minimization of the expectation of piecewise polynomial loss functions over Wasserstein balls. This optimization problem often appears as a key sub-problem of distributionally robust optimization problems. We establish the asymptotic convergence of a hierarchy of semi-definite programming (SDP) relaxations, providing a framework for approximating the optimal values of these inherently infinite-dimensional optimization problems. A central foundational contribution is the development of a new lifted positivity certificate: we demonstrate that piecewise polynomials positive over Archimedean basic semi-algebraic sets admit a structured system of sum-of-squares (SOS) representations. Furthermore, we prove that the proposed hierarchy achieves finite convergence under suitable conditions when the defining polynomials are convex. The practical utility and versatility of this approach are demonstrated via numerical experiments in revenue estimation and portfolio optimization.
Read the full abstract

All authors N.D. Dizon, Q.Y. Huang, T.D. Chuong, G. Li, V. Jeyakumar