Related papers: An Elementary Integrality Proof of Rothblum's Stab…

We show the homology of the Hurwitz space associated to an arbitrary finite rack stabilizes integrally in a suitable sense. We also compute the dominant part of its stable homology after inverting finitely many primes. This proves a…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…

Let $F$ be an $(r+1)$-color critical graph with $r\geq 2$, that is, $\chi(F)=r+1$ and there is an edge $e$ in $F$ such that $\chi(F-e)=r$. Gerbner recently conjectured that every $n$-vertex maximal $F$-free graph with at least…

The investigation of eigenvalue conditions for the existence of an $[a,b]$-factor originates in the work of Brouwer and Haemers (2005) on perfect matchings. In the decades since, spectral extremal problems related to $[a,b]$-factors have…

In this paper we show that for each $n$, there exists a simple graph whose reliability polynomial has at least $n$ inflection points.

In this paper, we initiate a study of motivic homotopy theory at infinity. We use the six functor formalism to give an intrinsic definition of the stable motivic homotopy type at infinity of an algebraic variety. Our main computational…

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Based on the generalized Routh-Hurwitz criterion, we propose a sufficient and necessary criterion for testing the stability of fractional-order linear systems with order {\alpha}{\in}[1,2), called the fractional-order Routh-Hurwitz…

In this paper, we present sufficient conditions to guarantee the invertibility of rational circulant matrices with any given size. These sufficient conditions consist of linear combinations of the entries in the first row with integer…

It is well-known that a minimal graph of codimension one is stable, i.e. the second variation of the area functional is non-negative. This is no longer true for higher codimensional minimal graphs. In this note, we prove that a minimal…

A new nonparametric approach for system identification has been recently proposed where the impulse response is seen as the realization of a zero--mean Gaussian process whose covariance, the so--called stable spline kernel, guarantees that…

For $C^2$ vector fields, we study regular ergodic measures whose supports admit singular dominated splittings with one of the bundles having dimension $1$. For such a measure $\mu$, we prove that if any periodic orbit within the support of…

For a local complete intersection subvariety $X=V({\mathcal I})$ in ${\mathbb P}^n$ over a field of characteristic zero, we show that, in cohomological degrees smaller than the codimension of the singular locus of $X$, the cohomology of…

We present a model of roundoff error analysis that combines simplicity with predictive power. Though not considering all sources of roundoff within an algorithm, the model is related to a recursive roundoff error analysis and therefore…

The first part of this note concerns stable averages of multivariate matching polynomials. In proving the existence of infinite families of bipartite Ramanujan $d$-coverings, Hall, Puder and Sawin introduced the $d$-matching polynomial of a…

Frankl's union-closed sets conjecture states that in every finite union-closed set of sets, there is an element that is contained in at least half of the member-sets (provided there are at least two members). The conjecture has an…