Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 12 May
This paper establishes mesoscopic rates of convergence in the $L^1$-Wasserstein distance for eigenvalue determinantal point processes (DPPs) derived from the Laguerre Unitary Ensemble (LUE) to the corresponding limiting point process (Airy process) as the dimension goes to infinity. Specifically, we prove convergence rates at the leftmost edge of the LUE spectrum, which corresponds to the least eigenvalue. These results are termed mesoscopic because they allow for a direct comparison of point counts between the convergent DPPs and their limits over a range of scales.
Operator Algebras
Model theory and Connes' bicentralizer problem
We make a series of model-theoretic contributions to Connes' bicentralizer problem, one of the most prominent open problems in the theory of von Neumann algebras. Our work builds on the recent result of Houdayer and Marrakchi who show that, for separable diffuse W$^*$-probability spaces, having trivial bicentralizer is equivalent to being selfless, that is, having the first factor inclusion into the free product be an existential embedding. We first show that the class of selfless $W^*$-probability spaces is $\forall\exists$-axiomatizable. We then extend the Houdayer-Marrakchi equivalence to all diffuse W$^*$-probability spaces, removing the separability hypothesis. Combining these results, we show that for any axiomatizable class of diffuse $W^*$-probability spaces, those with trivial bicentralizer form an $\forall\exists$-axiomatizable class; in particular, the class of type $\mathrm{III}_1$ factors with trivial bicentralizer is $\forall\exists$-axiomatizable. We give concrete axioms for this class using totally bounded variants of Haagerup's characterization of the bicentralizer, which we develop here and believe to be of independent interest. We also introduce the notion of pseudoperiodic $\mathrm{III}_1$ factors and show that any such factor has trivial bicentralizer. In the final section, we prove that the bicentralizer problem has a positive solution if and only if the bicentralizer functor is a zeroset relative to the theory of $\mathrm{III}_1$ factors. We use this result to give an equivalent formulation of the bicentralizer problem in terms of a uniformity condition on Haagerup's Dixmier-type characterization of the bicentralizer.
Read the full abstract
Optimization and Control
Indefinite Stochastic LQ Optimal Control for Jump-Diffusion Systems with Random Coefficients
This paper studies indefinite stochastic linear-quadratic (LQ) optimal control for jump-diffusion systems with random coefficients. We construct an algebraic inverse flow from the zero-control base system, extract the semimartingale kernel of the value function, and prove that it satisfies a generalized stochastic Riccati equation with jumps (SREJ). Under a uniform convexity condition, we establish the existence and uniqueness of open-loop optimal controls for any initial pair and show that the associated matrix $\mathscr{N}(t)$ is uniformly positive definite, yielding an exact closed-loop feedback representation of the optimal control via the SREJ. A distinguishing feature of our approach is that it requires neither relaxation techniques (as in the compensator method) nor additional invertibility assumptions on the optimal state process, and it accommodates the general case where the control enters the jump part ($F \neq 0$). As an application, we analyze a financial portfolio problem with a jump-diffusion risky asset whose excess return is zero, where the investor minimizes a cost functional with a negative terminal wealth weight. The uniform convexity condition reduces to an explicit inequality among the risk aversion coefficient, volatility, jump magnitude, and risk-free rate, thereby delineating the parametric region in which an optimal strategy exists. These results extend classical indefinite LQ theory to jump-diffusion systems with random coefficients.
Read the full abstract
Optimization and Control · Cross-listed from cs.RO
Adaptive Smooth Tchebycheff Attention for Multi-Objective Policy Optimization
Multi-objective reinforcement learning in robotic domains requires balancing complex, non-convex trade-offs between conflicting objectives. While linear scalarization methods provide stability, they are theoretically incapable of recovering solutions within non-convex regions of the Pareto front. Conversely, static non-linear scalarizations (e.g., Tchebycheff) can theoretically access these regions but often suffer from severe gradient variance and optimization instability in deep RL. In this work, we propose an Adaptive Smooth Tchebycheff framework that resolves this tension by dynamically modulating the curvature of the optimization landscape. We introduce a novel conflict-driven controller that regulates the optimization smoothness based on real-time gradient interference. This allows the agent to anneal toward precise, non-convex scalarization when objectives align, while elastically reverting to stable, smooth approximations when destructive gradient conflicts emerge. We validate our approach on a challenging robotic stealth visual search task – a proxy for monitoring of protected/fragile ecosystems – where an agent must balance search, exposure/interference minimization and exploration speed. Extensive ablations confirm that our conflict-aware adaptation enables the robust discovery of Pareto-optimal policies in non-convex regions inaccessible to linear baselines and unstable for static non-linear methods. Website: https://alejandromllo.github.io/research/pasta/
Read the full abstract
Dynamical Systems · Cross-listed from cs.LG
Center-Manifold Reduction of Learning at Bifurcations: Interference and Rich Learning in Recurrent Neural Networks
Rich learning in recurrent neural networks often proceeds through sudden transitions in latent dynamics, but there is little theory predicting how gradient descent behaves during these events. We study the local learning geometry near codimension-one bifurcations through the global empirical Neural Tangent Kernel (GeNTK). Under local center-manifold conditions, and when bifurcation-related sensitivity dominates bounded residual terms, we show that the global parameter-to-state Jacobian \(D_\theta h\) is approximated by a low-rank normal-form operator. The induced GeNTK and Fisher information matrix therefore become strongly amplified and anisotropic, concentrating toward a rank-one channel for the four scalar codimension-one bifurcations and a rank-two real channel for a Neimark–Sacker bifurcation. Controlled high-dimensional RNN experiments validate this operator reduction. In learned RNNs, the same low-rank concentration coincides with abrupt loss changes and subtask interference, while a local projection predicts the sign of these effects near isolated events. Finally, in an input-driven 15-task LeakyRNN, GeNTK amplification aligns with continuation-detected changes in the MemoryPro dynamics. These results suggest a tractable operator-level description of learning near dynamical transitions, together with scalable diagnostics for amplified low-dimensional learning geometry.
Read the full abstract
Optimization and Control
Uncovering Symmetry Transfer in Large Language Models via Layer-Peeled Optimization
Large language models (LLMs) are pretrained by minimizing the cross-entropy loss for next-token prediction. In this paper, we study whether this optimization strategy can induce geometric structure in the learned model weights and context embeddings. We approach this problem by analyzing a constrained layer-peeled optimization program, which serves as a mathematically tractable surrogate for LLMs by treating the output projection matrix and last-layer context embeddings as optimization variables. Our analysis of this nonconvex optimization program demonstrates that symmetries in the target next-token distributions are transferred to the global minimizers of the layer-peeled model in a precise group-theoretic sense. Specifically, we prove that when the target tokens exhibit a cyclic-shift symmetry (such as the seven days of the week or the twelve months of the year), the optimal logit matrix is exactly circulant, and the Gram matrices of both the output projections and the context embeddings form circulant geometries as well. Next, for exchangeable target distributions invariant under the symmetric group and, more generally, under two-transitive group actions, we show that the global optimal output projection matrix forms a simplex equiangular tight frame, while the optimal logit matrix and context embeddings inherit the permutation symmetries present in the input data. A key technical step is to reduce the constrained nonconvex factorized problem to an explicit logit-level convex characterization for cyclic symmetry and to a symmetry-based lower bound for permutation symmetry, together with a sharp characterization of the optimal factorization. Finally, we empirically demonstrate that open-source LLMs naturally exhibit symmetries consistent with our theoretical predictions, despite being trained without any explicit regularization promoting such geometric structure.
Read the full abstract
Optimization and Control
Asymptotic KKT Conditions for Continuous-Time Nonlinear Programming
This paper addresses the class of continuous-time nonlinear programming problems with equality and inequality constraints. The paper presents necessary optimality conditions of the sequential form. To be more precise, a sequence of solutions converging to the optimal solution is demonstrated to exist, and such that Karush-Kuhn-Tucker-type conditions are satisfied asymptotically. It is shown that these sequential Karush-Kuhn-Tucker-type conditions also become sufficient for optimality under convexity assumptions. Sequential optimality conditions are a valuable tool for determining when to terminate a numerical method of solution. In this regard, an augmented Lagrangian-type method is proposed for numerically solving continuous-time programming problems. A convergence analysis concerning viability and optimality is presented. The performance of the method is evaluated by applying it to solve instances of continuous-time problems found in the literature.
Read the full abstract
Rings and Algebras
Cocommutative Hopf Dialgebras and Rack Combinatorics
We study cocommutative Hopf dialgebras through generalized digroups and rack combinatorics. We prove that the rack functor obtained from the adjoint rack bialgebra factorizes through the digroup of group-like elements. More precisely, for every cocommutative Hopf dialgebra $A$, the rack of set-like elements of its adjoint rack bialgebra is naturally isomorphic to the conjugation rack of the digroup $\Glike(A)$. For finite generalized digroups $D\simeq G\times E$, with $G$ acting on the halo $E$, we derive explicit formulas for the conjugation rack, its inner group, left-translation cycle index, fixed-point polynomial, orbit count and subrack structure. Finally, we construct the digroup algebra $K[D]$, prove that it is a cocommutative Hopf dialgebra, and show that $\Glike(K[D])=D\$.
Read the full abstract
Algebraic Topology
Bousfield Localizations on the Nonmodular Lattice $N_5$
We provide a complete description of the model category structures on the nonmodular lattice $N_5$. Furthermore we explain how these model category structures are related to each other via Bousfield localization. This work heavily relies on the use of combinatorical objects from equivariant homotopy theory known as transfer systems, and it results in a wealth of interesting interactions between combinatorial and homotopical methods.
Read the full abstract
Combinatorics
On the number of distinct spanning trees in pseudorandom graphs
A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there are constants $C$ and $d_0$ such that every $(n,d,\lambda)$-graph with $d\geq d_0$ and $d/\lambda \geq C$ has at least $(\alpha-\varepsilon)^n$ distinct unlabelled spanning trees.
Read the full abstract
Category Theory
A Rigid Category of DNA Secondary Structures
We construct a strict pivotal monoidal category $\mathcal{D}_{\mathrm{DNA}}$ whose objects are DNA sequences (words over $\{A,C,G,T\}$) and whose morphisms are isotopy classes of typed noncrossing planar matchings, composed of through-strands and Watson-Crick-typed arcs, in a rectangle with source and target boundaries. The dual of a sequence is its reverse complement, evaluation and coevaluation are canonical duplex pairings, and the snake identities hold by planar isotopy. A bending correspondence identifies each morphism $x \to y$ with a secondary structure on the combined word $x{}^{\vee} y$; in particular, the generalized elements $\varepsilon \to w$ are exactly the non-pseudoknotted secondary structures on $w$. Composition, viewed in this straightened picture, is computed by a zip-and-transfer operation on complementary interfaces, a combinatorial rearrangement of base-pair connectivity of which toehold-mediated strand displacement is a kinetically specific instance. Because $\mathcal{D}_{\mathrm{DNA}}$ is rigid monoidal, it shares the categorical backbone of pregroup grammars and the DisCoCat framework for compositional semantics: a strong monoidal functor from a grammatical category to $\mathcal{D}_{\mathrm{DNA}}$ maps grammatical reductions to Watson-Crick base pairing and sentence meanings to secondary structures. We describe this functor and discuss connections to algorithmic self-assembly, composable strand-displacement circuits, and constructive dynamical systems.
Read the full abstract
Group Theory
Selfless inclusions arising from commensurator groups of hyperbolic groups
We provide new examples of $\mathrm{C}^*$-selfless groups and inclusions. In particular, we prove that the commensurator group ${\rm Comm}(H)$ of a torsion-free hyperbolic group $H$ is $\mathrm{C}^*$-selfless. Our approach involves showing that the Gromov boundary $\partial H$ is a topologically free extreme boundary for ${\rm Comm}(H)$, ${\rm Aut}(H)$, and for other groups that contain $H$ in an almost normal way.
Read the full abstract
Statistics Theory
Optimal sequential tests yield log-optimal e-processes
It has been recently shown that e-processes are sufficient for sequential testing in the following sense: every level-$\alpha$ sequential test can be obtained by thresholding an e-process at $1/\alpha$. However, in the above result, neither does the test have to be asymptotically optimal (in terms of stopping times) nor does the e-process have to be asymptotically log-optimal. It has separately been shown that asymptotically log-optimal e-processes yield asymptotically optimal sequential tests. In this paper, we prove the converse, arguably completing the story: it is possible to aggregate asymptotically optimal sequential tests into asymptotically log-optimal e-processes. This is accomplished by using a new class of WAIT e-processes: those that are Weighted Aggregates of Indicators of stopping Times that begin at zero, are nondecreasing and increase to infinity under the alternative at the optimal rate. Importantly, the paper discusses several nuances in the varied definitions of asymptotic (log-)optimality.
Read the full abstract
Functional Analysis
Smirnov Decomposition of a Horizontal Vector Charge in the Heisenberg Group
A divergence-free horizontal vector current in Heisenberg space may be viewed as an element of the dual space of horizontal test vector fields. By applying a horizontal Liouville theorem in this setting, the flow lines of such a vector field generate a family of horizontal curves and an associated measure on this collection. In this paper, we provide a direct proof of the Smirnov decomposition for a Federer-Fleming current within the horizontal distribution.
Read the full abstract
Analysis of PDEs
A Classical Analysis Counterpart of Viterbo's Symplectic Geometry Proof of ABP in the Plane
We first provide a classical analysis proof of a version of the Alexandroff-Bakelman-Pucci inequality (ABP) for compactly supported $C^2$ functions in dimension $2$, inspired by the symplectic geometry proof method of Viterbo, which avoids convexity or contact sets. We then show how the proof may be modified to remove the compact support hypothesis and recover the usual statement of ABP, which includes a boundary term. We also discuss the possibility (and difficulties) of extending a pure classical analysis proof to dimension $3$ and above.
Read the full abstract
Probability
Equilibrium Biphasicity and Non-Binary Pathwise Confinement in Stochastic Ising Models
For the low-temperature two-dimensional Ising model, the two pure Gibbs phases exhaust the extremal equilibrium states, but not the pathwise absorbing structure of the Glauber dynamics. Let \[ P^\pm=\{\sigma:M_n(\sigma)\to \pm m_\beta\},\qquad R=\Omega\setminus(P^+\cup P^-). \] We show that \(R\) is null under both pure phases but contains a dense pathwise confined subset. More precisely, we construct a dense family of initial configurations whose trajectories are confined to the centered sector \[ C_0=\{\sigma:M_n(\sigma)\to0\}\subset R. \] Nevertheless, the corresponding Cesaro averages converge to \(\frac12(\mu^++\mu^-)\). Thus the pathwise absorbing geometry is richer than the Gibbs-phase classification, without creating a third Gibbs phase.
Read the full abstract
Numerical Analysis
Approximations with Non-Symmetric Green's Kernels and their Application to Fractional Differential Equations
Several kernel-based methods for the numerical solution of fractional differential equations have been developed in the recent past; however, these techniques exclusively relied on the use of radial basis function approximations. In the present work, we consider the non-symmetric Green's kernel perspective on fractional order spline interpolation and its application to a kernel Galerkin method for the numerical solution of certain fractional order differential equation. Unfortunately, the reliance on a non-symmetric kernel requires that our theoretical analysis of the kernel interpolants must take place outside the familiar setting of reproducing kernel Hilbert spaces. Nevertheless, we are able to prove that the proposed kernel interpolants obtain optimal order convergence rates in a reproducing kernel Banach space.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
UFO: A Domain-Unification-Free Operator Framework for Generalized Operator Learning
Neural operators have become an effective framework for learning mappings between function spaces, yet most existing architectures realize operators within a single representational domain, such as physical, spectral, or latent space. In this work, we introduce UFO (Domain-Unification-Free Operator), a cross-domain neural operator framework that realizes operators through adaptive, jointly conditioned interactions among representations defined on distinct domains. UFO enables discretization decoupling: the input function can be observed at resolutions or locations different from those used during training, while the solution can be queried at arbitrary output resolutions. Across four complementary benchmarks covering discontinuous inputs, irregular sampling with spectral mismatch, nonlinear dynamics, and stochastic high-frequency fields, UFO delivers accurate, robust, and physically coherent predictions under distribution shifts. These results establish cross-domain, phase-modulated realization as a powerful framework for discretization-decoupled neural operator learning.
Read the full abstract
Optimization and Control · Cross-listed from q-fin.MF
Optimal investment and Pension policy in Pay-As-You-Go systems under forward utility and ageing population
This paper investigates optimal investment and pension policies in a Pay-As-You-Go (PAYG) system supplemented by a buffer fund used as an intergenerational risk-sharing mechanism. The social planner's preference criterion is represented by non-zero volatility forward Constant Relative Risk Aversion (CRRA) utilities, and explicitly accounts for both sustainability and adequacy constraints. The optimal policies are characterized in closed form, and an in-depth analysis of the impact of preference sensitivities on the pension scheme is conducted. A detailed numerical analysis is performed to evaluate the sustainability and benefit adequacy of this hybrid PAYG buffer fund arrangement under a range of demographic, financial, and macroeconomic scenarios.
Read the full abstract
Probability · Cross-listed from stat.ML
A Unified Framework for Critical Scaling of Inverse Temperature in Self-Attention
Length-dependent logit rescaling is widely used to stabilize long-context self-attention, but existing analyses and methods suggest conflicting inverse-temperature laws for the context length $n$, ranging from $(\log n)^{1/2}$ to $\log n$ and $(\log n)^2$. We provide a general theory showing that the desirable scale is determined by the gap-counting function $N_n$ of each attention row. Counting how many competitors lie within each gap from the maximum, we define an upper-tail accumulation scale and prove that it gives the critical inverse-temperature scale for softmax concentration: below this scale, the top competitors remain unseparated, whereas above it, the attention entropy collapses. This framework unifies prior scaling laws as different $N_n$ and yields a direct diagnostic for attention-score families, from idealized theoretical models to more practical transformers.
Read the full abstract
Dynamical Systems
Singular geometric averages for ergodic multiflows
Representation Theory
On quandle representations
A unitary finite dimensional quandle representation is decomposable into a direct sum of irreducible represenations. Not all quandle representations satisfy this property. We prove that a finite dimensional quandle represenation $\rho :Q \to GL(V) $ of a finite quandle $Q$ over $\mathbb{C}$ is decomposable into a direct sum of irreducibles if and only if every element in the image of $\rho$ is diagonlizable. We show that an irreducible representation $\rho :Q \to GL(V)$ of a finite quandle over $\mathbb{C}$ is unitary for some inner product if and only if every element of the image of $\rho$ has determinant of modulus $1$. It follows that any irreducible representation of a finite quandle $Q$ over $\mathbb{C}$ can be twisted by a quandle character to obtain a unitary irreducible representation. We also prove that the enveloping group $G(Q)$, of a finite quandle $Q$, admit a faithfull finite dimensional unitary representation over $\mathbb{C}$ and that the irreducible representations of a finite quandle $Q$ over $\mathbb{C}$ are $1$-dimensional if and only if $G(Q)$ is abelian. Finaly, we determine the irreducible representations over $\mathbb{C}$ of a family of finite quandles.
Read the full abstract
Analysis of PDEs
Mean Field Games in Hilbert Spaces with Degenerate Diffusion: A Viscosity Solution Approach
We study a degenerate second order mean field game (MFG) system in a Hilbert space $H$ which couples a Fokker–Planck equation describing the evolution of probability measures on $H$ with a Hamilton–Jacobi–Bellman (HJB) equation for the value function. Our main result establishes existence and uniqueness of solutions to this coupled system. Solutions of the HJB equation are interpreted in the viscosity sense. For existence, we extend the classical fixed-point approach based on Tikhonov's theorem to our setting. A central difficulty in this approach is proving uniqueness for the corresponding linear degenerate Fokker–Planck equation. To address this issue, we introduce a class of suitable adjoint equations and employ viscosity solution techniques to construct sufficiently regular solutions. Uniqueness for the full MFG system is then obtained via an adaptation of the Lasry–Lions monotonicity method.
Read the full abstract
Number Theory
A connection between low-lying zeros and central values of $L$-functions
We discuss the relation between statistics on low-lying zeros of $L$-functions and distribution of the associated central values. More precisely, we deduce explicit conditional lower bounds toward the Keating-Snaith conjecture (on the distribution of central values of families of $L$-functions) from partial results toward the Rudnick-Sarnak density conjecture (on the one-level density for the low-lying zeros of these $L$-functions). We show in fact that the same crucial ingredient occurs in the classical approaches for proving both results, providing the connection. We precisely determine the relation between the type of symmetry of the family, the allowed Fourier support in its distributional statement, and the quality of the lower bounds obtained.
Read the full abstract
Combinatorics
Majorization Inequalities from Logarithmic Convexity
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Baudhāyana's Śulbasūtra and Euclid's Elements in the first millenium BCE, through classical results of Newton, Muirhead and Gantmacher, to more recent extensions to Schur polynomials and zonal spherical functions. These have been established case by case, with no unified approach. Although it is known that majorization inequalities follow from symmetry and convexity in the indexing partition, the difficulty of proving convexity in specific cases has left a number of outstanding conjectures inaccessible until now. The key insight of this paper is that log-convexity provides a more versatile tool and a unifying principle. It implies convexity and hence majorization, and it is preserved under multiplication and weighted averaging, making it well suited to inductive arguments in a wide range of settings. Using this idea, we prove new majorization inequalities for Macdonald polynomials, Jack polynomials and Heckman-Opdam hypergeometric functions, unifying existing results and resolving several open conjectures.
Read the full abstract
Rings and Algebras
Expander Evolution Algebras
We introduce expander evolution algebras (EEAs), a class of nonassociative algebras defined over an arbitrary field $\K$ in which the underlying undirected loopless graph of the algebra – in the sense of Kowalski – is an expander graph in the classical sense of Cheeger. Starting from the formal graph definition of Kowalski and the algebraic framework of Tian, we establish a dictionary between combinatorial expansion and algebraic structure: the Cheeger constant of the associated graph governs connectivity, the subalgebra lattice, the growth of the evolution sequence, and – over $\R$ and $\C$ – the spectral gap of the evolution operator. Over a general field $\K$ we prove that EEAs are always connected and simple (as evolution algebras), carry no proper large evolution subalgebras, and that every generator of a symmetric EEA is algebraically persistent. Over $\C$ we obtain the sharp Alon–Boppana lower bound for the second eigenvalue of the evolution operator, leading to the definition of Ramanujan evolution algebras as optimal expanders. We also construct families of EEAs from Cayley graphs of finite groups. We close with open problems.
Read the full abstract
Algebraic Geometry
Notes on Lie derivatives, algebraic D-varieties, and Ax's theorem
We discuss the relationship between Lie derivatives and the linear differential equations on cotangent spaces of algebraic D-varieties at sharp points. We also take the liberty to give an account of Ax's theorem (which may be useful as an entry point to the subject for students).
Optimization and Control
Newton methods beyond Hessian Lipschitz continuity: A nonlinear preconditioning approach
Newton-type methods are typically analyzed under Lipschitz continuity of the Hessian, an assumption that can fail for objectives with higher-order or polynomial growth. We introduce a class of nonlinearly preconditioned Newton methods that apply Newton's root-finding scheme to a transformed optimality mapping, thereby extending recent nonlinear preconditioning ideas from first-order methods to the second-order setting. The resulting methods are naturally analyzed under Lipschitz continuity of a preconditioned Hessian, a condition that significantly relaxes the classical Hessian Lipschitz continuity assumption. Under this generalized smoothness model, we establish local superlinear and quadratic convergence guarantees, and develop a globalization strategy for the nonregularized method despite the fact that the preconditioned Newton direction need not be a descent direction. We further propose a regularized variant for isotropic preconditioners, and show that it attains an $O(\varepsilon^{-3/2})$ iteration complexity. An adaptive version removes the need to know the smoothness constant and allows inexact subproblem solutions while preserving the same complexity order.
Read the full abstract
Rings and Algebras
A completion of reduced commutative rings
A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits nonregular monomorphisms and epimorphisms, lacks amalgamation, and is not equationally axiomatizable. In this paper, we simultaneously repair these defects via a canonical completion in which all monomorphisms become regular. This completion is obtained by adjoining weak inverses and weak prime roots, turning the class of reduced commutative rings into a discriminator variety. As a consequence, we obtain an explicit description of dominions in every class of reduced commutative rings containing all fields. This description is strikingly simple compared to that of dominions in the category of all commutative rings, as reflected in the Isbell-Mazet-Silver Zigzag Theorem.
Read the full abstract
Optimization and Control
Multiconic Optimization for Symmetric Cones and Hyperbolic Coupling
We develop a new interior-point algorithm for solving multiconic optimization problems using the parabolic target space approach. The feasible cone in these problems is composed as a direct product of many small-dimensional cones. Our approach is based on a new concept, called the hyperbolic coupling. This provides a new framework that has an advantage of interdependent pairs of primal-dual variables. In this way, their behaviour is much more controllable. We justify all main steps in the complexity analysis of the algorithm and prove that the overall complexity of solving this type of large-scale nonlinear problems by our algorithm is comparable with the best known complexity for solving linear programming problems of the same dimension.