Related papers: A universality theorem for allowable sequences wit…
We examine the incidence geometry of lines in the tropical plane. We prove tropical analogs of the Sylvester-Gallai and Motzkin-Rabin theorems in classical incidence geometry. This study leads naturally to a discussion of the realizability…
We prove an equivalence between the following notions: (i) unitary M\"obius vertex algebras, and (ii) Wightman conformal field theories on the circle (with finite-dimensional conformal weight spaces) satisfying an additional condition that…
A \emph{gerechte framework} is a partition of an $n \times n$ array into $n$ regions of $n$ cells each. A \emph{realization} of a gerechte framework is a latin square of order $n$ with the property that when its cells are partitioned by the…
We characterize the global hypoellipticity, almost hypoellipticity and solvability for a class of systems of real vector fields on the (n + 1)-dimensional torus as well as the same properties about the sum of squares associated to the…
In this paper we consider a generalization of a well known result by Veronese about rational normal curves. More precisely, given a collection of linear spaces in $\PP^n$ we study the existence of rational normal curves intersecting each…
In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…
In the long paper "Family Blowup formula, Admissible Graphs and the Enumeration of Singular Curves (I)" (appearing in JDG), the author solved the enumeration problem of nodal (or general singular) curve counting on algebraic surfaces by…
Categorical universal algebra can be developed either using Lawvere theories (single-sorted finite product theories) or using monads, and the category of Lawvere theories is equivalent to the category of finitary monads on Set. We show how…
The algebraic geometry of a universal algebra $\mathbf{A}$ is defined as the collection of solution sets of term equations. Two algebras $\mathbf{A}_1$ and $\mathbf{A}_2$ are called algebraically equivalent if they have the same algebraic…
Given a single (differential-algebraic) input-output equation, we present a method for finding different representations of the associated system in the form of rational realizations; these are dynamical systems with rational right-hand…
General theory determines the notion of separable MV-algebra (equivalently, of separable unital lattice-ordered Abelian group). We establish the following structure theorem: An MV-algebra is separable if, and only if, it is a finite product…
We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…
A few steps are made towards representation theory of embeddability among uncountable graphs. A monotone class of graphs is defined by forbidding countable subgraphs, related to the graph's end-structure. Using a combinatorial theorem of…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…
We define a weak notion of universality in symbolic dynamics and, by generalizing a proof of Mike Hochman, we prove that this yields necessary conditions on the forbidden patterns defining a universal subshift: These forbidden patterns are…
We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…
An ordered hypergraph is a hypergraph whose vertex set is linearly ordered, and a convex geometric hypergraph is a hypergraph whose vertex set is cyclically ordered. Extremal problems for ordered and convex geometric graphs have a rich…
We study extensions of Sem\"enov arithmetic, the first-order theory of the structure $(\mathbb{N}, +, 2^x)$. It is well-knonw that this theory becomes undecidable when extended with regular predicates over tuples of number strings, such as…
Recently, Cochran and Harvey defined torsion-free derived series of groups and proved an injectivity theorem on the associated torsion-free quotients. We show that there is a universal construction which extends such an injectivity theorem…