Analysis of PDEs
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Thursday 30 April
The primary goal of this paper is to give a precise definition and prove existence and uniqueness of multiphase quadrature domains for subharmonic functions, ensuring that the prescribed measures are supported in the interior of the resulting domains. The approach to prove existence is based on a variational framework, where we minimize an energy functional over so called segregated states. In this respect we refine earlier results in this direction. But we also show that this approach alone is not enough for two reasons. First of all it seems hard to get existence results which ensure that the interior support condition is satisfied. And second it may happen, as we show by an example, that a multiphase quadrature domain exists but is not a minimizer of the energy functional. The main novelty of this work is the study of minimizers, if they exist, of the energy functional over a subset of the segregated states given by a natural constraint with respect to the given measures. From this approach we are able to prove uniqueness, and also give sufficient conditions for existence. We also give an example showing that, unlike the energy minimization and partial balayage approaches which are equivalent in the one-phase case, this equivalence breaks down already in the two-phase setting.
Optimization and Control
Solution Sets for Inverse Infinite-Horizon Linear-Quadratic Descriptor Differential Games
In this letter, we study a model-based inverse problem for infinite-horizon linear-quadratic differential games with descriptor dynamics. Given an observed feedback strategy profile, we seek to identify all cost functions that rationalize it as a feedback Nash equilibrium; this collection is referred to as the solution set. We characterize the solution set, show that it is rectangular and convex, and provide an algorithm for computing an admissible realization whenever it is nonempty. We also show that, compared with the corresponding inverse problem for standard state-space dynamics, descriptor dynamics modify the geometry of the solution set and may reduce identifiability. Finally, we illustrate the results with numerical examples.
Read the full abstract
Numerical Analysis
A neural network method for scalar conservation laws with convergence rates for shock waves
We propose a new entropy-compatible neural network method for scalar hyperbolic conservation laws and establish, to our knowledge, the first explicit $L^1$ convergence rates in this setting for piecewise smooth entropy solutions, including those with discontinuities. The method is based on a computable approximation of the Kružkov entropy residual that sits between the strong and weak forms of the entropy inequality. For a single regular shock in one dimension and finitely many smooth shock hypersurfaces with transversal interactions in several dimensions, we construct explicit neural networks with provably small loss by combining shock-adapted continuous piecewise linear functions with known approximation properties of $\tanh$ neural networks. The one-dimensional analysis also covers rarefactions, compound waves, regular shock interactions, and nondegenerate shock formation from smooth initial data. Together with entropy-based stability estimates, this gives rigorous $L^1$ error bounds for minimizers of the proposed loss. In particular, when the network size grows in proportion to the number of degrees of freedom of a space–time mesh of size $h$, the analysis recovers the classical Kuznetsov rate $O(h^{1/2})$ in shock-dominated cases. Numerical experiments in one and two space dimensions illustrate the performance of the method.
Read the full abstract
Analysis of PDEs
Existence and Uniqueness of Normalized Multi-peak Solutions for Coupled Nonlinear Schrödinger Systems
We consider the following two-component coupled nonlinear Schrödinger (CNLS) system: \[ \begin{cases} -\Delta u +(P(x) + \lambda ) u=\mu_1 u^3+\beta u v^2, & \text{in } \mathbb{R}^N,\\ -\Delta v +(Q(x) + \lambda ) v =\mu_2 v^3+\beta vu^2, & \text{in } \mathbb{R}^N \end{cases} \] with the mass constraint $\int_{\mathbb{R}^N} (u^2+v^2)\,dx = \rho^2$ for $N=2,3$, where $\rho>0$ is a parameter. By employing the Lyapunov-Schmidt reduction and local Pohozaev identities, we establish the existence and local uniqueness of normalized multi-peak solutions: the result holds for sufficiently small $\rho$ when $N=3$, and for $\rho$ approaching a critical threshold when $N=2$. The main difficulty lies in that the mass constraint involves interactions among all concentration points, while a more refined characterization of such normalized solutions further requires sharp order estimates. In this work, we have discovered some new phenomena that differ from those of solutions without mass constraint and single-peak solutions.
Read the full abstract
Combinatorics
Spanning Subdivisions in Robustly Expanding Digraphs
Kühn, Osthus and Treglown [J. Combin. Theory Ser. B 100 (2010)] proved that every sufficiently large robust outexpander with linear minimum semi-degree contains a Hamilton cycle. In this paper, we extend their result to spanning subdivisions of a digraph $F$ in a robust outexpander $D$, with prescribed branch vertices and arbitrarily specified path lengths. In particular, the digraph $F$ need not be fixed. For an $n$-vertex digraph $D$, $F$ may have as many as a constant multiple of $n/\log n$ arcs. This holds provided that $F$ has sufficiently few vertices and the prescribed lengths satisfy suitable conditions. We further establish a more general result for mixed prescribed path lengths, which allows $F$ to have linearly many arcs when the shorter replacement paths together use only a small proportion of the vertices of $D$. As applications, we obtain spanning subdivision extensions of the asymptotic Nash–Williams theorem for digraphs and an asymptotically sharp Ore-type theorem for oriented graphs.
Read the full abstract
Optimization and Control
Sampler-Robust Optimization under Generative Models
Modern stochastic optimization pipelines increasingly rely on learned generative models to represent uncertainty, while downstream decisions are evaluated almost entirely through Monte Carlo scenarios. This shifts the operational object of uncertainty from an explicit probability law to the sampler induced by the learned generator. Reliability therefore depends on two errors: sampler misspecification and finite-simulation error. We propose Sampler-Robust Optimization (SRO), which optimizes decisions against the worst-case sampler induced by perturbing the learned generator. This sampler-first formulation aligns with simulation-based decision pipelines and admits a sharpness-aware interpretation: it favors decisions whose performance is stable under generator perturbations, rather than merely under the nominal sampler. Under a coverage assumption, we show that the empirical worst-case objective provides a high-probability upper certificate for the true population objective, with finite-simulation error partially absorbed by the robustification used to guard against sampler misspecification. The framework accommodates generative models with or without explicit densities and admits efficient minimax procedures. Portfolio-optimization experiments show that SRO produces more stable decisions and improves out-of-sample performance under distribution shift.
Read the full abstract
Operator Algebras
A class of Exel–Laca algebras reciprocal to Cuntz–Krieger algebras
The reciprocality means a duality in Kirchberg algebras between K-theory groups and strong extension groups. In the paper, we will find a certain class of unital simple Exel–Laca algebras for which the reciprocal duals are simple Cuntz–Krieger algebras in terms of the underlying infinite matrices. In our procedure to obtain simple Cuntz–Krieger algebras from Exel–Laca algebras, we compute the strong extension groups for Exel–Laca algebras belonging to the class.
Read the full abstract
Statistics Theory
Bayesian online learning in the one-pass regime: Frequentist validity and uncertainty quantification
Bayesian online learning provides a coherent framework for sequential inference. However, its theoretical understanding remains limited, particularly in the one-pass setting. Existing theoretical guarantees typically require the mini-batch sample size to diverge, a condition that fails in the one-pass regime. In this paper, we propose a new Bayesian online learning algorithm tailored to the one-pass setting, which incorporates a warm-start phase to ensure stable sequential updates. For this algorithm, we show that the sequentially updated posterior attains the optimal convergence rate. Building on this, we establish an online analogue of the Bernstein-von Mises theorem, which guarantees valid uncertainty quantification without diverging mini-batch sample sizes. Our analysis is based on a novel theoretical framework that differs fundamentally from existing approaches in the online learning literature. Numerical experiments on generalized linear models show that the proposed method matches the performance of the batch estimator while outperforming existing online procedures.
Read the full abstract
Optimization and Control
A Geometric Perspective on Polynomially Solvable Convex Maximization
Convex maximization encompasses a broad class of optimization problems and is generally NP-hard, even for low-rank objectives. This paper investigates structural conditions under which convex maximization becomes polynomially solvable. From a geometric perspective, we introduce comonotonicity, a structural property of the feasible region crucial for problem tractability, and establish mathematical characterizations of this property. Under comonotonicity and mild additional assumptions, we develop a unified enumerative framework showing that fixed-rank convex maximization is polynomially solvable. This viewpoint recovers several known tractability results that previously required separate analyses, such as fixed-rank convex matroid maximization and sparse principal component analysis (SPCA). Furthermore, for the more structured class of standard comonotone feasible regions, we refine the analysis via a lifting technique to achieve a square-root improvement in the complexity bound. Finally, applications to SPCA and its variants illustrate the broad applicability and effectiveness of the proposed framework.
Read the full abstract
Combinatorics
On the minimum number of maximal distance-$k$ independent sets in trees
A vertex subset of a graph is called a distance-$k$ independent set if the distance between any two of its distinct vertices is at least $k + 1$. For all $n,k \geq 1$, we determine the minimum possible number of inclusion-wise maximal distance-$k$ independent sets among all $n$-vertex trees. It equals $n$ if $n \leq k + 1$, and $n - \bigg\lfloor \frac{n - (k \bmod 2)}{\lfloor k/2 \rfloor + 1} \bigg\rfloor + 1$ otherwise. We also completely describe the class of trees attaining this bound and determine the growth rate of the number of such $n$-vertex trees for a fixed $k \geq 1$. If $k$ is odd and $(k+1)/2$ does not divide $n-1$, then the number of non-isomorphic $n$-vertex trees with the minimum possible number of maximal distance-$k$ independent sets grows linearly with $n$. Otherwise, it is bounded above by the number of unlabeled $k^2$-vertex trees.
Read the full abstract
Differential Geometry
Hirzebruch $\chi_{y}$-genus of compact almost Kähler manifold with negative sectional curvature
Let \((X,J,\omega)\) be a closed \(2n\)-dimensional almost Kähler manifold with negative sectional curvature. We prove that if the Nijenhuis tensor of the almost complex structure is sufficiently small, then the components of the Hirzebruch \(\chi_{y}\)-genus satisfy the inequality \((-1)^{n-p}\chi_{p}(X)\geq 1\) for all \(p=0,1,\cdots,n\). In particular, this result implies the Hopf conjecture in this setting, namely that the Euler number satisfies \((-1)^{n}\chi(X)\geq n+1\). The proof is based on new \(L^{2}\)-estimates for harmonic forms on the universal covering, combined with a refined vanishing theorem for the operator \(\bar{\partial}+\bar{\partial}^{*}\) and Atiyah's \(L^{2}\)-index theorem. This work extends the classical result of Gromov [J. Differential Geom., 1991] from the Kähler to the almost Kähler setting under the stated smallness condition.
Read the full abstract
Commutative Algebra
Flat coordinates of Frobenius prepotentials related with the reflection groups of types $H_3$ and $H_4$
In this article, we first explain a group theoretic interpretation of the derivation of the relation between the flat coordinates of the polynomial prepotential $(H_3)$ and those of the algebraic prepotential $(H_3)'$ given in \cite{KMS2} constructed by M. Feigin, D. Valeri and J. Wright \cite{FVW}. By the same idea explained in the case of $(H_3)$, we will show a relation between the flat coordinates of the polynomial prepotential $(H_4)$ and those of the algebraic prepotential $H_4(9)$ given in \cite{Se}.
Read the full abstract
Numerical Analysis
A Shifted Cohesive-Zone Method for Non-Interface-Fitted Meshes with Applications to Crystal Plasticity
The accurate simulation of interface-dominated solid mechanics problems on complex microstructures remains challenging, particularly when interface-fitted quadrilateral or hexahedral meshes are difficult to generate. We extend the shifted boundary method (SBM) to cohesive-zone formulations and introduce the Shifted Cohesive Zone Method (SCZM), with applications to crystal plasticity on non-interface-fitted meshes. By shifting the enforcement of traction-separation laws from the true interface to a nearby surrogate interface, SCZM enables the use of standard finite element spaces while avoiding the meshing burden associated with interface-conformal discretizations. We present a simplified SCZM weak form defined on the surrogate interface, leading to a straightforward implementation of the nonlinear residual and consistent tangent matrix. The method is implemented in the open-source MOOSE framework and coupled with constitutive models from NEML2, enabling simulations with linear elasticity, multiple traction-separation laws, and history-dependent crystal plasticity. We further develop a geometry-aware, PCA-enhanced point classification algorithm to accelerate surrogate-domain construction. Verification and benchmark studies in two and three dimensions demonstrate that SCZM achieves first-order convergence for non-interface-fitted interface problems and closely matches interface-fitted reference solutions in terms of reaction forces, surface energy release, deformation, stress fields, and damage evolution. These results indicate that SCZM provides an accurate and efficient framework for modeling interface mechanics in complex microstructures without requiring interface-fitted meshes.
Read the full abstract
Optimization and Control
A Regularized Hessian-Free Inexact Newton-Type Method with Global $\mathcal{O}(k^{-2})$ Convergence
We propose a regularized Hessian-free Newton-type method for minimizing smooth convex functions with Lipschitz continuous Hessians. The algorithm constructs an approximate Hessian by finite differences and selects the regularization parameter through an adaptive criterion that ensures sufficient decrease and gradient control. We prove that the method achieves a global $\mathcal{O}(k^{-2})$ convergence rate, matching the best known bound for second-order methods. A modified variant incorporating the exact Hessian when available enjoys local quadratic convergence under standard assumptions. Despite its simplicity, this variant is computationally faster than the Regularized Newton Method of Mishchenko (2023) across several convex benchmark problems. Our analysis also provides explicit bounds on the regularization sequence and a worst-case iteration complexity of order $\mathcal{O}(\varepsilon^{-2})$. The proposed framework thus unifies regularized and Hessian-free Newton-type schemes, offering a theoretically sound and practically efficient alternative for smooth convex optimization.
Read the full abstract
Dynamical Systems
Optimal response for stochastic differential equations in $\mathbb{T}^d$ with perturbations on the drift term
We study stochastic differential equations on the $d$-dimensional flat torus $\mathbb{T}^d$ with drift and perturbation coefficients in $L^{\infty}(\mathbb{T}^d;\mathbb{R}^d)$ and additive non-degenerate noise. For the associated transfer operators, we analyse the dependence of the stationary measure and of the expectation of a given observable on small perturbations of the drift. In this framework, we prove a linear response formula for the invariant density and for the expectation of a given observable. We then address an optimal response problem, namely the determination of admissible perturbations that maximise the first-order variation of a prescribed observable. We establish existence of optimal perturbations and, in a Hilbert space framework, prove uniqueness and provide an explicit characterisation of the optimiser. This yields a practical Fourier-based numerical method, which we implement in several numerical examples, including both low and high-dimensional settings.
Read the full abstract
Number Theory
Simple Lie Groups of type An as Galois groups over Q
In this paper, we utilize our previous results on mod p monodromy of cyclic coverings of the projective line to realize a large series of groups of the form PSL(n, q) and PSU(n, q) as Galois groups over Q. We achieve for the first time a fully explicit infinite series of such groups where simultaneously the field can have arbitrarily large degree over the prime field and the group does not coincide with PGL(n, q) or PGU(n, q), respectively.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Feedback Linearization of Hyperbolic PDEs with Volterra Nonlinearities
Alberto Isidori's framework of geometric nonlinear control, and particularly of feedback linearization, is the inspiration behind PDE backstepping: apply a transfromation of the state to cast the plant into a canonical form, bring all the non-canonical effects within the "span" of (boundary) control, and close the design with a feedback that makes the closed loop evolve in accordance with well-studied stable dynamics. The specificity of this approach is that, for PDEs, there is not one canonical form (like Brunovsky for ODEs) but the canonical forms are PDE-class-specific. When conducting this process for nonlinear PDEs, where the "transformation of the state" is performed using a nonlinear Volterra series indexed by the spatial variable, enormous technical challenges arise. One has to deal with kernels governed by PDEs on simplex domains growing in dimension to infinity, capture the growth rates of these kernels of the "direct transformation," and conduct the same for the "inverse transformation" without directly studying its Volterra kernels. So far, this agenda has been executed only once, two decades ago: for parabolic PDEs by Vazquez and Krstic [Automatica, 2008]. Generalization attempts have not followed because of the immense complexity involved in feedback-linearizing nonlinear PDEs. In this paper, dedicated to Professor Isidori, we convert the PDE feedback-linearizing methodology of 2008 from the parabolic to a hyperbolic class and, for a transport-adapted subclass of Chen-Fliess series, construct controllers without kernel PDEs.
Read the full abstract
Geometric Topology
The Lipschitz Spinor-Higher Horosphere Correspondence
In a paper of Mathews, an isomorphism is constructed between two-component complex spinors and horospheres in H^3 carrying `spin decorations'. A recent arXiv preprint of Mathews and Varsha arXiv:2412.06572 extends this result to the case of `quaternionic spinors' and spin decorated horospheres in H^4. The following work generalises these results to an equivariant correspondence between two-component `Lipschitz spinors' with entries drawn from the Lipschitz group of a Clifford algebra, null multiflags in generalised Minkowski space, and higher-dimensional horospheres that carry an extension of the Mathews spin decoration. This correspondence allows spinors to be applied to horospheres in any dimension of hyperbolic space.
Read the full abstract
Number Theory
Mod p Monodromy of Cyclic Covers of the Projective Line
In this paper, we prove a big monodromy theorem for the monodromy of cyclic coverings of projective line for cohomology with Fp-coefficients. This is a direct generalization of the results of Achter and Pries, where such a theorem is proved for cyclic coverings of degree 2 and 3. Instead of generalizing their methods, we adapt the proof of the analogous theorem for integral cohomology. In our subsequent work, we will apply this theorem to construct in infinitely many cases Galois extensions of Q with Galois group PSL(n, q) and PSU(n, q), where q can be an arbitrarilty large prime power.
Read the full abstract
Analysis of PDEs
Determination of an anisotropic perturbation in elastic inverse scattering
We consider a linearized inverse scattering problem for elastic waves. We prove that a fully anisotropic perturbation of the elastic parameters around an isotropic and homogeneous reference can be uniquely determined by (single-)scattered waves. We also give a quantitative stability estimate for an isotropic perturbation, and as a consequence a rigidity result is established.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Nonadiabatic Renormalization Group for Strongly Coupled Multiscale Quantum Systems
Complex quantum systems are often multiscale in nature with strong interactions between different scales. We present a novel idea: iteratively suppressing, rather than tracing out, the fast, high-energy degrees of freedom in strongly correlated quantum systems with multiple energy scales in a non-perturbative way, termed nonadiabatic renormalization group. This leads to a quantum geometric structure of a nested fiber bundle, in which each fiber of a layer is itself a fiber bundle of the next layer. The nonadiabatic renormalization group brings a new type of tensor network states that shares physical legs among ”sites” and encodes quantum entanglement beyond conventional matrix product states. We demonstrate how to apply the nonadiabatic renormalization group to different types of problems, including an interacting boson model and ab initio quantum chemistry with interacting electrons.
Read the full abstract
Optimization and Control
Mean-Field Systems with Heterogeneous Subteams: Optimality of Cluster-Symmetric Independent Policies and Equivalence with Decentralized McKean-Vlasov Control of Cluster-Representative Agents
Across science and engineering, mean-field methods have been a powerful and versatile approach for the analysis of systems of many interacting elements. However, common arguments used to characterize an infinite population limit can be quite restrictive from a modeling perspective by requiring that all agents be identical (i.e. symmetric, or homogeneous). In this paper, we consider large interactive particle systems under agent heterogeneity for a class of discrete time teams composed of finitely many species of agents, grouped into symmetric subteams, called clusters. In particular, for the class of discounted, partially exchangeable cost criteria considered, we establish the optimality of centralized joint policies which are exchangeable within each cluster and depend on the agent ensemble only up to the state empirical distribution over each cluster. Following this, a generalization of De Finetti's theorem is used to demonstrate the subsequential convergence of these optimal policies to one which is decentralized (depending on only the local state and distribution over each cluster) and symmetric within each subteam as the population size approaches infinity. This solution is shown to induce a sequence of asymptotically optimal policies for the finite population problems which retain their structure and decentralization. Furthermore, our analysis justifies the optimality of a decentralized McKean-Vlasov team representation involving coupled representative agents for each of the clusters, and establishes a verification theorem/value iterations for the mean-field limit. In this way, we provide an avenue for analyzing complex, cooperative systems with finite heterogeneity and set the stage for further research on learning algorithms.
Read the full abstract
Optimization and Control
Continuous-time q-learning for mean-field control with common noise, part-II: q-learning algorithms
This paper is a continuation work of Ren et al. (2026) aiming to further devise q-learning algorithms for mean-field control (MFC) with controlled common noise. Based on the relaxed control formulation, we first establish the martingale condition of the value function and the Iq-function by evaluating along the conditional state distributions generated by all test policies. As the data in the relaxed control formulation are not observable in practice, we quantify the error incurred when they are replaced by the observable ones in the exploratory formulation under discretely sampled actions. This, together with a two-layer fixed point characterization of an optimal policy in Ren et al. (2026), allows us to propose several algorithms including the Actor-Critic q-learning algorithm, in which the policy is updated in the Actor-step based on the iteration rule induced by the improved Iq-function, and the value function and Iq-function are updated in the Critic-step based on the martingale orthogonality condition using the data from the exploratory formulation. We also establish the convergence of the inner iterations in the Actor-step in an infinite-horizon linear quadratic (LQ) framework. In two examples, within and beyond LQ framework, our q-learning algorithms are implemented with satisfactory performance.
Read the full abstract
Algebraic Geometry
Noncommutative Quillen-Lichtenbaum Conjecture
We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we generalizes the conjecture through the lens of noncommutative geometry.
Read the full abstract
Optimization and Control
Continuous-time q-learning for mean-field control with common noise, part-I: Theoretical foundations
This paper investigates the continuous-time counterpart of the Q-function for entropy-regularized mean-field control (MFC) with controlled common noise, coined as q-function by Jia and Zhou (2023) in the single agent's model. We first show that, under discretely sampled actions, the value function in the exploratory formulation converges to the one in the relaxed control formulation as the time grid refines. Leveraging the relaxed control formulation, we derive the exploratory Hamilton-Jacobi-Bellman (HJB) equation, in which the controlled common noise gives rise to an additional nonlinear functional of policy, rendering the policy iteration intricate. Under certain concavity condition, we establish the existence and uniqueness of the optimal one-step policy iteration via a first-order condition using the partial linear functional derivative with respect to policy. The policy improvement at each iteration is verified by relating to an entropy-regularized optimization problem over the space of policies. In the mean-field setting, we introduce the integrated q-function (Iq-function) defined on the state distribution and the policy, and it is shown that an optimal policy is identified as a two-layer fixed point to the argmax operator of the Iq-function. Finally, we provide the explicit characterization of an optimal policy as a Gaussian distribution in the general linear-quadratic (LQ) setting.
Read the full abstract
Combinatorics
Characterizations of amorphic association schemes in terms of fusing triples
Let $\mathcal{R}$ be an association scheme with nontrivial relations $A_1,\ldots,A_d$. We call $\mathcal{R}$ amorphic if every possible fusion of its nontrivial relations gives rise to a fusion scheme. We define the fusing-relations $3$-hypergraph of $\mathcal{R}$ to be the $3$-uniform hypergraph on the vertex set $\{A_1,\ldots,A_d\}$ such that $\{ A_i, A_j, A_k \}$ forms an edge if it fuses, i.e., fusing $A_i, A_j, A_k$ gives rise to a fusion scheme of $\mathcal{R}$. A $3$-uniform hypergraph is called a $3$-sunflower if, for the edges, the union is the set of vertices and the intersection consists of $2$ vertices. In this paper, we prove that for $d\geq 5$, $\mathcal{R}$ is amorphic if its fusing-relations $3$-hypergraph contains two $3$-sunflowers. As a corollary, for $d\geq 5$, $\mathcal{R}$ is amorphic if and only if all triples of its nontrivial relations fuse.
Read the full abstract
Optimization and Control
Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
We study the set of solutions to a parameterized, strongly convex optimization problem whose cost depends on uncertain, bounded parameters. We compute a certified outer approximation of the corresponding set of optimizers, using convergence properties of the projected gradient descent (PGD) algorithm for convex programs. Concretely, by treating the cost parameter as constant but unknown, we interpret the PGD iterates as an uncertain dynamical system and analyze its forward reachable sets. Since PGD converges exponentially to the unique optimizer for each fixed parameter, these reachable sets provide outer approximations of the optimizer set, with an explicit error bound that decays exponentially with the iteration count. We apply system-level synthesis (SLS) on the PGD dynamics to optimize the step-size sequence and obtain reachable-set over-approximations. Our method outperforms existing baselines in over-approximating, with low conservativeness, the minimizer sets of convex programs with uncertain costs and high-dimensional decision variables.
Read the full abstract
Commutative Algebra
Syzygies of the transfer ideal of the symmetric group
We consider the modular action of the symmetric group $S_n$ on $R = k[x_1,\ldots,x_n]$ when $\mathrm{char}(k) = p \leq n$. We show that the image of the transfer map $R\to R^{S_n}$ is an elimination ideal $J\cap R^{S_n}$, where $J\subset R^{S_n}[t]$ is generated by $p$ polynomials with generic coefficients. The structure of this elimination ideal depends only on the quotient $q$ when writing $n = qp + r$ with unique remainder $0 \leq r < p$, implying that the image of the transfer also enjoys this stability. We conjecture a determinantal presentation of the elimination ideal and prove it in the case that $q = 2$. Furthermore, we exhibit a GL-equivariant, linear minimal free resolution of a certain initial ideal, allowing us to extract the graded Betti numbers of the elimination ideal.
Read the full abstract
Complex Variables
Geometry of bounded domains with piecewise smooth boundary
In this paper, we study the geometry of bounded domains with piecewise smooth boundary. Specifically, we obtain the relationship between the squeezing function corresponding to polydisk and Levi flatness on bounded convex domains. As an application, we prove that a two-dimensional bounded generic convex domain with piecewise $C^2$-smooth boundary that is not smooth and admits a finite volume quotient is biholomorphic to bidisk. Moreover, we show that any Teichmüller space $\mathcal{T}_g$ with $g\geq2$ cannot be biholomorphic to a bounded domain with piecewise $C^2$-smooth boundary.
Read the full abstract
Combinatorics
The maximum size of the partial ground set of skew Bollobás systems
A skew Bollobás system $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ is a collection of pairs of disjoint subsets of $[n]$ such that $A_i\cap B_j\ne\emptyset$ for any $1\leq i<j\leq m$. Denote by $S_1(a, b)$ or $S_2(a, b)$ the maximum size of $\bigcup_{i=1}^m A_i$ or $\bigcup_{i=1}^m B_i$, respectively, over all possible skew Bollobás systems $\mathcal{P}=\{(A_i,B_i):1\leq i\leq m\}$ satisfying $|A_i| \leq a$ and $|B_i| \leq b$ for all $i \in [m]$. It is shown that for any non-negative integers $a$ and $b$, $S_1(a,b)=\binom{a+b+1}{a}-1$ and $S_2(a,b)=\binom{a+b+1}{a+1}-1$.