Related papers: Nullstellensatz Size-Degree Trade-offs from Revers…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
We consider time-dependent orbifolds in String Theory and we show that divergences are not associated with a gravitational backreaction since they appear in the open string sector too. They are related to the non existence of the underlying…
A pebbling move on a weighted graph removes some pebbles at a vertex and adds one pebble at an adjacent vertex. The number of pebbles removed is the weight of the edge connecting the vertices. A vertex is reachable from a pebble…
We investigate the zero-forcing number for triangle-free graphs. We improve upon the trivial bound, $\delta \le Z(G)$ where $\delta$ is the minimum degree, in the triangle-free case. In particular, we show that $2 \delta - 2 \le Z(G)$ for…
A pebbling move on a graph removes two pebbles at a vertex and adds one pebble at an adjacent vertex. Rubbling is a version of pebbling where an additional move is allowed. In this new move, one pebble each is removed at vertices $v$ and…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter…
The fractional matching number of a graph G, is the maximum size of a fractional matching of G. The following sharp lower bounds for a graph G of order n are proved, and all extremal graphs are characterized in this paper. (1)The sum of the…
A word-representable graph is a simple graph $G$ which can be represented by a word $w$ over the vertices of $G$ such that any two vertices are adjacent in $G$ if and only if they alternate in $w$. It is known that the class of…
We introduce a new algebraic framework for understanding nonperturbative gravitational aspects of bulk reconstruction with a finite or infinite-dimensional boundary Hilbert space. We use relative entropy equivalence between bulk and…
This paper explores the application of Hurlbert's Linear Optimization Technique to determine bounds on pebbling numbers. By applying Hurlbert's weight functions and optimization methods, we derive upper bounds for specific graph families.…
A pebbling move on a graph consists of removing $2$ pebbles from a vertex and adding $1$ pebble to one of the neighbouring vertices. A vertex is called reachable if we can put $1$ pebble on it after a sequence of moves. The optimal pebbling…
In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…
Zilber's Exponential Algebraic Closedness conjecture (also known as Zilber's Nullstellensatz) gives conditions under which a complex algebraic variety should intersect the graph of the exponential map of a semiabelian variety. We prove the…
Preordered semialgebras and semirings are two kinds of algebraic structures occurring in real algebraic geometry frequently and usually play important roles therein. They have many interesting and promising applications in the fields of…
It is known that the variety parametrizing pairs of commuting nilpotent matrices is irreducible and that this provides a proof of the irreducibility of the punctual Hilbert scheme in the plane. We extend this link to the nilpotent commuting…
Let $f_i$ be polynomials in $n$ variables without a common zero. Hilbert's Nullstellensatz says that there are polynomials $g_i$ such that $\sum g_if_i=1$. The effective versions of this result bound the degrees of the $g_i$ in terms of the…
We show that an arbitrary infinite graph $G$ can be compactified by its ends plus its critical vertex sets, where a finite set $X$ of vertices of an infinite graph is critical if its deletion leaves some infinitely many components each with…
Several quantitative notions of rectifiability in the Heisenberg groups have emerged in the recent literature. In this paper we study the relationship between two of them, the big pieces of intrinsic Lipschitz graphs (BPiLG) condition and…
We construct new superstring actions which are distinguished from standard superstrings by being space-time scale invariant. Like standard superstrings, they are also reparametrization invariant, space-time supersymmetric, and invariant…