Peer Revenue Play credits. Real papers.

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Tuesday 21 April

Mathematical Physics · Cross-listed from hep-th

Gauge-invariant off-shell formulations for 3D massive higher-spin supermultiplets

Making use of the known off-shell formulations for massless higher-spin ${\cal N}=1$ supermultiplets in four dimensions, gauge-invariant off-shell actions for massive higher-spin ${\cal N}=2$ supermultiplets in three dimensions (3D) are derived by Kaluza-Klein reduction in superspace. To illustrate the formalism, we also construct, for the first time, massive gauge-invariant 3D ${\cal N}=2$ supersymmetric counterparts of the linearised actions for the old and new minimal supergravity theories. Our off-shell ${\cal N}=2$ supermultiplets carry a non-zero central charge, and are formulated in 3D ${\cal N}=2$ central charge superspace. The models can be reduced to 3D ${\cal N}=1$ superspace, by integrating out two Grassmann variables, and then consistent reality conditions on the superfields can be imposed. As a result, only two supercharges remain unbroken.
Read the full abstract

Group Theory

Hyperbolicity of Multiple Ascending HNN Extensions of Free Groups

Bestvina-Feighn-Handel show that for finitely many generic and independent hyperbolic automorphisms $\phi_1, \cdots, \phi_r$ of $F_n$, the resulting extension $F_n \rtimes F_r$ is hyperbolic. This paper generalizes the above statement to the case where $\phi_1, \cdots, \phi_r$ are hyperbolic non-surjective endomorphisms of $F_n$. In our case the output is a multiple HNN extension associated to a graph with one vertex and $r$ edges. All edge and vertex groups are isomorphic to $F_n$.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

The General Formulation of Loss-Based Priors for Parameter Spaces

Loss-based priors assign probability mass to parameter values according to the inferential loss incurred when they are excluded from the parameter space, and provide a general solution for discrete parameters. Extending this idea to continuous settings is challenging, as the exclusion of a single point induces no loss. We propose a neighbourhood-exclusion framework in which inferential loss is defined by removing a local region around each parameter value. Under standard regularity conditions, this yields a class of prior distributions driven by the local geometry of the Kullback–Leibler divergence. In one dimension, the resulting prior coincides with Jeffreys' prior, while in higher dimensions it leads to a family of priors indexed by the geometry of the exclusion region. The proposed formulation provides a unified extension of loss-based priors and offers a geometric interpretation of objective prior construction beyond isotropic settings.
Read the full abstract

Classical Analysis and ODEs

Characterizations of Lyapunov domains in terms of Riesz transforms and the Plemelj-Privalov theorem

We prove several characterizations of $\mathscr{C}^{1,\omega}$-domains (aka Lyapunov domains), where $\omega$ is a growth function satisfying natural assumptions. For example, given an Ahlfors regular domain $\Omega\subseteq{\mathbb{R}}^n$, we show that the modulus of continuity of the geometric measure theoretic outward unit normal $\nu$ to $\Omega$ is dominated by (a multiple of) $\omega$ if and only if the action of each Riesz transform $R_j$ associated with $\partial\Omega$ on the constant function $1$ has a modulus of continuity dominated by (a multiple of) $\omega$. The proof of this result requires that we establish a higher-dimensional generalization of the classical Plemelj-Privalov theorem, identifying a large class of singular integral operators that are bounded on generalized Hölder spaces. This class includes the Cauchy-Clifford operator and the harmonic double layer operator, among others.
Read the full abstract

All authors Juan José Marín, José María Martell, Dorina Mitrea, Marius Mitrea

Number Theory

Quartic Rational Diophantine Quadruples and the Euler Surface

We prove that there exist infinitely many quartic rational Diophantine quadruples, that is, sets of four pairwise distinct nonzero rational numbers whose pairwise products increased by 1 are fourth powers in Q. To the best of our knowledge, no examples of such quadruples were previously known. Our construction is motivated by computer experiments and leads naturally to the classical Euler surface E:X^4+Y^4=Z^4+W^4. We show that every rational point on a suitable Zariski-open subset of E yields a quartic rational Diophantine quadruple, thereby obtaining a rational map from the Euler surface to the parameter space of quartic quadruples. In particular, Euler's classical parametrization produces the first explicit infinite family of quartic rational Diophantine quadruples. We also explain that the same mechanism extends to arbitrary exponents k>1, with the Euler surface replaced by the Fermat–Euler surface E_k:X^k+Y^k=Z^k+W^k. For even k, every rational point on a suitable open subset of E_k gives rise to a kth power rational Diophantine quadruple, while for odd k one obtains such quadruples on the locus where W/Z is a square.
Read the full abstract

Combinatorics · Cross-listed from cs.DS

Moderately beyond clique-width: reduced component max-leaf and related parameters

Reduced parameters [BKW, JCTB '26; BKRT, SODA '22] are defined via contraction sequences. Based on this framework, we introduce the reduced component max-leaf, denoted by $\operatorname{cml}^\downarrow$, where component max-leaf is the maximum number of leaves in any spanning tree of any connected component. Reduced component max-leaf is strictly sandwiched between clique-width and reduced bandwidth, it is bounded in unit interval graphs, and unbounded in planar graphs. We design polynomial-time algorithms for problems such as \textsc{Maximum Induced $d$-Regular Subgraph} and Induced Disjoint Paths in graphs given with a contraction sequence witnessing low $\operatorname{cml}^\downarrow$, unifying and extending tractability results for classes of bounded clique-width and unit interval graphs. We get the following collapses in sparse classes of bounded $\operatorname{cml}^\downarrow$: bounded maximum degree implies bounded treewidth, whereas $K_{t,t}$-subgraph-freeness implies strongly sublinear treewidth; we show the latter, more generally, for classes of bounded reduced cutwidth. We establish the former result by showing that graphs with bounded $\operatorname{cml}^\downarrow$ admit balanced separators dominated by a bounded number of vertices. We then showcase an application of the reduced parameters to establishing non-transducibility results. We prove that for most reduced parameters $p^\downarrow$ (including reduced bandwidth), the family of classes of bounded $p^\downarrow$ is closed under first-order transductions. We then answer a question of [BKW '26] by showing that the 3-dimensional grids have unbounded reduced bandwidth. As the class of planar graphs (or any class of bounded genus) has bounded reduced bandwidth [BKW '26], this reproves a recent result [GPP, LICS '25] that planar graphs do not first-order transduce the 3-dimensional grids.
Read the full abstract

All authors Édouard Bonnet, Yeonsu Chang, Julien Duron, Colin Geniet, O-joung Kwon

Combinatorics · Cross-listed from quant-ph

Arc search in graphs via Szegedy walks

This paper studies the search for a single arc in a graph using the Szegedy walk. Arc search can be interpreted as finding a quantum particle not only in its position but also with a specific internal state. The quantum walk employed in this study is essentially the model proposed by Segawa and Yoshie for the purpose of edge search. First, we investigate how the symmetry of a graph is reflected in its time evolution matrix, and provide a sufficient condition under which the success probability of the search is independent of the marked arc. In particular, we prove that if a graph is arc-transitive, the success probability is independent of the choice of the marked arc. Next, we analyze path and cycle graphs and show that the quantum search is ineffective for these graphs, whereas it performs well for complete bipartite graphs $K_{n,n}$. These results provide a theoretical foundation for studying arc and edge searches on various graphs, while also suggesting new problems concerning the eigenvalue analysis of edge-signed graphs in spectral graph theory.
Read the full abstract

Analysis of PDEs

Global well-posedness and temporal decay estimates for the viscous $\beta$-plane equations

We consider the Cauchy problem of the viscous $\beta$-plane equations. We first establish the global well-posedness of the system for the initial data sufficiently small compared to the Rossby parameter. The smoothing effect of the flow is then proved, and it is shown that the obtained global solution satisfies the equation in the classical sense. We also reveal that under some additional assumptions, the solution decays as fast as the corresponding linear solution and asymptotically behaves like a constant multiple of the integral kernel of the linearized equation. In particular, the decay rate of the solution is faster than expected from the flow of the heat equation.
Read the full abstract

Combinatorics

Counterexamples to the Corsten-Frankl conjecture on diameter-Ramsey simplices

Corsten and Frankl conjectured that a simplex is diameter-Ramsey if and only if its circumcenter lies in its convex hull. We disprove this conjecture in every dimension $d\ge 3$. The main tool is a sufficient criterion based on a higher-order deficit decomposition: if the squared deficits $D^2-\|p_i-p_j\|^2$ admit a nonnegative decomposition over subsets of the vertex set, with total mass at most $D^2$, then the simplex is diameter-Ramsey. The pairwise deficit criterion of Frankl–Pach–Reiher–Rödl is recovered as a special case. As an application, for every $d\ge 3$ we construct a diameter-Ramsey $d$-simplex whose circumcenter lies outside its convex hull. A particularly simple family has squared edge lengths $\|p_1-p_2\|^2=\|p_1-p_j\|^2=7~ (4\le j\le d+1)$, $\|p_1-p_3\|^2=4$, and $\|p_i-p_j\|^2=4 ~ (2\le i<j\le d+1)$.
Read the full abstract

Representation Theory

Ore's theorem for thick subcategories

We characterize those finite groups for which the bounded derived category of finite dimensional representations over an algebraically closed field of characteristic $p$ has distributive lattice of thick subcategories: they are precisely the $p$-nilpotent groups. Along the way we give necessary and sufficient criteria for the bounded derived category and perfect complexes of a finite dimensional $k$-algebra to have distributive lattices of thick subcategories.
Read the full abstract

Mathematical Physics · Cross-listed from hep-th

Reducible first-class constraints, gauge symmetry, and the degrees of freedom of three-dimensional gravity coupled to topological matter

We develop a systematic Hamiltonian formulation for a gravitating topological matter system in three-dimensional spacetime, coupling a scalar matter field and a two-form gauge field to first-order Hilbert–Palatini gravity. We perform the Dirac–Bergmann analysis, obtaining the full structure of the constraints, classifying them into first- and second-class ones, and computing their Poisson bracket algebra. Furthermore, we write down the explicit expression for the Hamiltonian generator of gauge symmetries on the full set of canonical variables, containing the exact number of gauge parameters. A mapping of these parameters then shows that the gauge transformations reproduce on-shell the spacetime diffeomorphism and local Poincaré symmetries. The symmetry structure of the coupled model is thereby established on a Cauchy surface without boundary. Our canonical analysis further shows that the first-class constraints obey three reducibility conditions. We trace them back to an off-shell identity of Ricci type and to the redundancy of the gauge parameters carried by the two-form field. In the extended phase-space they close only modulo the second-class sector. Once they are taken into account, the model carries no local degrees of freedom. The fundamental symplectic structure on the reduced phase-space is fixed by the explicit computation of the Dirac brackets. Both these and the Hamiltonian gauge generator are obtained in the extended phase-space, with no canonical variable eliminated beforehand. Finally, we show that on a surface with boundary the improved generator built from the reducible parameters collapses to a single boundary integral, which vanishes identically.
Read the full abstract

Complex Variables

Revisiting Kobayashi hyperbolicity on planar domains

We give two new elementary proofs of the complete Kobayashi hyperbolicity of the twice-punctured complex plane. We also present an extremely short proof that bounded domains are complete Kobayashi hyperbolic. Our proofs rely neither on the fact that the universal cover of the twice-punctured plane is the disk nor on the existence of negatively curved metrics. As applications, we present concise proofs of the classical theorems of Landau, Schottky, and Picard. Finally, we provide a characterization of Kobayashi hyperbolicity for planar domains inspired by a similar result of Hahn.
Read the full abstract

Combinatorics

Independent Sets and Continued Fractions

Linek's 1989 problem asks whether the numbers of independent sets of trees avoid infinitely many positive integers. We show that the set of natural numbers realized as the number of independent sets of a tree has a lower growth exponent of $0.1966$. We further prove that the set of positive integers representable by connected planar graphs has asymptotic density one. Lastly, we establish a phase transition: the number of independent sets of graphs with fewer than $d|V|$ edges for any $d<1$ is contained in a set of density zero, whereas, following Shkredov's recent breakthrough on Zaremba's conjecture in continued fraction theory, there exists a constant $D$ such that the number of independent sets of graphs with at most $D|V|$ edges covers all positive integers.
Read the full abstract

Numerical Analysis

High-Order Multi-Scale Method and Its Convergence Analysis for Nonlinear Thermo-Electro-Mechanical Coupling Problems of Composite Structures

This study proposes a high-order multi-scale method tailored for time-dependent nonlinear thermo-electro-mechanical coupling problems of composite structures with highly spatial heterogeneity, which incorporate temperature-dependent material properties and Joule heating effect. By employing the multi-scale asymptotic approach and the Taylor series technique, a high-accuracy multi-scale asymptotic model featuring novel high-order correction terms is established for nonlinear multi-physics simulation of periodic solid structures. A local point-wise error analysis is derived to theoretically and physically illustrate the local balance preserving of heat quantity, electric charge and stress,thereby enabling high-accuracy multi-scale computation. Moreover, a global error estimation is obtained that provides an explicit convergence rate for high-order multi-scale solutions. Furthermore, an efficient numerical algorithm featuring with off-line and on-line stages is presented meticulously, accompanied by a corresponding error analysis. Numerical experiments are conducted to showcase the competitive advantages of the proposed method for simulating the time-dependent nonlinear thermo-electro-mechanical coupling problems with highly oscillatory and discontinuous coefficients, demonstrating superior numerical accuracy and reduced computational cost.
Read the full abstract

History and Overview of Mathematics

Integral-Differential Calculus

We give an exposition of the Newton-Leibniz calculus. We begin by defining the integral as a limit of Riemann sums, verify the integrals of the standard catalog of functions by direct manipulation, prove the substitution lemmas as theorems about Riemann sums, cross the Fundamental Theorem of Calculus, and harvest the differential calculus on the other side.
Read the full abstract

Numerical Analysis

Taylor Tube Method for Validated IVP

We recently introduced a novel architecture for the design of validated IVP algorithms. This architecture forms the basis of our complete validated algorithm for IVP. A key subroutine in our algorithm is the Euler Tube: it gave a technique for refining end- and full-enclosures and is also key to deriving a complexity bound of our IVP solver. In this paper, we generalize it to Taylor Tube of degree $p\ge 1$. As expected, higher-degree Taylor Tubes improve accuracy. But surprisingly, our experiments show that it can also lead to an overall speedup when combined with bisection.
Read the full abstract

Statistics Theory

The interplay between network transitivity and community structure

Recent empirical observations suggest that network transitivity is highly correlated with community structure in many real-world networks. In this paper, we theoretically investigate this relationship by deriving the limits of the global and average clustering coefficients for the geometric block model (GBM). Both limits exhibit a phase transition; specifically, the functional forms of the limit functions differ between the weak and strong community structure strength regimes. For a GBM with balanced communities, the limits of the global and average clustering coefficients are identical, whereas these limits differ for unbalanced communities. In general, the clustering coefficients do not exhibit a monotonic relationship with community structure strength. Particularly, for a balanced GBM where the within-community edge probability is a constant multiple of the between-community edge probability, the limit decreases from $3/4$ to $3/5$ and subsequently increases toward an asymptotic upper bound of $3/4$ as the multiple grows from one. A similar pattern is observed for the global clustering coefficient in unbalanced settings, where both limits exhibit an explicit dependence on community size.
Read the full abstract

All authors Mingao Yuan, Irin Rahman, Chengay S Wangchuk, Minglian Lin

Optimization and Control · Cross-listed from cs.GT

Last-Iterate Guarantees for Learning in Co-coercive Games

We establish finite-time last-iterate guarantees for vanilla stochastic gradient descent in co-coercive games under noisy feedback. This is a broad class of games that is more general than strongly monotone games, allows for multiple Nash equilibria, and includes examples such as quadratic games with negative semidefinite interaction matrices and potential games with smooth concave potentials. Prior work in this setting has relied on relative noise models, where the noise vanishes as iterates approach equilibrium, an assumption that is often unrealistic in practice. We work instead under a substantially more general noise model in which the second moment of the noise is allowed to scale affinely with the squared norm of the iterates, an assumption natural in learning with unbounded action spaces. Under this model, we prove a last-iterate bound of order $O(\log(t)/t^{1/3})$, the first such bound for co-coercive games under non-vanishing noise. We additionally establish almost sure convergence of the iterates to the set of Nash equilibria and derive time-average convergence guarantees.
Read the full abstract

Information Theory

Three-Module SC-VAMP for LDPC-Coded Nonlinear Channels

We propose a three-module extension of score-based VAMP (SC-VAMP) for signal recovery in nonlinear channels, where the received signal is obtained by applying a nonlinearity to a linear mixture of the transmitted signal, followed by additive Gaussian noise. The key idea is to introduce a latent variable representing the output of the linear mixing stage, which decomposes the inference problem into three modules: a likelihood module that handles the nonlinear observation via Gauss–Hermite quadrature, a coupling module that enforces the linear constraint between the transmitted signal and the latent variable via LMMSE estimation, and a denoiser module that incorporates the code constraint using belief propagation (BP) decoding. Each module exchanges extrinsic scalar-Gaussian messages with Onsager corrections derived from posterior variances that are computed in closed form or to quadrature accuracy. Numerical experiments with BPSK-modulated LDPC codewords transmitted through a hyperbolic tangent channel demonstrate that the proposed method achieves a clear waterfall in bit error rate (BER), with the gap to the capacity estimate narrowing as the block length increases from 128 to 2304. The framework provides a modular receiver architecture applicable to a broad class of nonlinear channels. Since only the likelihood module depends on the channel nonlinearity, the architecture readily adapts to other channel models by replacing a single module while leaving the coupling and decoder modules unchanged.
Read the full abstract

Number Theory

Beyond the square-root barrier: cubic forms of Perazzo type

We show how the circle method can be used to study rational points on a certain cubic fourfold, going beyond the square-root barrier.

Information Theory

Explicit Factorization of $x^{p+1}-1$ over $\mathbb{Z}_{p^e}$: A Structural Approach via Dickson Polynomials

Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical resource for Linear Complementary Dual (LCD) codes and Entanglement-Assisted Quantum Error-Correcting Codes (EAQECC). Traditionally, lifting factorizations relies on the generic Hensel's Lemma, masking the underlying algebraic structure. In this paper, we establish a structural isomorphism between the lifting process and the roots of a special auxiliary polynomial $V(x)$, unveiling a deterministic link to Dickson polynomials. Based on this theory, we develop Dickson-Engine, a linear-time algorithm ($O(ep)$) that outperforms standard libraries by orders of magnitude. Applying this engine to $\mathbb{Z}_{169}$, we explicitly construct a family of classical LCD codes of length $n=182$ via the isometric Gray map. Our search reveals codes with parameters (e.g., $[182, 1, 168]_{13}$ and $[182, 2, 144]_{13}$) that are near-optimal with respect to the theoretical Griesmer Bound. Notably, we discover a “robustness plateau” starting from non-trivial dimensions ($k=4$), where the minimum distance remains stable ($d=120$) even as the dimension triples ($k=4 \rightarrow 12$). These codes provide exceptional resources for post-quantum cryptography and quantum error correction without entanglement consumption ($c=0$).
Read the full abstract

All authors Yongchao Wang, Yang Ding, Jiansheng Yang, Zhiqiu Huang

Information Theory

LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes

Traditional wireless communications rely solely on bit-level channel coding for error correction, without exploiting the inherent linguistic structure of the data source. This paper proposes a large language model (LLM) Viterbi decoder that integrates LLM priors into the Viterbi decoding for text transmission over AWGN channels. The proposed decoder maintains multiple candidate paths during the Viterbi decoding and periodically evaluates path reliabilities using a fine-tuned Byte-level T5 (ByT5) language model. By combining channel reliability metrics with semantic probability from the LLM, it outputs the path that maximizes the joint likelihood of channel observations and linguistic coherence. Simulations show that our decoder achieves significant performance gains over conventional Viterbi decoding in terms of both block error rate (BLER) and semantic similarity. For convolutional codes with constraint length 3, it achieves approximately 1.5 dB more coding gain in BLER, with over 50% improvements in semantic similarity. The framework can extend to other structured data sources beyond text.
Read the full abstract

All authors Zhengtong Li, Chentao Yue, Jiafu Hao, Branka Vucetic, Yonghui Li

Numerical Analysis · Cross-listed from cond-mat.soft

Geometric quantification for nonlinear deformation in knitted fabrics

Knitted fabrics exemplify a broad class of architected materials capable of large deformations, enabling shape morphing, mechanical biocompatibility, and embedded multifunctionality without material damage. Although geometric nonlinearity has been intuitively utilized in their design, a quantitative description of stitch-resolved deformation and its temporal evolution remains lacking. Here, we introduce a geometric quantification framework that reconstructs smooth yarn centerlines and fabric surfaces from sparse yarn-level representations and extracts interpretable descriptors across dimensions. Applied to representative knitted structures, this framework resolves how global deformation is distributed among stitch reorientation, loop bending, surface bending, and dilation. Moreover, it reveals how regions of large geometric variation emerge, persist, and redistribute over time. Rather than directly measuring stress, these geometric descriptors define a unified geometric state space for comparing knitted structures and identifying candidate regions of mechanical localization. The framework provides a quantitative language for nonlinear deformation in knits and establishes a geometry-based representation that can be coupled to constitutive models, experimental measurements, and graph-based inverse-design workflows.
Read the full abstract

Analysis of PDEs

The mean curvature type hypersurfaces with prescribed gradient image

In this paper, we consider the existence of mean curvature type hypersurfaces with prescribed gradient image. Let $\Omega$ and $\tilde{\Omega}$ be uniformly convex bounded domains in $\mathbb{R}^n$ with smooth boundary. We show that there exists unique convex solutions for the second boundary value problem of mean curvature type equations.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Local Linearity of LLMs Enables Activation Steering via Model-Based Linear Optimal Control

Inference-time LLM alignment methods, particularly activation steering, offer an alternative to fine-tuning by directly modifying activations during generation. Existing methods, however, often rely on non-anticipative interventions that ignore how perturbations propagate through transformer layers and lack online error feedback, resulting in suboptimal, open-loop control. To address this, we show empirically that, despite the nonlinear structure of transformer blocks, layer-wise dynamics across multiple LLM architectures and scales are well-approximated by locally-linear models. Exploiting this property, we model LLM inference as a linear time-varying dynamical system and adapt the classical linear quadratic regulator to compute feedback controllers using layer-wise Jacobians, steering activations toward desired semantic setpoints in closed-loop with minimal computational overhead and no offline training. We also derive theoretical bounds on setpoint tracking error, enabling formal guarantees on steering performance. Using a novel adaptive semantic feature setpoint signal, our method yields robust, fine-grained behavior control across models, scales, and tasks, including state-of-the-art modulation of toxicity, truthfulness, refusal, and arbitrary concepts, surpassing baseline steering methods. Our code is available at: https://github.com/trustworthyrobotics/lqr-activation-steering
Read the full abstract

Mathematical Physics · Cross-listed from quant-ph

Asymptotic Metrological Scaling and Concentration in Chaotic Floquet Dynamics

We study quantum sensing with Floquet chaotic dynamics generated by Haar random unitary gates. The metrological resources consist of three ingredients: A given initial state, a set number of Haar random unitary gates and the sensing gates. There are two natural ways of organizing the resources: the first one is the "control" protocol, where the random unitary gates act as random controls and intertwine with the deterministic sensing gates and the second one is the "state-preparation" protocol, where random unitary gates play the role of preparing the metrological useful states. In each protocol, we consider both global Haar random unitary gates and a set of local two-site Haar random unitary gates that forms a Floquet random quantum circuit (RQC) respectively. We find linear, shot-noise scaling of the metrological precision, quantified by the quantum Fisher information (QFI), in the asymptotic limit when the Hilbert space dimension becomes large, and quantum advantages beyond linear scaling in the non-asymptotic regimes. We also bound the fluctuation of the QFI using concentration inequalities. Our analytical findings are corroborated by numerical simulations. Finally, along the way of analyzing the precision limit, we prove an empirical conjecture of RQC: In the asymptotic limit of large local Hilbert space dimension, the Floquet operator of a Floquet RQC essentially behaves like a global unitary operator.
Read the full abstract

Optimization and Control

Optimal Online and Offline Algorithms for Contextual MNL with Applications to Assortment and Pricing

Selecting which products to display and at what prices is a central decision in retail and e-commerce operations. In many applications, these two choices must be made jointly under limited display capacity and uncertain customer demand. In this paper, we study the joint assortment and pricing problem under a price-based contextual multinomial logit model, where customer preferences depend on both product features and selling prices. Our analysis begins with the construction of a new confidence region for demand estimation under price-dependent features. Building on this result, we develop a pessimistic offline algorithm and SupCB-type online algorithms for joint assortment and pricing optimization. In the offline setting, we establish a suboptimality guarantee governed by local information around the optimal assortment-price pair, rather than by exact coverage of the optimal action. In the online setting, our SupCB-type algorithm improves the best previously known regret bound to $\widetilde{O}(W\sqrt{dT\log N}/L_0)$, and we also provide a computationally simpler Thompson-sampling alternative. When specialized to the assortment-only or pricing-only setting, our bounds recover the near-minimax-optimal rates established in those respective domains, thereby bridging the gap between the mature study on assortment optimization or dynamic pricing and the limited literature on their joint optimization.
Read the full abstract

All authors Yunfan Zhang, Yuxuan Han, Hongyu Shan, Jose Blanchet, Zhengyuan Zhou

Analysis of PDEs

On the second boundary value problem for Lagrangian mean curvature type equation

This article is concerned with the second boundary value problem of the Lagrangian mean curvature type equation arising from special Lagrangian geometry. By the parabolic method, we consider a fully nonlinear parabolic equation with oblique derivative boundary condition, and show the long time existence and convergence of the flow. It follows that the existence and uniqueness of the smooth uniformly convex solution are obtained, which generalizes the Brendle–Warren's theorem about minimal Lagrangian diffeomorphism in Euclidean metric space.
Read the full abstract

Analysis of PDEs

Symmetry and critical points of second Neumann eigenfunctions on isosceles trapezoids and kites

We classify the symmetry and multiplicity of the second Neumann eigenvalue on isosceles trapezoids and kites as the height varies. Precisely, away from a unique transition height, the second Neumann eigenvalue is simple, and its eigenfunction is either symmetric or antisymmetric. At a transition height, it has multiplicity two, with one symmetric and one antisymmetric basis eigenfunction. We prove that every nonzero real second Neumann eigenfunction has no interior critical points, including arbitrary linear combinations at a transition height, thereby verifying the hot spots conjecture for both classes of domains. In the simple-eigenvalue case, we also classify the nonvertex boundary critical points for trapezoids and kites. Reflection reduces the spectral classification to a comparison of a Neumann branch and a mixed Dirichlet–Neumann branch. Energy estimates establish strict transversality at every crossing and hence uniqueness wherever a transition occurs. To treat the two-dimensional eigenspace, we use Jacobian estimates and directional and radial comparison arguments to exclude cancellation of the two basis gradients.
Read the full abstract

All authors Haiyun Deng, Changfeng Gui, Xuyong Jiang, Xiaoping Yang, Ruofei Yao, Jun Zou

Optimization and Control

A Data-embedded Solution Paradigm for Nonconvex Probable Event Constrained Optimization

This paper introduces a new modeling framework for optimization under uncertainty, called Probable Event Constrained Optimization (PECO). Unlike conventional chance-constrained formulations, which only limit the probability of constraint violation, PECO also explicitly requires feasibility for all events whose probability exceeds a prescribed threshold. This guarantees that solutions remain valid across all high-probability realizations of uncertainty. To solve PECO, we proposed a data-embedded program (DEP) which directly incorporates historical measurements of the uncertain parameters to obtain a deterministic approximation for PECO. While existing solution methods for optimization problems under uncertainty rely heavily on convexity or linearity assumptions, the proposed data-embedded solution paradigm provides a unique opportunity for solving nonlinear and nonconvex PECOs. The effectiveness of this approach depends on properly estimating the number of elements in the family of solution-determining data sets. As we enter the era of big data, this information can be properly estimated by leveraging the power of machine learning.
Read the full abstract