Peer Revenue Returns subject to peer review

Papers

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

Mathematics

math Watch Mathematics (sign in to use)

Thursday 19 March

Information Theory

Error-detecting solid codes

A code is called solid if, roughly speaking, any correctly-transmitted codeword in an arbitrarily corrupted string of codewords can still be decoded correctly and unambiguously. So-called variable-length solid codes, in which codewords may differ in length, have been studied by various authors. In this short note, we observe that a recent construction of variable-length solid codes based on binary codes may be extended to arbitrary n-ary codes. We further prove an interesting error-detection property of a specific subfamily of these variable-length solid codes, and give a concrete application to a certain type of binary code.
Read the full abstract

Optimization and Control

On Locational Marginal Emissions in Electricity Markets: A Two-Layered Dispatch Mechanism and Its Fundamental Theorems

We propose a market design for real-time electricity markets that utilizes a two-layered dispatch mechanism to systematically incorporate carbon accounting into grid operations. In this mechanism, “dispatch”, the centralized allocation of generation resources to meet system load, is executed via a hierarchical structure where the first layer minimizes financial costs to maintain economic efficiency, while the second layer minimizes system emissions strictly within the set of cost-optimal solutions. We define locational marginal emissions (LMEs) as the marginal rate of system emissions derived from the dual variables of the two-layered formulation. Unlike standard marginal prices which correspond to right-hand-side constraint relaxations, LMEs must account for the requirement of economic optimality which introduces demand parameters into the problem's constraint structure. Under the framework, we establish that LMEs satisfy properties analogous to the first and second fundamental theorems of welfare economics. We prove that (1) decentralized “carbon profit” maximization by individual grid entities guarantees a system-wide emission profile consistent with the economic dispatch, and (2) any optimal low-carbon economic dispatch is supported by a corresponding set of LME signals acting as a decentralized equilibrium. Furthermore, we establish a general carbon accounting theorem, called the Carbon Footprint Theorem, showing that these market-consistent LMEs ensure the sum of carbon accounts across all grid components (loads, generators, transmission, and storage) equals the total physical carbon emissions. This completes the theoretical foundation of the LME. Finally, we investigate and validate the empirical properties of LMEs and LME-based carbon accounting through case studies on a realistic Texas grid model.
Read the full abstract

Operator Algebras

The spectra of polynomials in free (semi)circular operators

We show that any $L^2$-bounded rational function in free semicircular random variables is a bounded operator, which implies the coincidence of the usual spectrum and $L^2$-spectrum for rational functions. Based on this observation, we also compute the spectra of several polynomials in free circular random variables.
Read the full abstract

Numerical Analysis

A review of shape-morphing solutions and evolutional neural networks for spatiotemporal dynamics

Shape-morphing solutions (SMS) refer to a class of approximate solutions of partial differential equations (PDEs) with the distinguishing feature that they depend nonlinearly on a set of time-dependent parameters. They generalize Galerkin truncations by allowing the basis (or trial functions) to evolve in time in order to adapt to the solution of the PDE. As such, SMS are particularly suitable for reduced-order modeling as well as high fidelity simulation of multiscale systems which exhibit localized time-dependent features, such as vortices, dispersive wave packets, and shocks. Furthermore, being mesh-free, SMS is scalable for solving PDEs in higher spatial dimensions. As a special case, SMS allows the approximation of the PDE's solution by a neural network whose weights and biases depend on time. Such neural networks are known as evolutional neural networks or neural Galerkin schemes. The evolution of SMS parameters is dictated by the SMS equation, a set of ordinary differential equations derived from the Dirac-Frenkel variational principle. Over the past five years, contributions to the theory and computation of SMS have been growing rapidly. Here, we survey these developments, showcase some applications of SMS, and highlight important open problems for future research. At the same time, this review is structured to serve as a tutorial for applied mathematicians, physicist, and engineers who wish to enter this field.
Read the full abstract

Mathematical Physics

Homotopy lattice gauge fields 1: The fields and their properties

We introduce homotopy lattice gauge fields (HLGFs), a version of gauge fields over a discretized base, based on a notion of higher parallel transport that enriches the usual parallel transport along paths on a lattice to also consider higher dimensional paths. Higher dimensional data keeps information about the parallel transport along homotopies of curves. With this data, a HLGF on a base space of dimension two or three determines a principal bundle over the base manifold. This data is also responsible for our formulas for the topological charge on two-dimensional bases. Our framework is an application of a nonabelian algebraic topology framework developed to solve the local to global problem in higher dimensional homotopy. No previous knowledge of higher category theory is assumed. The second part will be devoted to the space of fields as an arena for doing Quantum Field Theory, and to give the first examples of how our framework refines standard lattice gauge theory.
Read the full abstract

Optimization and Control

Leveraging Classical and Quantum Computing for Process Systems Engineering Applications: Decomposition Algorithm with Ising Solvers for Efficient Discrete Landscape Exploration

Conceptual process design is a crucial aspect of chemical engineering that involves process synthesis. Mixed-integer nonlinear programming is a powerful framework for modeling such design problems by combining discrete and continuous variables; however, the combinatorial complexity of discrete choices, coupled with nonlinearities, presents challenging monolithic problems. Using decomposition, discrete subproblems can potentially benefit from Ising solvers, while simulators and nonlinear solvers offer powerful tools for handling nonlinearities. This work aims to: evaluate use of Ising-based solvers for discrete optimization and holistic process optimization through two case studies: an ionic liquid selection and its process design, and a more complex problem of drug manufacturing process optimization. The discrete subproblem is formulated as an integer program or quadratic unconstrained binary optimization and solved using a commercial classical or Ising solvers such as simulated annealing (SA), quantum annealing (QA), and entropy computing (EC) respectively. The commercial classical solver had the shortest runtime, whereas EC took the longest, followed by QA and SA, in reaching feasible and optimal solutions. The heuristics identified all or most feasible solutions in a single run, demonstrating advantages in solution diversity and efficient and broad exploration of the solution space over the classical solver, while the classical solver provides an optimality guarantee and rapid convergence speed. In process design, where insights of alternative designs and cost comparisons are more valuable than an optimal solution, heuristics offer a better-suited decision-making strategy. The comparative analysis highlights the strengths of each method and underscores the potential of this heterogeneous computing approach that leverages different methods to address practical optimization problems.
Read the full abstract

Dynamical Systems

A Mathematical Framework for Linear Response Theory for Nonautonomous Systems

Linear Response theory aims to predict how added forcing alters the statistical properties of a system. This has been predominantly studied for autonomous dynamical systems, yet many systems in the physical, natural, and social sciences are inherently nonautonomous. In such settings, one would like to understand how the system's time-dependent statistical properties change when additional infinitesimal forcings are applied. This question is of clear practical relevance, but from a rigorous mathematical viewpoint it has been addressed only for a few specific classes of systems and perturbations. Here we provide a rigorous linear response theory for a rather general class of deterministic and random nonautonomous systems satisfying a specific set of assumptions that are the counterpart of the standard assumptions used in the autonomous setting. A central ingredient is rapid loss of memory along the nonautonomous evolution. Our main strategy is to reformulate the sequential dynamics as a fixed-point problem for a global transfer operator acting on an extended sequence space of measures. This yields explicit and readily implementable causal response formulas for predicting the effect of small perturbations on time-dependent statistical states. We illustrate the theory on two representative classes: sequential compositions of expanding maps and sequential compositions of noisy random maps. We also establish linear response for reflected Euler-Maruyama discretizations of dissipative nonautonomous stochastic differential equations with nondegenerate additive Gaussian noise, on fixed compact domains. As a physical application, we study the response of a Ghil-Sellers climate energy balance model, discretized in latitude and time to a time-dependent perturbation of the greenhouse parameter.
Read the full abstract

Statistics Theory

Doubly-Unlinked Regression for Dependent Data

Shuffled regression concerns settings in which covariates and responses are observed without their correct pairing. In dependent-data problems, a second form of missing correspondence can arise when responses are also detached from the latent temporal, spatial, or geometric domain that induces their dependence structure. We study regression under this joint loss of correspondence and, to our knowledge, provide the first systematic treatment of this setting. Specifically, we consider a doubly-unlinked regression model in which both the covariate-response link and the response-domain link are unknown, represented by two latent permutation matrices, while dependence is induced by an unobserved stochastic process. This framework unifies shuffled regression and latent-domain permutation models within a common dependent-data setting. We characterize signal-to-noise regimes governing recovery of the regression parameter and the latent permutations, and show that consistent estimation of the regression coefficient can be achieved under strictly weaker conditions than exact permutation recovery. To address the combinatorial difficulty of inference, we develop REPAIR, a variational Bayes method based on a block-structured permutation model that captures localized scrambling while substantially reducing computational complexity. Simulations and an applied example illustrate the empirical behavior of REPAIR and support the theoretical results.
Read the full abstract

Combinatorics

An Exploration of Crank Generating functions for $t$-core partitions

In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the crank. A crank generating function for the partition function was discovered in 1988 by George Andrews and Frank Garvan. Since then other crank generating functions have been found for many other kinds of partitions. In this paper, we give a family of crank generating functions which explain some partition congruences for $t$-core partitions.
Read the full abstract

Combinatorics

Interpolation in Species and a Lift of the Hopf Algebra of r-Quasisymmetric Functions

In this manuscript we lift the theory of r-quasisymmetric functions to the theory of Hopf monoids. We provide a general method of interpolating between two Hopf monoids, one being the free monoid on a positive comonoid and the other being the free commutative monoid on a positive comonoid.
Read the full abstract

Probability

A study of centrality measures in random recursive trees

We investigate the behaviour of five classical centrality measures–Jordan, rumor, betweenness, degree, and closeness centralities–in the setting of uniform random recursive trees. Motivated by applications in network archaeology, we focus on two fundamental questions: (i) the birth index (time of arrival) of the most central vertex, and (ii) the relative centrality of the root. We quantify the probability that the root is the most central vertex, analyze its expected rank under each centrality measure, and determine the expected birth index of a central vertex. In addition, we characterize the typical size of the set of top-ranked vertices that contains the root with high probability. Finally, for each centrality notion, we study the persistence properties of the center and the asymptotic behaviour of the root's rank.
Read the full abstract

Number Theory

Families of Congruences for Partitions with $k$-colored odd parts

The study of integer partitions and their congruences dates back to 1919 when Ramanujan discovered his famous congruences for the partition function, $p(n)$. Since then, many other kinds of partition functions have been discovered, as well as their respective congruences. Recently, Hirschorn and Sellers have consider partitions in which the odd parts may appear in $k$ colors and the even parts are restricted to at most one color. It turns out that these partitions exhibit fascinating families of congruences. In this paper, we look at a set of congruences that give rise to infinite families modulo 3. We also give some questions at the end that could aid further research into these partitions.
Read the full abstract

Combinatorics · Cross-listed from cs.CC

Communication Complexity of Disjointness under Product Distributions

Determining the randomized (or distributional) communication complexity of disjointness is a central problem in communication complexity, having roots in the foundational work of Babai, Frankl, and Simon in the 1980s and culminating in the famous works of Kalyanasundaram-Schnitger and Razborov in 1992. However, the question of obtaining tight bounds for product distributions persisted until the more recent work of Bottesch, Gavinsky, and Klauck resolved it. In this note we revisit this classical problem and give a short, streamlined proof of the best bounds, with improved quantitative dependence on the error parameter. Our approach is based on a simple combinatorial lemma that may be of independent interest: if two sets drawn independently from two distributions are disjoint with non-negligible probability, then one can extract two subfamilies of reasonably large measure that are fully cross-disjoint (equivalently, a large monochromatic rectangle for disjointness).
Read the full abstract

All authors Zach Hunter, Aleksa Milojević, Benny Sudakov, Istvan Tomon

Logic

On semigroups and groupoids with minimal probabilistic spectrum

The equational probabilistic spectrum of a finite algebra is the set of probabilities with which equations are satisfied in the algebra. We study algebras with minimal spectrum, that is, spectra consisting only of the values $1$ and $1/|\A|$. We show that, apart from trivial cases, groupoids with minimal spectrum are quasigroups. We further prove that several weak associativity conditions collapse into full associativity, and hence into group structure. Finally, we obtain a complete classification of semigroups with minimal spectrum.
Read the full abstract

Combinatorics

Asymptotic normality of pattern counts in random maps II

In a recent work, a central limit theorem for pattern counts in random planar maps was proven by reducing the problem to a face count problem. We provide a shorter proof by circumventing this reduction through the computation of bivariate coefficient asymptotics from a functional equation with one catalytic variable and extend the result to pattern counts with arbitrary boundary and new map classes.
Read the full abstract

Combinatorics

Singularly perturbed discrete differential equations

Discrete differential equations appear most prominently in planar map and lattice path enumeration. In this work we consider discrete differential equations with an additional parameter $x$, where the order of the equation is $1$ for $x=0$ but $k> 1$ for $x\ne 0$. We call such equations singularly perturbed. The main contribution of this work is to show that there is actually a smooth transition under certain natural assumptions. As an application of this result we consider pattern counts in triangular planar maps and derive a central limit theorem for patterns which cannot self-intersect.
Read the full abstract

Statistics Theory · Cross-listed from stat.ME

Regression Adjustments for Double Randomization in Two-Sided Marketplaces

Multiple randomization designs (MRDs) are a class of experimental designs used to handle interference in two-sided marketplaces. We investigate regression adjustment strategies for estimating total, spillover, and direct effects in MRDs. We derive minimum asymptotic variance estimators among a broad class of linearly adjusted estimators, without assuming a linear model on the potential outcomes. Surprisingly, the optimal regression adjustments are estimable from data and are generally different from regression adjustments in classical randomized experiments. For example, one such optimal estimator for the direct effect corresponds to a weighted regression with interacted two-way fixed effects. We establish model-robustness properties, central limit theorems, and inferential methods for our estimators, relying on improved theoretical results for MRD experiments. Our results provide the analog of classical regression adjustments for marketplace experiments. Numerical simulations demonstrate a considerable increase in efficiency over simpler approaches, enabling better inference when running MRDs.
Read the full abstract

All authors Timothy Sudijono, Lihua Lei, Lorenzo Masoero, Suhas Vijaykumar, Guido Imbens, James McQueen

Combinatorics

Vertex structure of fiber products of probability polytopes

We develop tools for characterizing vertices of fiber products of polytopes and apply them to simplicial distribution polytopes, a class of probability polytopes arising in quantum foundations and quantum information. In the theory of simplicial distributions, a pair of simplicial sets encoding measurement and outcome spaces determines a convex polytope of compatible probability assignments. Our first results give geometric criteria for detecting vertices of fiber products in terms of support data. These results are obtained in the more general framework of inverse limits of diagrams of polytopes in standard form, and they translate to corresponding criteria for simplicial distributions on arbitrary colimits of measurement spaces. We then focus on one-dimensional measurement spaces, where simplicial distributions recover and generalize local marginal polytopes in graphical models. In this setting, our sharpest results concern dipole graphs, for which we obtain a complete characterization of vertices and refine it to a graph-theoretic criterion. These characterizations are reminiscent of the classical support-graph criteria for transportation polytopes, but they arise in a richer class of polytopes in which vertex structure depends not only on support acyclicity but also on additional geometric compatibility data. Using the collapsing method from simplicial topology, we transfer the dipole characterization to rose graphs and obtain analogous results there. Finally, we apply collapsing to complete bipartite graphs, which encode physically relevant bipartite Bell scenarios, and more generally to arbitrary connected graphs, yielding lower bounds on the number of vertices.
Read the full abstract

Mathematical Physics

Disordered Ground States of Ergodic Quantum Spin Systems

In this letter, we fill a hole in the existing literature about disordered quantum spin systems generated by a random local interaction $\{\mathfrak{h}(Z)\}_{Z\Subset \mathbb{Z}^\nu}$ satisfying a statistical version of translation invariance. We show such systems always have disordered ground states in the thermodynamic limit with the same symmetry. A key tool we use is a disordered version of the Lieb-Robinson bounds, which hold almost surely under mild conditions on $\mathfrak{h}$. Along the way, we formalize the notion of a random state on a $C^*$-algebra and prove a weak-$\ast$ version of the Riesz-Markov-Kakutani theorem, which seems not to have been recorded in the vector measures literature. As a consequence of the existence of the aforementioned disordered ground states, we show that the spectrum of the GNS Hamiltonain associated to the bulk dynamics is deterministic with respect to the disorder.
Read the full abstract

Optimization and Control · Cross-listed from cs.LG

Global Convergence of Multiplicative Updates for the Matrix Mechanism: A Collaborative Proof with Gemini 3

We analyze a fixed-point iteration $v \leftarrow \phi(v)$ arising in the optimization of a regularized nuclear norm objective involving the Hadamard product structure, posed in DMR+22 in the context of an optimization problem over the space of algorithms in private machine learning. We prove that the iteration $v^{(k+1)} = \text{diag}((D_{v^{(k)}}^{1/2} M D_{v^{(k)}}^{1/2})^{1/2})$ converges monotonically to the unique global optimizer of the potential function $J(v) = 2 \text{Tr}((D_v^{1/2} M D_v^{1/2})^{1/2}) - \sum v_i$, closing a problem left open there. The bulk of this proof was provided by Gemini 3, subject to some corrections and interventions. Gemini 3 also sketched the initial version of this note. Thus, it represents as much a commentary on the practical use of AI in mathematics as it represents the closure of a small gap in the literature. As such, we include a small narrative description of the prompting process, and some resulting principles for working with AI to prove mathematics.
Read the full abstract

Numerical Analysis · Cross-listed from cs.LG

Deep Hilbert–Galerkin Methods for Infinite-Dimensional PDEs and Optimal Control

We develop deep learning-based approximation methods for fully nonlinear second-order PDEs on separable Hilbert spaces, such as HJB equations for infinite-dimensional control, by parameterizing solutions via Hilbert–Galerkin Neural Operators (HGNOs). We prove the first Universal Approximation Theorems (UATs) which are sufficiently powerful to address these problems, based on novel topologies for Hessian terms and corresponding novel continuity assumptions on the fully nonlinear operator. These topologies are non-sequential and non-metrizable, making the problem delicate. In particular, we prove UATs for functions on Hilbert spaces, together with their Fréchet derivatives up to second order, and for unbounded operators applied to the first derivative, ensuring that HGNOs are able to approximate all the PDE terms. For control problems, we further prove UATs for optimal feedback controls in terms of our approximating value function HGNO. We develop numerical training methods, which we call Deep Hilbert–Galerkin and Hilbert Actor-Critic (reinforcement learning) Methods, for these problems by minimizing the $L^2_\mu(H)$-norm of the residual of the PDE on the whole Hilbert space, not just a projected PDE to finite dimensions. This is the first paper to propose such an approach. The models considered arise in many applied sciences, such as functional differential equations in physics and Kolmogorov and HJB PDEs related to controlled PDEs, SPDEs, path-dependent systems, partially observed stochastic systems, and mean-field SDEs. We numerically solve examples of Kolmogorov and HJB PDEs related to the optimal control of deterministic and stochastic heat and Burgers' equations, demonstrating the promise of our deep learning-based approach.
Read the full abstract

All authors Samuel N. Cohen, Filippo de Feo, Jackson Hebner, Justin Sirignano

Optimization and Control · Cross-listed from eess.SY

Variational Encrypted Model Predictive Control

We develop a variational encrypted model predictive control (VEMPC) protocol whose online execution relies only on encrypted polynomial operations. The proposed approach reformulates the MPC problem into a sampling-based estimator, in which the computation of the quadratic cost is naturally handled by tilting the sampling distribution, thus reducing online encrypted computation. The resulting protocol requires no additional communication rounds or intermediate decryption, and scales efficiently through two complementary levels of parallelism. We analyze the effect of encryption-induced errors on optimality, and simulation results demonstrate the practical applicability of the proposed method.
Read the full abstract

All authors Jihoon Suh, Yeongjun Jang, Junsoo Kim, Takashi Tanaka

Analysis of PDEs

A Constructive Approach to a Class of Overdetermined Problems

In this paper we study an overdetermined problem which is directly related to the well known torsion problem studied by J. Serrin. A perturbed version of the latter is tackled by using asymptotic series as well as tools borrowed from the celebrated Nekhoroshev Theorem. In a similar fashion to this class of results, we establish the existence of infinitely many approximants for the perturbed problem's solution, whose approximation error is so small which can be regarded as negligible for practical applications. The approach is fully constructive and this feature is demonstrated via an example in the final section.
Read the full abstract

Functional Analysis

The Choi-Cholesky algorithm for completely positive maps

We establish explicit means via which natural dilations of completely positive (CP) maps can be constructed à la Kraus's IInd representation theorem. To obtain this, we rely on the Choi-Jamiołkowski correspondence and develop a Cholesky algorithm for bi-partite systems. This enables a canonical construction of adjoint actions which recover the behaviour of the original CP-maps. Our results hold under separability assumptions and the requirement that the maps are completely bounded and preserve the subideal of finite rank operators.
Read the full abstract

Mathematical Physics

Symmetry-protected Interface Modes Bifurcated from Double Dirac Cones

We rigorously prove the existence of interface modes in a sharp interface model, which bifurcate from the double Dirac cone as a consequence of the band inversion induced by super-symmetry breaking. The exact number of interface modes are determined. The proof is based on a discrete version of the layer-potential framework. Moreover, we prove that such interface modes are symmetry-protected against perturbations that respect the reflection symmetry.
Read the full abstract

Category Theory

Signs in objective linear algebra, exemplified with exterior powers and determinants

We develop objective linear algebra in a new setting with a cardinality functor that can take negative values. The signs arise as little homotopies, as ratios between orientations. To illustrate the workings of the theory we give an objective treatment of exterior powers and determinants.
Read the full abstract

Number Theory

Automorphisms of finite fields from isogeny cycles

We develop an explicit geometric construction of automorphisms of finite fields arising from isogeny cycles. Let $k$ be a finite field, $E/k$ an elliptic curve, and $\ell$ an integer coprime to $\mathrm{char}(k)$. Let $\mathfrak{h}$ be an ideal of $\mathrm{End}(E)$ dividing $\ell$, and consider the corresponding torsion subgroup $E[\mathfrak{h}]\subseteq E[\ell]$. From the action of End(E) on $E[\mathfrak{h}]$, we construct the splitting field $K$ of the $x$-coordinates of points in $E[\mathfrak{h}]$ and the associated Galois group $\mathrm{Gal}(K/k)$. This yields $(\mathrm{End}(E)/\mathfrak{h})^* \to \mathrm{Gal}(K/k)$ a group homomorphism.
Read the full abstract

Differential Geometry · Cross-listed from q-bio.NC

Curvature Sensitive Cells in the Modular Structures of The Visual Cortex

We propose a model of the functional architecture of curvature-sensitive cells in the primary visual cortex. The model accounts for the modular and hierarchical organization of the cortex, the horizontal connectivity, and the shape of receptive profiles of these cells as Gabor-type filters. We construct a canonical affine subbundle of the cotangent bundle of the manifold of oriented contact elements of the retina as a geometric model for these cells, and show that this subbundle carries an Engel structure related to that of the Cartan prolongation. On an open submanifold of the Cartan prolongation, we identify generators of the Engel distribution whose iterated Lie brackets span the Lie algebra of SIM(2). The identification of sim(2) as the Lie algebra of these generators determines SIM(2) as the natural symmetry group for curvature-sensitive cells. Finally, we characterize the receptive profiles of curvature-sensitive cells as minima of a SIM(2)-adapted uncertainty principle applied to the generators of the Engel structure.
Read the full abstract

Statistics Theory · Cross-listed from stat.ML

Pseudo-Labeling for Unsupervised Domain Adaptation with Kernel GLMs

We propose a principled framework for unsupervised domain adaptation under covariate shift in kernel Generalized Linear Models (GLMs), encompassing kernelized linear, logistic, and Poisson regression with ridge regularization. Our goal is to minimize prediction error in the target domain by leveraging labeled source data and unlabeled target data, despite differences in covariate distributions. We partition the labeled source data into two batches: one for training a family of candidate models, and the other for building an imputation model. This imputation model generates pseudo-labels for the target data, enabling robust model selection. We establish non-asymptotic excess-risk bounds that characterize adaptation performance through an "effective labeled sample size", explicitly accounting for the unknown covariate shift. Experiments on synthetic and real datasets demonstrate consistent performance gains over source-only baselines.
Read the full abstract

Commutative Algebra

Focal matroids of covers and homological properties of matroids

In this paper we prove that the Stanley–Reisner ideal or cover ideal $I$ of a matroid is minimally resolvable by iterated mapping cones. As a technical tool for this purpose, we introduce and study focal matroids, which are submatroids of a matroid $\mathcal{M}$ that are constructed relative to minimal $\ell$-covers of $\mathcal{M}$. Our second main result is that the monomial support of the multigraded Betti numbers of $I$ corresponds precisely to the squarefree minimal generators of the symbolic powers of $I$. In fact, we prove that matroidal ideals are the only squarefree ideals with this property, thus obtaining a new homological characterization of matroidal ideals. These techniques are foundational for a follow-up paper, where we will show that all symbolic power of $I$ are minimally resolvable by iterated mapping cones.
Read the full abstract