Combinatorics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Friday 27 February
We show that every connected graph $G$ has a tree decomposition indexed by a tree $T$ such that $T$ is a subgraph of $G$ and the width of the tree decomposition is bounded from above by a function of the pathwidth of $G$. This answers a question of Blanco, Cook, Hatzel, Hilaire, Illingworth, and McCarty (2024), who proved that it is not possible to have such a tree decomposition whose width is bounded by a function of the treewidth of $G$. The proof relies on Simon's Factorization Theorem for finite semigroups, a tool that has already been applied successfully in various areas of graph theory and combinatorics in recent years. Our application is particularly simple and can serve as a good introduction to this technique.
Optimization and Control · Cross-listed from eess.SY
Virtual Constraint for a Quadrotor UAV Enforcing a Body-Axis Pointing Direction
We propose a geometric control framework on $SE(3)$ for quadrotors that enforces pointing-driven missions without completing a full attitude reference. The mission is encoded through virtual constraints defining a task manifold and an associated set of admissible velocities, and invariance is achieved by a feedback law obtained from a linear system in selected inputs. Under a transversality condition with the effective actuation distribution, the invariance-enforcing input is uniquely defined, yielding a constructive control law and, for relevant tasks, closed-form expressions. We further derive a local off-manifold stabilization extension. As a case study, we lock a body axis to a prescribed line-of-sight direction while maintaining fixed altitude.
Read the full abstract
Optimization and Control · Cross-listed from eess.SY
Observer-Based Estimation and Hydrostatic Inertia Modeling for Cooperative Transport of Variable-Inertia Loads with Quadrotors
We address load-parameter estimation in cooperative aerial transport with time-varying mass and inertia, as in fluid-carrying payloads. Using an intrinsic manifold model of the multi-quadrotor-load dynamics, we combine a geometric tracking controller with an observer for parameter identification. We estimate mass from measurable kinematics and commanded forces, and handle variable inertia via an inertia surrogate that reproduces the load's rotational dynamics for control and state propagation. Instead of real-time identification of the true inertia tensor, driven by high-dimensional internal fluid motion, we leverage known tank geometry and fluid-mechanical structure to pre-compute inertia tensors and update them through a lookup table indexed by fill level and attitude. The surrogate is justified via the incompressible Navier-Stokes equations in the translating/rotating load frame: when effective forcing is gravity-dominated (i.e., translational/rotational accelerations and especially jerk are limited), the fluid approaches hydrostatic equilibrium and the free surface is well approximated by a plane orthogonal to the body-frame gravity direction.
Read the full abstract
Probability
On Hamiltonian Monte Carlo for Gaussian Random Variables with Random Hamiltonians
We study a family of (multivariate-)Gaussian Hamiltonian Monte Carlo (GHMC) operators and prove that the family of Gaussian distributions and their mixtures are invariant under such operators. Furthermore, each such operator is a contraction on the space of parameters and an explicit formulae are derived. These results then enable us to analyze the dynamics and convergences of independent and identically distributed random sequences of such operators.
Read the full abstract
Information Theory
Finite Block Length Rate-Distortion Theory for the Bernoulli Source with Hamming Distortion: A Tutorial
Lossy data compression lies at the heart of modern communication and storage systems. Shannon's rate-distortion theory provides the fundamental limit on how much a source can be compressed at a given fidelity, but it assumes infinitely long block lengths that are never realized in practice. We present a self-contained tutorial on rate-distortion theory for the simplest non-trivial source: a Bernoulli$(p)$ sequence with Hamming distortion. We derive the classical rate-distortion function $RD = Hp - HD$ from first principles, illustrate its computation via the Blahut-Arimoto algorithm, and then develop the finite block length refinements that characterize how the minimum achievable rate approaches the Shannon limit as the block length $n$ grows. The central quantity in this refinement is the rate-distortion dispersion $V(D)$, which governs the $O(1/\sqrt{n})$ penalty for operating at finite block lengths. We accompany all theoretical developments with numerical examples and figures generated by accompanying Python scripts.
Read the full abstract
Number Theory
Diamond Determinants and Somos Sequences
A Somos sequence of order $n$ is defined by a quadratic recurrence of width $n + 1$. Some of the remarkable properties of these sequences for small $n$ are tied to certain matrices built out of them being of finite rank. We give an elementary proof of the finite-rank property for order $6$, previously only established with the help of advanced machinery from the theory of hyperelliptic functions. Our method also yields a new finite-rank property for the Somos sequences of order $7$. In addition, we conjecture generalisations of these results to higher orders, for the subclass of Gale-Robinson sequences.
Read the full abstract
Information Theory
Weighted Unequal Error Protection over a Rayleigh Fading Channel
We study a variant of unequal error protection in channel coding, where the message bit string is divided into a finite number of blocks and the maximization objective is a weighted sum of per-block decoding success probabilities. The channel model is quasi-static Rayleigh fading with channel state information available to the receiver but unavailable to the transmitter. We analyze the asymptotic and finite blocklength performance of two achievability schemes, one based on power-domain superposition (PDS) and another based on orthogonal resource allocation (ORA), also known as time-sharing. Upper bounds on the optimal number of blocks to transmit are derived. Algorithms to compute the optimal power and time splits for the two schemes are given. Simplified algorithms to compute locally optimal power and time splits are also given. Our results show that PDS outperforms ORA, but the performance differential is less than 2% in both the asymptotic and finite blocklength regimes (Figures 4 - 6). For both PDS and ORA, numerical results also upper bound the gap between the asymptotic and finite blocklength performance by approximately 10% for n = 1000 and 3% for n = 5000 (Figures 7 - 10).
Read the full abstract
Statistics Theory
Asymptotic theory for multiple samples with flexible random membership
A statistic can be a function of multiple samples. There is little existing work on asymptotic theory for such statistics when group membership is random. We propose a flexible framework that can handle both deterministic and random membership. We prove some asymptotic properties and apply the framework to the stratified sampling context.
Read the full abstract
Differential Geometry
Finite-energy equivariant minimal immersions in $\mathbb{CH}^2$ with fixed-lift proper cusp ends
Let $\Sigma_0\,=\,\Sigma\setminus\{z_1,\,\ldots,\, z_n\}$ be a finite-type hyperbolic Riemann surface, with its universal cover being identified with $\mathbb H$. We prove that a finite-energy equivariant harmonic map \[ f\colon\mathbb H\;\longrightarrow\;\mathbb{CH}^2 \] is fixed-lift proper at every puncture — that is, its restriction to a fixed lifted cusp eventually leaves every compact subset of the target — if and only if its peripheral holonomy is parabolic. For conformal immersions, parabolic holonomy at every puncture also implies completeness of the descended induced metric. We further show that if a polystable parabolic $\mathrm{PU}(2,\,1)$-Higgs bundle has local data $\alpha_p\,=\,s_p\,=\,0$ and $Y_p\,\ne\,0$, and if the associated harmonic map is weakly conformal, then the corresponding end is unbranched, complete, and has finite energy. We also show that, for mixed conformal data, stability is equivalent to two explicit parabolic slope inequalities. Finally, for every $n\;\ge\;5$, we construct explicit Higgs data producing mixed unbranched $\mathbb{CH}^2$-$n$-noids with nonidentity unipotent peripheral monodromy, finite total energy, complete induced metric, and fixed-lift proper ends.
Read the full abstract
Complex Variables
Hole Phenomenon of Gaussian Analytic Functions with Power-exponential Weights
We establish the hole phenomenon for the Gaussian analytic function \[ F_{\beta}(z)=\sum_{n=0}^{\infty}\frac{\xi_{n}}{\sqrt{\Gamma\bigl(\frac{2}{\beta}(n+1)\bigr)}}\,z^{n}, \] associated with the power-exponential weight $e^{-|z|^{\beta}}$ on $\mathbb{C}$, where $\beta>0$. Under the condition that $F_{\beta}(z)$ has no zeros in $D(0,r)$, the scaled zero counting measure converges to a limiting measure $\mu_{0}^{\beta}$ vaguely in distribution. This limit exhibits a forbidden region \[ \bigl\{1<|z|<e^{1/\beta}\bigr\}, \] which zeros asymptotically avoid. This generalizes the remarkable discovery of Ghosh and Nishry for the Gaussian entire function (the case $\beta=2$), who first revealed this striking conditional convergence and the emergence of a hole. Our analysis extends their phenomenon to the entire family of power-exponential weights.
Read the full abstract
Probability
Almost sure CLT for hyperbolic Anderson model with Lévy colored noise
In this note, we prove the Almost Sure Central Limit Theorem (ASCLT) for the spatial integral of the solution of the hyperbolic Anderson model driven by the Lévy colored noise introduced in Balan (2015). For this, we use the central limit theorem for the normalized spatial integral, and an estimate for the Malliavin derivative of the solution, both derived in the recent preprint Balan and Stephenson (2026). We assume that the spatial correlation kernel of the noise is either integrable, or it is given by the Riesz kernel.
Read the full abstract
Complex Variables
Endpoint Estimates for Bergman Commutators and New Characterizations of the Bloch Space and $H^\infty$
We prove an $\LlogL $-type distributional inequality for the commutator of the Bergman projection with a conjugate Bloch symbol function on the unit ball. Such an inequality can be seen as a Bergman version of a result due to C. Pérez for real-variable Calderón-Zygmund operators and BMO functions. We also prove that this inequality characterizes membership of analytic functions in the Bloch space and is further equivalent to a kind of modified restricted weak-type estimate, where one only tests over characteristic functions of sets comparable to Bergman balls. We also show our estimate is sharp in the sense that there exists a Bloch function $b$ so that the commutator $[\bar{b},P]$ is not weak-type $(1,1)$, and prove $[\bar{b},P]$ with $b$ analytic is weak-type $(1,1)$ if and only if $b \in H^\infty$.
Read the full abstract
Geometric Topology
When loxodromics are pseudo-Anosovs on witnesses
In this paper, we prove that for subgroups acting on admissible multiarc and curve graphs and for the handlebody group acting on the disk graph, the loxodromic elements are exactly those for which some pure power is a pseudo-Anosov on a witness. This generalizes the result of Masur and Minsky that the elements of the mapping class group that act loxodromically on the curve graph are the pseudo-Anosov elements.
Read the full abstract
Information Theory · Cross-listed from cs.CL
Task-Centric Acceleration of Small-Language Models
Small language models (SLMs) have emerged as efficient alternatives to large language models for task-specific applications. However, they are often employed in high-volume, low-latency settings, where efficiency is crucial. We propose TASC, Task-Adaptive Sequence Compression, a framework for SLM acceleration comprising two use-cases: When performing SLM fine-tuning, we propose TASC-ft, which iteratively enriches the tokenizer vocabulary with high-frequency output n-grams and then fine-tunes the model to utilize the expanded vocabulary. Next, we propose an inference-time method, termed TASC-spec. TASC-spec is a lightweight, training-free speculative decoding method that constructs an n-gram draft model from the task's output corpus, mixing task and context n-gram information.TASC-spec avoids any additional training, while bypassing draft-target vocabulary alignment constraints. We demonstrate the effectiveness of both methods across multiple low output-variability generation tasks. Our methods show consistent improvements in inference efficiency while maintaining task performance.
Read the full abstract
Combinatorics
Inversion diameter and 2-edge-colored homomorphisms
In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distance between two orientations G is the minimum number of inversions transforming one into the other. The inversion diameter diam(G) is the maximum such distance over all pairs of orientations of G. Through an equivalent formulation of inversions over 2-edge-colorings of G, we introduce the use of homomorphism-universal 2-edge-colored graphs to obtain bounds on the inversion diameter of various classes of graphs. Our first result upper bounds the inversion diameter by a linear function of the acyclic chromatic number, improving on the previous quadratic dependency. We then consider the inversion diameter of planar graphs, exhibiting a lower bound of 6, as well as new lower and upper bounds for those of a given girth, in particular settling the girth 7 case. We then show that any triangle-free graph G with maximum degree D satisfies diam(G) <= D + log D, making progress on the conjecture of Havet et al. that diam(G) <= D. Finally, we prove a general result about subdivisions: if a graph has inversion diameter k, any of its subdivisions has inversion diameter at most k + log k + 5.
Read the full abstract
Group Theory
Automorphisms and monomorphisms of direct products of virtually solvable minimax groups
This paper studies automorphisms and monomorphisms of direct products $\Gamma=\Gamma_1\times\cdots\times\Gamma_r$ of finitely generated virtually solvable minimax groups, a class containing all virtually polycyclic groups. Under an indecomposability assumption on the $\mathbb Q$-algebraic hulls, we prove that every monomorphism of $\Gamma$ factorizes uniquely as $\varphi=\theta\cdot\zeta$, where $\theta$ sends each factor into a permuted factor with $\mathbb Q$-isomorphic hull and $\zeta$ is central and off-diagonal. Conversely, every such pair defines a monomorphism of $\Gamma$, and $\varphi$ is an automorphism if and only if $\theta$ is. This indecomposability assumption is sharp: we show it cannot be weakened to direct indecomposability of the factors. The proof proceeds in three steps: first by establishing the corresponding central mixing property for finite-dimensional Lie algebras and algebraic Lie algebras, then for connected linear algebraic groups, and finally by transferring these results to minimax groups via $\mathbb Q$-algebraic hulls. This extends the previously known nilpotent case both from automorphisms to monomorphisms and from finitely generated torsion-free nilpotent groups to the broader class of finitely generated virtually solvable minimax groups. As applications, we characterize co-Hopfian direct products and derive formulas for Reidemeister numbers and Reidemeister spectra.
Read the full abstract
Statistics Theory
Hypothesis Testing over Observable Regimes in Singular Models
Hypothesis testing in singular statistical models is often regarded as inherently problematic due to non-identifiability and degeneracy of the Fisher information. We show that the fundamental obstruction to testing in such models is not singularity itself, but the formulation of hypotheses on non-identifiable parameter quantities. Testing is inherently a problem in distribution space: if two hypotheses induce overlapping subsets of the model class, then no uniformly consistent test exists. We formalize this overlap obstruction and show that hypotheses depending on non-identifiable parameter functions necessarily fail in this sense. In contrast, hypotheses formulated over identifiable observables-quantities that are determined by the induced distribution-reduce entirely to classical testing theory. When the corresponding distributional regimes are separated in Hellinger distance, uniformly consistent tests exist and posterior contraction follows from standard testing-based arguments. Near singular boundaries, separation may collapse locally, leading to scale-dependent detectability governed jointly by sample size and distance to the singular stratum. We illustrate these phenomena in Gaussian mixture models and reduced-rank regression, exhibiting both untestable non-identifiable hypotheses and classically testable identifiable ones. The results provide a structural classification of which hypotheses in singular models are statistically meaningful.
Read the full abstract
Number Theory
Newton strata realization for hypersurfaces via explicit p-adic cohomology
Let $X$ be a smooth projective hypersurface over a finite field $k$ of characteristic $p$. We address the problem of practically computing the zeta function $Z(X,T)$ of $X$ (equivalently, the point counts $\#X(\mathbb{F}_q)$, where $q = p^n$), and we focus on the case when $7 \leq p < 50$. We use the theoretical framework of the variant of Kedlaya's algorithm in arXiv:archive/0601508, and we use the technique of controlled reduction as described in Costa's Thesis. We define an optimization problem that abstracts the key bottleneck in the implementation of controlled reduction. An algorithm that solves this problem is called a reduction policy. We present three reduction policies with different advantages and disadvantages. We also present a high-performance implementation of controlled reduction that contains GPU-optimized linear algebra code and a data structure for linear recurrences that the authors hope can be used to study further reduction policies. Our algorithms get state-of-the-art performance in many cases; for example, we beat arXiv:1402.6758 or arXiv:2203.02070 on many examples of quintic curves, while also being able to compute zeta functions of cubic fourfolds when $p = 7$. We also have the first (to our knowledge) systematic computations of zeta functions of quintic surfaces. We use our implementation to deduce many new explicit examples of varieties with specified Newton polygons, including a cubic fourfold which are neither ordinary nor supersingular, quartic K3 surfaces of various Artin-Mazur heights, and quintic surfaces of all possible domino numbers.
Read the full abstract
Algebraic Geometry
Strong monodromy conjecture for defining polynomials of projective hypersurfaces having only weighted homogeneous isolated singularities
Let $Z\subset{\bf P}^{n-1}$ be a hypersurface such that the associated reduced hypersurface $Z_{\rm red}$ has only weighted homogeneous isolated singularities. In the case $Z$ is a reduced curve or $Z_{\rm red}$ has only homogeneous isolated singularities with $n$ at least $4$, we show that the strong monodromy conjecture for a defining polynomial $f$ of $Z$ follows from arxiv:1609.04801v1 using in the reduced curve case a formula of Denef and Loeser for Newton-nondegenerate polynomials of three variables (which can be deduced in the applied case from the one for the two variable case) together with known results about the strong monodromy conjecture in the two variable case. Here an amazing cancellation occurs so that possible counterexamples fail. We also show the relation between the pole orders of topological zeta function and the root multiplicities of Bernstein-Sato polynomial in the case $Z$ has equimultiplicity and $Z_{\rm red}$ has only weighted homogeneous singularities with $n=3$ or $Z_{\rm red}$ has only homogeneous isolated singularities with $n>3$.
Read the full abstract
Combinatorics
A Bivariate $B$-Restricted Clique Polynomial: From Local Neighborhoods to Global Expansion
Let $G$ be a finite simple graph and $B \subseteq V(G)$. We introduce the \emph{bivariate $B$-restricted clique polynomial} \[ C_B(G;x,y) = \sum_{\substack{K \subseteq V \\ K \text{ is a clique}}} x^{|K|} y^{|K \cap B|}, \] where the coefficient of $x^i y^j$ counts cliques of size $i$ with exactly $j$ vertices in $B$. This polynomial simultaneously captures combinatorial structure, local extremal properties, and spectral constraints associated with the subset $B$. \\ First, we develop vertex and edge deletion recurrences, generalizing classical clique polynomial results. These recurrences imply monotonicity for the largest negative root $\zeta_G(B;y)$ (viewed as a polynomial in $x$ for fixed $y \in [0,1]$) under induced and spanning subgraphs. From this, we derive bounds on $B$-independence numbers, $B$-girth, and clique densities restricted to $B$. \\ Next, we prove that for any integer $r \ge 1$, any $r$-connected $K_{r+3}$-free chordal graph $G$, and any subset $B \subseteq V(G)$, the bivariate clique polynomial $C_B(G;x,y)$ is real-stable. \\ Then, we connect $C_B(G;x,y)$ with spectral graph theory. For $(n,d,\lambda)$-graphs, expansion constraints via Tanner's inequality limit clique growth within $B$, yielding explicit bounds on coefficients and $\zeta_G(B;y)$. \\ Finally, we analyze weighted vertices and homomorphism obstructions in this framework, giving a general no-homomorphism criterion. We also conclude the paper with a couple of interesting open problems for young and motivated researchers.
Read the full abstract
Numerical Analysis
A neural operator framework for solving inverse scattering problems
We present a neural operator framework for solving inverse scattering problems. A neural operator produces a preliminary indicator function for the scatterer, which, after appropriate rescaling, is used as a regularization parameter within the Linear Sampling Method to validate the initial reconstruction. The neural operator is implemented as a DeepONet with a fixed radial-basis-function trunk, while the noise level required for rescaling is estimated using a dedicated neural network. A neural tangent kernel analysis guides the architectural design, reducing the network tuning to a single discretization parameter, adjustable according to the wavelength. Two-dimensional numerical experiments demonstrate the method's effectiveness, with a Python toolbox provided for reproducibility.
Read the full abstract
Complex Variables
A Riemann Boundary Value Problem in a Two-Dimensional Commutative Associative Banach Algebra
We consider a Riemann boundary value problem for monogenic functions in a two-dimensional commutative associative Banach algebra. We prove theorems on the existence of a solution to this problem under different assumptions on the coefficient and free term of the problem, and give an explicit formula for the solution.
Read the full abstract
Group Theory
A height-zero type result for blocks of solvable groups
Let $B$ be a $p$-block of a finite group $G$ with defect group $D$. The more difficult direction of the recently proven height zero conjecture says that $D$ is abelian if every character in Irr$(B)$ has height zero. We consider a smaller set than Irr$(B)$. In particular, if $\varphi \in {\rm IBr}_p(B)$, we let Irr$(\varphi)$ be the set of characters $\chi \in {\rm Irr}(G)$ such that $\varphi$ is a constituent of $\chi^o$. Now suppose $G$ is solvable and $\varphi$ is a height zero Brauer character in some block $B$ of $G$ with defect group $D$. Here we show that if every character in Irr$(\varphi)$ has height zero, then the defect group $D$ of the block containing $\varphi$ is abelian for $p \geq 5$ and almost abelian for $p = 2$ or $3$. This has a nice consequence for primitive characters of $p$-complements in solvable groups.
Read the full abstract
Number Theory
Periods of hyperplane arrangements and multiple polylogarithms
We compute the periods associated with a special class of hyperplane arrangements. In particular, we exhibit a combinatorial condition on the intersection lattice of a hyperplane arrangement that ensures that its associated periods are linear combinations of special values of multiple polylogarithms. Our method generalizes Brown's approach to the periods of moduli spaces of curves of genus zero. We apply this result to the reflection arrangement of the full monomial group, whose periods are shown to be linear combinations of values of multiple polylogarithms at roots of unity.
Read the full abstract
Combinatorics
Cosigning Crossing Families and Outer-Planar Gadgets
Let $F$ be a crossing family over ground set $V$, that is, for any two sets $U,W\in{F}$ with nonempty intersection and proper union, both sets $U\cap{W},U\cup{W}$ are in $F$. Let $\sigma:V\to \{+,-\}$ be a signing. We call $\sigma$ a "cosigning" if every set includes a positive element and excludes a negative element. It is "$\cap\cup$-closed" if every pairwise nonempty intersection and co-intersection include positive and negative elements, respectively. We characterize the existence of ($\cap\cup$-closed) cosignings $\sigma$ through necessary and sufficient conditions. Our proofs are algorithmic and lead to elegant `forcing' algorithms for finding $\sigma$, reminiscent of the Cameron-Edmonds algorithm for bicoloring balanced hypergraphs. We prove that the algorithms run in polynomial time, and further, the cosigning algorithm can be run in oracle polynomial time through an application of submodular function minimization. Cosigned crossing families arise naturally in digraphs with vertex set $V$ comprised of sources and sinks, where every set in $F$ is "covered" by an incoming arc. Under mild and necessary conditions, we build an outer-planar arc covering of $F$ when the vertices are placed around a circle. These gadgets are then used to find disjoint dijoins in $0,1$-weighted planar digraphs when the weight-$1$ arcs form a connected component that is not necessarily spanning.
Read the full abstract
Probability · Cross-listed from q-bio.PE
The interplay of selection and dormancy in a Moran model can lead to coexistence of types
In this paper we propose a Moran model that describes the population dynamics of two types: While the first type has a selective advantage during reproduction, the second type can avoid replacement during reproduction with some positive probability by switching temporarily into a dormant state. We investigate the interplay of both evolutionary strategies by studying the invasion dynamics of the dormant type into the resident (selectively advantageous) population in the large population limit of the system. It turns out that the dormancy trait can not only invade and subsequently fixate under suitable parameter assumptions despite its selective disadvantage (a phenomenon that has already been observed in a related context in Blath and Tóbiás (2020)), but that there is also a novel regime of stable coexistence of both types due to a frequency-dependent balancing effect that did not arise in the previous setup with Lotka–Volterra type symmetric competition. The emergence of a coexistence regime here rests in part on specific properties of the Moran modelling framework, in particular its fixed overall population size that enforces instant re-colonization after death events, as well as on the (positive) mortality and resuscitation rates of the dormant state. We provide heuristic explanations for the observed types of behaviour and the corresponding proofs, which involve comparisons to suitable branching processes, approximations by dynamical systems, and an analysis of asymptotic behaviour of the latter.
Read the full abstract
Combinatorics
On some classes of binary matrices
The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted lexicographically. We examine some particular cases and special properties of this matrices. Finally, we demonstrate the relationship between the Fibonacci numbers and the cardinality of two classes of $\Lambda_n^k$-matrices with lexicographically sorted rows and columns.
Read the full abstract
Analysis of PDEs
Higher-order regularity for a structurally damped plate equation on rough domains
We prove well-posedness and higher-order regularity for a linear structurally damped plate equation with inhomogeneous Dirichlet–Neumann boundary conditions on the half-space and on bounded domains. To this end, we study maximal regularity properties of the related first-order system on weighted Sobolev spaces of arbitrarily high smoothness. In particular, we consider Sobolev spaces with power weights that measure the distance to the boundary. This allows us to avoid unnatural compatibility conditions for the data and treat the plate equation with rough inhomogeneous boundary conditions on bounded $C^{1,\kappa}$-domains, where $\kappa\in (0,1)$ depends on the exponent of the spatial power weight, but is independent of the smoothness of the data. Our methods can serve as an example to treat more complicated mixed-order systems as well.
Read the full abstract
Symplectic Geometry
Stratifications associated to generic closed two-forms and stratified $L_\infty$ spaces
Jae-Suk Park and the second-named author introduce the deformation problem of coisotropic submanifolds of a symplectic manifold as the study of Mauer-Cartan moduli problem of an $L_\infty$ algebra attached to the foliation de-Rham complex associated to the null foliation of the corresponding presymplectic structure. The main purpose of the present paper is to extend this study of $L_\infty$ structures to the case of generic closed two-forms on arbitrary smooth manifolds as a stratified $L_\infty$ space. We first prove that there exists a residual subset of closed 2-forms, which we denote by $Z^2_{reg}(M) \subset Z^2(M)$, such that any element $\omega$ therefrom admits a Whitney stratification each of whose strata is a presymplectic manifold. We then associate an $L_\infty$ space to each stratum (and to its tubular neighborhood) and glue the collection of $L_\infty$ spaces to a global stratified $L_\infty$ space by the coordinate atlas consisting of $L_\infty$ morphisms, which is a collection of $L_\infty$ morphisms, not necessarily of quasi-isomorphisms.
Read the full abstract
Combinatorics
Tropical $k$-means clustering for phylogenetic trees
The asymmetric tropical distance is a distance measure on the tropical torus $\mathbb{R}^n/\mathbb{R}\mathbf{1}$ and in particular on the Bergman fan $B(K_N) \subseteq \mathbb{R}^{\binom{N}{2}}/\mathbb{R}\mathbf{1}$ of the complete graphical matroid. In this paper, we define and analyse a clustering algorithm for equidistant phylogenetic trees based on this distance, using the correspondence between $B(K_N)$ and the space of equidistant trees with $N$ leaves.