Related papers: The Ramsey properties for Grassmannians over $\mat…
In a previous paper, we provided some update in the treatment of the finiteness theorem for rational maps of finite degree from a fixed variety to varieties of general type. In the present paper we present another improvement, introducing…
We study Ramsey-theoretic properties of several natural classes of finite ultrametric spaces, describe the corresponding Urysohn spaces and compute a dynamical invariant attached to their isometry groups.
We extend a factorization theorem by Gwo\'zdziewicz and Hejmej from the ring of formal power series to any complete regular local ring $ R $. More precisely, let $ f \in R $ and assume that its Newton polyhedron has a loose edge such that…
We study the category of matrix factorizations for an isolated hypersurface singularity. We compute the canonical bilinear form on the Hochschild homology of this category. We find explicit expressions for the Chern character and the…
We use a graph-theoretic approach which yields improvements on the known Gilbert-Varshamov (GV) bound for sum-rank-metric codes for certain parameters. In particular, we show that asymptotically $\mathbb{F}_q^{\mathbf{n} \times \mathbf{m}}$…
This paper discusses reformulations of the problem of coloring plane maps with four colors. The context is the edge-coloring with three colors of cubic graphs such that three distinct colors occur at each vertex. We include discussion of…
Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…
Colored tensor models have recently burst onto the scene as a promising conceptual and computational tool in the investigation of problems of random geometry in dimension three and higher. We present a snapshot of the cutting edge in this…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
We introduce the space of parameters for the metaplectic Langlands theory as *factorization gerbes* on the affine Grassmannian, and develop metaplectic Langlands duality in the incarnation of the metaplectic geometric Satake functor. We…
Using the framework of pastures and foundations of matroids developed by Baker-Lorscheid, we give algorithms to: (i) compute the foundation of a matroid, and (ii) compute all morphisms between two pastures. Together, these provide an…
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman's Theorem. This paper introduces Ramsey algebras and…
There has recently been interest in relating properties of matrices drawn at random from the classical compact groups to statistical characteristics of number-theoretical L-functions. One example is the relationship conjectured to hold…
Ramsey algebras is an attempt to investigate Ramsey spaces generated by algebras in a purely combinatorial fashion. Previous studies have focused on the basic properties of Ramsey algebras and the study of a few specific examples. In this…
Given two linear relations $A$ and $B$ we characterize the existence of a linear relation (operator) $C$ such that $A\subseteq BC$, respectively $A\subseteq CB.$ These factorizations extend and improve well-known results by R.G. Douglas and…
We discuss in detail level/rank duality in three-dimensional Chern-Simons theories and various related dualities in three-dimensional Chern-Simons-matter theories. We couple the dual Lagrangians to appropriate background fields (including…
We introduce natural strengthenings of sequential compactness called the $r$-Ramsey property for each natural number $r\geq 1$. We prove that metrizable compact spaces are $r$-Ramsey for all $r$ and give examples of compact spaces that are…
We introduce Gowers--Matet forcing with a finite sequence of pairwise non-isomorphic Ramsey ultrafilters over $\omega$, and with this forcing we settle the long-standing problem of the spectrum of numbers near-coherence classes. We prove…
We prove a new generalisation of Ramsey's theorem by showing that every $2$-edge-coloured graph with sufficiently large minimum degree contains a monochromatic induced subgraph whose minimum degree remains large. From this, we also derive…
In this note we provide a higher-dimensional analogue of Tutte's celebrated theorem on colorings and flows of graphs, by showing that the theory of arithmetic Tutte polynomials and quasi-polynomials encompasses invariants defined for CW…