Optimization and Control
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 10 March
The structure of maximal faces of the cone of completely positive matrices is still not well understood in higher dimensions, mainly due to the lack of a general characterization of extreme exposed rays of the copositive cone beyond small matrix orders. This paper contributes to the study of maximal faces of the cone of completely positive matrices by establishing sharper bounds on their dimensions than those currently available. For every odd dimension $n$, we prove that the exact lower bound on the dimensions of maximal faces of the cone of $n \times n$ completely positive matrices equals $n$. For even dimensions $n \geq 8$, we derive a new upper estimate for this lower bound and show that it lies between $n$ and $n+3$. These results substantially refine the previously known bounds.
Statistics Theory
On the last time and the number of times an estimator is more than epsilon from its target value
Suppose $\widehat\theta_n$ is a strongly consistent estimator for $\theta_0$ in some i.i.d. situation. Let $N_\varepsilon$ and $Q_\varepsilon$ be respectively the last $n$ and the total number of $n$ for which $\widehat\theta_n$ is at least $\varepsilon$ away from $\theta_0$. The limit distributions for ${\varepsilon}^2 N_\varepsilon$ and ${\varepsilon}^2 Q_\varepsilon$ as $\varepsilon$ goes to zero are obtained under natural and weak conditions. The theory covers both parametric and nonparametric cases, multi-dimensional parameters, and general distance functions. Our results are of probabilistic interest, and, on the statistical side, suggest ways in which competing estimators can be compared. In particular several new optimality properties for the maximum likelihood estimator sequence in parametric families are established. Another use of our results is ways of constructing sequential fixed-volume or shrinking-volume confidence sets, as well as sequential tests with power 1. The paper also includes limit distribution results for the last $n$ and the number of $n$ for which the supremum distance $\|F_n-F\|\ge\varepsilon$, where $F_n$ is the empirical distribution function. Yet other results are reached for $\varepsilon^{5/2} N_\varepsilon$ and $\varepsilon^{5/2} Q_\varepsilon$ in the context of nonparametric density estimation, referring to the last time and the number of times where $|f_n(x) f(x)|\ge\varepsilon$. Finally it is shown that our results extend to several non-i.i.d. situations.
Read the full abstract
Functional Analysis
Convex body domination for the commutator of vector valued operators with multiple matrix-valued symbols
We provide convex body domination results for the generalized vector-valued commutator of those operators that admit specific forms of convex body domination themselves. We also prove some strong type estimates and other consequences of these results, and we study the BMO spaces that appear naturally in this context.
Read the full abstract
Algebraic Topology
Fractured Structures in Condensed Mathematics
We construct a fractured structure, in the sense of Lurie, on the $\infty$-topos of condensed anima. This fractured structure allows us to better comprehend various properties of condensed anima - we use it to exhibit an explicit collection of jointly conservative points for condensed anima. To rule out further candidates for fractured structures, we analyze limits in the category of extremally disconnected spaces. In particular, we show that it does not admit all fibers, answering a question from Clausen.
Read the full abstract
Combinatorics
Magic labelling enumeration on pseudo-line graphs and pseudo-cycle graphs
Stanley's theorem establishes that for any finite graph $G$, the number $h_G(s)$ of magic labelings with magic sum $s$ can be expressed as a sum of two polynomials in $s$. However, determining the precise form of $h_G(s)$ is generally challenging. This paper aims to compute $h_G(s)$ and its generating function for pseudo-line graphs and pseudo-cycle graphs, thereby extending the earlier work of Bóna et al.\cite{Bona-1,Bona}.
Read the full abstract
Analysis of PDEs
Asymptotic behavior of the solution with positive temperature in nonlinear 3D thermoelasticity
In this paper, we study a hyperbolic-parabolic coupled system arising in nonlinear three-dimensional thermoelasticity. We establish the global well-posedness and asymptotic behavior of solutions. Our main result shows that, a thermoelastic body asymptotically converges to an equilibrium state with a uniform temperature distribution for every initial data, determined by energy conservation. The proof of the global well-posedness is divided into some steps. To begin with, we introduce an approximate problem and derive its solvability. Next, we establish a time-independent upper bound for the temperature via Moser iteration technique. Together with an estimate of gradient of entropy, we use a functional involving the Fisher information of the temperature, which enables us to handle a delicate Gronwall-type inequality, to obtain required estimates of the higher-order derivatives. Further, we prove the strict positivity of temperature by applying Moser iteration again on the negative part of the logarithm of the temperature, followed by a uniqueness argument for the weak solution. Finally, we define a dynamical system on a proper functional phase space and analyze the $\omega$-limit set for every initial data. This work provides a complete proof of the global well-posedness and the long-time behavior in the nonlinear three-dimensional thermoelasticity system.
Read the full abstract
Statistics Theory
Inhomogeneous Submatrix Detection
In this paper, we study the problem of detecting multiple hidden submatrices in a large Gaussian random matrix when the planted signal is inhomogeneous across entries. Under the null hypothesis, the observed matrix has independent and identically distributed standard normal entries. Under the alternative, there exist several planted submatrices whose entries deviate from the background in one of two ways: in the mean-shift model, planted entries (templates) have nonzero and possibly varying means; in the variance-shift model, planted entries have inflated and possibly varying variances. We consider two placement regimes for the planted submatrices. In the first, the row and column index sets are arbitrary. Motivated by scientific applications, in the second regime the row and column indices are restricted to be consecutive. For both alternatives and both placement regimes, we analyze the statistical limits of detection by proving information-theoretic lower bounds and by designing algorithms that match these bounds up to logarithmic factors, for a wide family of templates.
Read the full abstract
Differential Geometry
Lorentz–Epstein surfaces and a Liouville action for positive curves
We investigate and define in this paper, in the context of the correspondence between anti-de Sitter $3$-space and $(1,1)$-conformal metrics, the analogs of $\cW$-volume, Epstein surfaces, and Liouville action. These notions were well-studied in the correspondence between $3d$-hyperbolic manifolds and $2d$ conformal metrics. We apply our construction to positive curves in flag manifolds equipped with a positive structure to obtain invariants of these curves that are finite in the case of piecewise circles.
Read the full abstract
Analysis of PDEs
Large-data solutions in multi-dimensional thermoviscoelasticity with temperature-dependent viscosities
This paper investigates a quasilinear parabolic system arising in thermoviscoelasticity of Kelvin-Voigt type with temperature-dependent viscosity and coupled terms. The system, given by \begin{equation*} \begin{cases} u_{tt}=\nabla\cdot\big(\gamma(\Theta)\nabla u_t\big)+a\Delta u-\nabla\cdot f(\Theta), & x \in \Omega,\ t > 0, \Theta_t=\Delta\Theta+\gamma(\Theta)|\nabla u_t|^2-f(\Theta)\nabla u_t, & x \in \Omega,\ t > 0, u=0,\quad\frac{\partial\Theta}{\partial\nu}=0, & x \in \partial\Omega,\ t > 0, u(x,0)=u_0(x),\; u_t(x,0)=u_{0t}(x),\;\Theta(x,0)=\Theta_0(x), & x \in \Omega, \end{cases} \end{equation*} models heat generation by acoustic waves in solid materials and can be derived as a scalar simplification of more complex piezoelectric-thermoviscoelastic model. Under the assumptions that $u_0\in H_0^1(\Omega)$, $u_{0t}\in L^2(\Omega)$, $\Theta_0\in L^1(\Omega)$ with $\Theta_0\geqslant0$ a.e.~in $\Omega$, that $\gamma,f\in C^0([0,\infty))$ satisfy $f(0)=0$, and that there exist constants $k_\gamma,K_\gamma,K_f>0$ and $0<\alpha<\frac{N+2}{2N}$ such that $$k_\gamma\leqslant\gamma(\xi)\leqslant K_\gamma\quad\text{and}\quad |f(\xi)|\leqslant K_f(1+\xi)^\alpha\qquad\forall~\xi\geqslant0,$$ we establish the global existence of weak solutions for arbitrarily large initial data in bounded domains $\Omega\subset\mathbb{R}^N$ ($N\geqslant1$). The result extends recent one-dimensional finding \cite{WinklerZAMP} to the multi-dimensional setting without requiring any smallness condition on the data.
Read the full abstract
Dynamical Systems
The extended future cover and desynchronization of sofic shifts
The paper describes a cover of the future cover of a sofic shift which is canonical in the same way as the future cover itself. In some cases the cover is isomorphic to the future cover and in other it is a genuine extension. The extended future cover is then used to introduce and describe the desynchronization of sofic shifts.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Non-invertible symmetries and selection rules for RG flows of coset models
We analyze superselection sectors, non-invertible symmetries and selection rules for RG flows triggered via perturbations of a UV two-dimensional conformal field theory (CFT$_2$). To this end we describe a method whose input is the local data, and whose output is the set of submodels of the modular invariant completions. We explain how this output set provides a classification of superselection sectors (DHR categories and Q-systems) and of topological defect lines, leading to a unified and potentially complete approach to selection rules for RG flows. This method is applied to scenarios in which the UV is a coset or a parafermion model. For these CFT$_2$ we explicitly find all submodels of the diagonal modular invariants. Our results gives selection rules that unify several known facts about such RG flows, while also allowing us to find new aspects.
Read the full abstract
Numerical Analysis · Cross-listed from cs.LG
Memorization capacity of deep ReLU neural networks characterized by width and depth
This paper studies the memorization capacity of deep neural networks with ReLU activation. Specifically, we investigate the minimal size of such networks to memorize any $N$ data points in the unit ball with pairwise separation distance $\delta$ and labels from a finite set of size $C$. Most prior studies characterize the memorization capacity by the number of parameters or neurons. We extend these results by constructing ReLU networks with adjustable width $W$ and depth $L$ satisfying $W^2L^2\log W=\mathcal{O}(N(\log(\delta^{-1})+\log C))$ that can memorize any such dataset. We also establish width-depth lower bounds that depend explicitly on $\delta$ and $C$ for networks capable of memorizing all such datasets. When $\log(\delta^{-1})\asymp\log N$, our construction achieves $W^2L^2\asymp N$ for suitable choices of width and depth. This order is optimal if $\log C\asymp\log N$, and optimal up to logarithmic factors if $\log C=o(\log N)$.
Read the full abstract
Information Theory
Randomized Distributed Function Computation (RDFC): Ultra-Efficient Semantic Communication Applications to Privacy
We establish the randomized distributed function computation (RDFC) framework, in which a sender transmits just enough information for a receiver to generate a randomized function of the input data. Describing RDFC as a form of semantic communication, which can be essentially seen as a generalized remote-source-coding problem, we show that security and privacy constraints naturally fit this model, as they generally require a randomization step. Using strong coordination metrics, we ensure (local differential) privacy for every input sequence and prove that such guarantees can be met even when no common randomness is shared between the transmitter and receiver. This work provides lower bounds on Wyner's common information (WCI), which is the communication cost when common randomness is absent, and proposes numerical techniques to evaluate the other corner point of the RDFC rate region for continuous-alphabet random variables with unlimited shared randomness. Experiments illustrate that a sufficient amount of common randomness can reduce the semantic communication rate by up to two orders of magnitude compared to the WCI point, while RDFC without any shared randomness still outperforms lossless transmission by a large margin. A finite blocklength analysis further confirms that the privacy parameter gap between the asymptotic and non-asymptotic RDFC methods closes exponentially fast with input length. Our results position RDFC as an energy-efficient semantic communication strategy for privacy-aware distributed computation systems.
Read the full abstract
Combinatorics
On Some Bi-Cayley Graphs over Cyclic Groups of Order $p^2 q^2$ and Related Extensions
We investigate structural and combinatorial properties of Bi-Cayley graphs defined over cyclic groups of order $p^2q^2$, where $p$ and $q$ are distinct primes. We begin by describing their fundamental group-theoretic underpinnings. The main focus is on analyzing their connectivity, girth, clique number, chromatic number, diameter, and independence number. It is shown that these Bi-Cayley graphs are connected, biregular with explicitly determined degrees, and possess girth three. Furthermore, we prove that their diameter is equal to five. We further extend several results to Bi-Cayley graphs over arbitrary finite groups under suitable restrictions on the connecting set, with particular emphasis on the case where the connecting set consists of all its involutions. These results clarify structural similarities and differences between Cayley graphs and their Bi-Cayley generalizations.
Read the full abstract
Combinatorics
A complex Hadamard matrix of order 94
In this paper we modify a fundamental block construction of Kharaghani and Seberry and show how to use certain circulant $\{-1,1\}$-matrices of odd order $p$ to construct a complex Hadamard matrix of order $2p$. In particular, for $p=47$ we use computer-aided methods to discover the necessary circulant matrices, and consequently give a construction of a complex Hadamard matrix of order $94$ for the first time.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
An Optimal Control Approach To Transformer Training
In this paper, we develop a rigorous optimal control-theoretic approach to Transformer training that respects key structural constraints such as (i) realized-input-independence during execution, (ii) the ensemble control nature of the problem, and (iii) positional dependence. We model the Transformer architecture as a discrete-time controlled particle system with shared actions, exhibiting noise-free controlled McKean–Vlasov dynamics, and we show that lifting the dynamics to probability measures produces a fully-observed Markov decision process (MDP). Positional encodings are incorporated into the state space to preserve the sequence order under lifting. Using the dynamic programming principle, we establish the existence of globally optimal policies under mild assumptions of compactness. We further prove that closed-loop policies in the lifted problem is equivalent to an initial-distribution dependent open-loop policy, which are realized-input-independent and compatible with standard Transformer training. To train a Transformer, we propose a triply quantized training procedure for the lifted MDP by quantizing the state space, the space of probability measures, and the action space, and show that any optimal policy for the triply quantized model is near-optimal for the original training problem. Finally, we establish stability and empirical consistency properties of the lifted model by showing that the value function is continuous with respect to the perturbations of the initial empirical measures and convergence of policies as the data size increases. This approach provides a globally optimal and robust theoretical alternative to gradient-based training without requiring smoothness or convexity.
Read the full abstract
Logic
Ignorance with(out) Grasping
In this work, we argue that ignorance can be inherently understood as a hyperintensional notion. When faced with two logically or necessarily equivalent propositions, an agent may be ignorant of one while not of the other. To capture formally this intuition, we employ a topic-sensitive semantics, enabling the modeling of an agent's attitude toward the content of a proposition. Within this framework, we reevaluate three existing logical systems, usually characterized by standard Kripke semantics, to account for three forms of ignorance: ignorance whether, ignorance as unknown truth, and disbelieving ignorance. For each form, we present a sound and complete system. To highlight the advantage of this approach, we apply it to address the problem of logical omniscience rephrased in terms of ignorance. The resulting framework considers an agent's capacity to grasp the content of a proposition, bridging the gap between standard relational settings for ignorance representation and natural intuitions about the role of content in forming one's ignorance.
Read the full abstract
Combinatorics
The perfect divisibility and chromatic number of some odd hole-free graphs
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ with at least one edge admits a partition of $V(H)$ into sets $A$ and $B$ such that $H[A]$ is perfect and $\omega(H[B])<\omega(H)$. $G$ is short-holed if every hole in $G$ has length 4. A hammer is the graph obtained by identifying one vertex of a $K_3$ and one end vertex of a $P_3$. In this paper, we prove that (i) (odd hole, hammer, $K_{2,3}$)-free graphs are perfectly divisible, (ii) $\chi(G)\le 4\omega(G)(\omega(G)-1)$ if $G$ is short-holed and $(K_1+C_4)$-free, (iii) $\chi(G)\le 2\omega(G)-1$ if $G$ is short-holed and $(K_1\cup K_3)$-free, and (iv) $\chi(G)\le 16\omega(G)-24$ if $G$ is short-holed and $(K_1+(K_1\cup K_3))$-free.
Read the full abstract
Optimization and Control
ADMM-based Bilevel Descent Aggregation Algorithm for Sparse Hyperparameter Selection
It is widely acknowledged that hyperparameter selection plays a critical role in the effectiveness of sparse optimization problems. The bilevel optimization provides a robust framework for addressing this issue, but these existing methods depend heavily on the lower-level singleton (LLS) assumption, which greatly limits their practical applicabilities. To tackle this technical challenge, this paper focus on a particular type of nonsmooth convex sparse optimization problem and presents a new bilevel optimization framework. This framework effectively integrates the alternating direction method of multipliers (ADMM) with a bilevel descent aggregation (BDA) algorithm. Specifically, it employs ADMM to efficiently address the lower-level problem and uses BDA to explore the hyperparameter space, thereby integrating both the upper and lower-level problems. It is important to emphasize that a key contribution of this paper lies in the presentation of a novel convergence analysis. The analysis illustrates that the proposed ADMM-BDA algorithm achieves global convergence under significantly relaxed conditions, thereby departing from the LLS assumption that are often required in the literature. We conduct a series of numerical experiments utilizing synthetic and real-world data, and do performance comparisions against some state-of-the-art algorithms. The results indicates that ADMM-BDA exhibits superior effectiveness and robustness for solving bilevel programming problems, especially when the lower-level problem is an elastic-net penalized statistics problem.
Read the full abstract
Complex Variables
rank-3 generalized Clifford manifold and its twistor space
We introduce the notion of a rank-3 generalized Clifford manifold, defined by a triple of generalized complex structures satisfying Clifford-type relations. We show that every such structure canonically induces a generalized hypercomplex structure. We further describe a natural Spin(3)-action by Clifford rotations, which produces an $S^2 \times S^2$-family of generalized complex structures. The corresponding twistor space is then constructed, and we prove that the induced almost generalized complex structure is integrable. In contrast to the standard pure-spinor approach, the integrability of the twistor-space structure is established entirely in terms of the generalized Nijenhuis tensor. We further prove that this Clifford-to-twistor construction is compatible with T-duality, in the sense that T-duality preserves the rank-3 Clifford triple, the induced structures, and the associated Spin(3)-rotated family.
Read the full abstract
Dynamical Systems · Cross-listed from econ.TH
Sampling logit equilibrium and endogenous payoff distortion
We introduce sampling logit equilibrium (SLE) for population games in which agents infer payoffs from a finite sample of $k$ opponents' actions and respond according to a logit choice rule. We find that sampling error systematically distorts incentives. Actions whose inferred payoffs are relatively more variable earn a variance premium, while nonlinear payoffs generate a curvature premium through Jensen effects. For large samples, an SLE is approximated by a logit equilibrium of a virtual game whose payoffs include these premiums. For linear games, when sampling error and logit noise vanish at comparable rates, their interaction around completely mixed Nash equilibria is reduces to a Gaussian–Gumbel limiting model. We also establish exact finite-$k$ uniqueness and stability results. In particular, in two-action coordination games with a $1/k$-dominant action, the unique SLE converges to the risk-dominant equilibrium as logit noise vanishes.
Read the full abstract
Quantum Algebra
Coproduct of modified Drinfeld-Cartan series for Yangians and quantum affine algebras in type A
We give explicit formulas for the coproducts of modified Drinfeld-Cartan generating series for the Yangian in type $A$ and for the quantum affine algebras in the particular type $A_2$. As an auxiliary result of the latter, we give an explicit presentation of positive prefundamental representations of the quantum affine algebra in the particular type $A_2$
Read the full abstract
Mathematical Physics
Pseudo-Riemannian Lie algebras with coisotropic ideals and integrating the Laplace-Beltrami equation on Lie groups
We identify a class of left-invariant pseudo-Riemannian metrics on Lie groups for which the Laplace-Beltrami equation reduces to a first-order PDE and admits exact solutions. The defining condition is the existence of a commutative ideal $\mathfrak{h}$ in the Lie algebra $\mathfrak{g}$ whose orthogonal complement satisfies $\mathfrak{h}^\perp\subseteq\mathfrak{h}$. Using the noncommutative integration method based on the orbit method and generalized Fourier transforms, we reduce the Laplace–Beltrami equation to a first-order linear PDE, which can then be integrated explicitly. The symmetry of the reduced equation gives rise, via the inverse transform, to nonlocal symmetry operators for the original equation. These operators are generically integro-differential, contrasting with the polynomial symmetries appearing in previously studied classes. The method is illustrated by two examples: the Heisenberg group $\mathrm{H}_3(\mathbb{R})$ with a Lorentzian metric and a four-dimensional non-unimodular group with a metric of signature $(2,2)$. In the latter, classical separation of variables is not directly applicable, yet the noncommutative approach yields explicit solutions and reveals the predicted nonlocal symmetry.
Read the full abstract
Optimization and Control
One-Way Thermo-Mechanical Coupled System Identification Using Displacement and Temperature Measurements
Structural system identification in the presence of thermal loads is challenging, as unmeasured or poorly modeled thermal effects can mask or mimic damage, leading to unreliable conclusions. This work presents an optimization-driven, adjoint-based high-fidelity system identification framework for localizing structural weakness and recovering the temperature field in one-way thermo-mechanical coupled structures. The methodology builds upon a standard optimization formulation that minimizes weighted discrepancies between simulated responses and measured data from a sparse displacement and temperature sensor network. To account for thermal effects, two strategies are proposed: a monolithic approach, which simultaneously identifies Young's modulus and temperature distributions, and a partitioned approach, which iteratively couples two inexact sub-problems through a Gauss-Seidel type fixed-point scheme. The proposed approaches are evaluated using two numerical examples – a Plate With a Hole and a Footbridge model – under linearly varying and localized thermal fields, and for different sensor layouts. Both approaches successfully recover the Young's modulus and temperature distributions, even when sensor placement does not fully capture the underlying thermal trends. Compared with a constant-temperature assumption and interpolation of the temperature field from sensor data, the proposed approach achieves the most accurate damage localization and temperature reconstruction. The largest gains occur when localized thermal features are poorly sampled by sensors, where interpolation and constant-temperature assumptions underperform. Furthermore, results show that the location of the temperature sensors is as influential as the number of sensors: well-placed sensors substantially improve identification, while additional sensors that miss critical thermal features provide limited benefit.
Read the full abstract
Optimization and Control
A Unifying Primal-Dual Proximal Framework for Distributed Nonconvex Optimization
We consider distributed nonconvex optimization over an undirected network, where each node privately possesses its local objective and communicates exclusively with its neighboring nodes, striving to collectively achieve a common optimal solution. To handle the nonconvexity of the objective, we linearize the augmented Lagrangian function and introduce a time-varying proximal term. This approach leads to a Unifying Primal-Dual Proximal (UPP) framework that unifies a variety of existing first-order and second-order methods. Building on this framework, we further derive two specialized realizations with different communication strategies, namely UPP-MC and UPP-SC. We prove that both UPP-MC and UPP-SC achieve stationary solutions for nonconvex smooth problems at a sublinear rate. Furthermore, under the additional Polyak-Łojasiewics (P-Ł) condition, UPP-MC is linearly convergent to the global optimum. These convergence results provide new or improved guarantees for many existing methods that can be viewed as specializations of UPP-MC or UPP-SC. To further optimize the mixing process, we incorporate Chebyshev acceleration into UPP-SC, resulting in UPP-SC-OPT, which attains an optimal communication complexity bound. Extensive experiments across diverse network topologies demonstrate that our proposed algorithms outperform state-of-the-art methods in both convergence speed and communication efficiency.
Read the full abstract
Mathematical Physics
Weak-Coupling Limit of the Lattice Nonlinear Schrödinger Integral Equation
We study the ground-state integral equation of the quantum lattice nonlinear Schrödinger model, equivalently the isotropic Heisenberg XXX chain at spin $s = -1$, whose solution is the root density on a Fermi interval. In the weak-coupling limit the equation is doubly singular: the driving term and the kernel collapse onto delta functions, and the solution separates into three regions on three scales, an inner peak, the bulk of the Fermi sea, and a boundary layer at the band edge. We treat the singular structure probabilistically. We identify both the kernel and the driving term as the Cauchy density, in such a way that the root density corresponds to the Green kernel of a Cauchy random walk killed on leaving the Fermi sea. Consequently, the three regions are then the potential kernel, the interval exit law, and the ascending-ladder renewal function of that walk. This construction determines the logarithmic growth of the central density and the digamma form of the inner profile, whose Fourier-space solution is the Bose–Einstein distribution. In the bulk, the density approaches the Green function of the half-Laplacian, while the Wiener–Hopf factorisation fixes the edge behaviour and identifies a candidate scale for non-perturbative corrections. The analysis also yields closed asymptotic expressions for the total density and the ground-state energy. Nyström solutions over a broad range of Fermi rapidities confirm the three-region asymptotic description.
Read the full abstract
Combinatorics
Induced subdivisions of $K_{d+1}$ in graphs of high girth
In this paper, we show that for all $k\geq 10^8$, every graph with minimum degree $k$ and girth at least $10^8$ contains an induced subdivision of a $K_{k+1}$. This answers a problem asked by Kühn and Osthus (originally attributed to Shi).
Combinatorics
Flats and hyperplane arrangements for matroids with coefficients
Based on the notion of vectors and linear subspaces for a matroid, we develop a theory of flats and hyperplane arrangements for T-matroids, where T is a tract. This leads to several cryptomorphic descriptions of T-matroids: in terms of its lattice of T-flats, as a hyperplane arrangement over T, as point-line arrangements in projective space over T and as a quiver representation over T. We examplify these notions in the case of tropical linear spaces, a.k.a. valuated matroids.
Read the full abstract
Analysis of PDEs
Quantitative maximal $L^2$-regularity for viscous Hamilton-Jacobi PDEs in 2D and Mean Field Games
We discuss quantitative Calderón-Zygmund estimates in $W^{2,2}$ for 2D viscous Hamilton-Jacobi equations with natural growth in the gradient. We apply the result to obtain the existence of classical solutions for stationary second order Mean Field Games systems in 2D with (defocusing) coupling behaving like $m^\alpha$ for any $\alpha>0$. We also survey on the known results for the regularity of viscous Hamilton-Jacobi equations and second order Mean Field Games and list several open problems.
Read the full abstract
Combinatorics
Topological indices on self-similar graphs generated by groups
In this paper, we determine precise formulas for the diameters, the number of perfect matchings, and the Tutte polynomials for an infinite family of finite graphs, namely the Schreier graphs of tree automaton groups, also called tree graph automata. This enables us to easily find the number of spanning trees, spanning forests, and an explicit form for the chromatic polynomials. In the second part of the paper, we provide the precise values for the Wiener and Szeged index of any tree graph automaton.