Related papers: Nullstellensatz Size-Degree Trade-offs from Revers…
In this paper, we define a new parameter of a graph as a spin-off of the pebbling number (which is the smallest $t$ such that every supply of $t$ pebbles can satisfy every demand of one pebble). This new parameter is the singular pebbling…
We expand the theory of pebbling to graphs with weighted edges. In a weighted pebbling game, one player distributes a set amount of weight on the edges of a graph and his opponent chooses a target vertex and places a configuration of…
A pebbling move on a graph $G$ consists of taking two pebbles off one vertex and placing one on an adjacent vertex. The pebbling number of a graph $G$, denoted by $f(G)$, is the least integer $n$ such that, however $n$ pebbles are located…
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles from some vertex and places one on an adjacent vertex. A…
Hilbert's Nullstellensatz is one of the most fundamental correspondences between algebra and geometry, and has inspired a plethora of noncommutative analogs. In last two decades, there has been an increased interest in understanding…
A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…
We prove effective Nullstellensatz and elimination theorems for difference equations in sequence rings. More precisely, we compute an explicit function of geometric quantities associated to a system of difference equations (and these…
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The…
We investigate and quantify the distinction between rectifiable and purely unrectifiable 1-sets in the plane. That is, given that purely unrectifiable 1-sets always have null intersections with Lipschitz images, we ask whether these sets…
Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…
The pebbling number of a graph $G$, $f(G)$, is the least $p$ such that, however $p$ pebbles are placed on the vertices of $G$, we can move a pebble to any vertex by a sequence of moves, each move taking two pebbles off one vertex and…
Let $G=(V,E)$ be a simple graph. A function $\phi:V\rightarrow \mathbb{N}\cup \{0\}$ is called a configuration of pebbles on the vertices of $G$ and the quantity $\sum_{u\in V}\phi(u)$ is called the size of $\phi$ which is just the total…
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex. The cover pebbling number of a graph is the smallest number of…
Reversible simulation of irreversible algorithms is analyzed in the stylized form of a `reversible' pebble game. While such simulations incur little overhead in additional computation time, they use a large amount of additional memory space…
Let G be a graph with a distribution of pebbles on its vertices. A pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The optimal pebbling number of G is the smallest number of…
Motivated by metastability in the zero-range process, we consider i.i.d.\ random variables with values in $\N_0$ and Weibull-like (stretched exponential) law $\mathbb P(X_i =k) = c \exp( - k^\alpha)$, $\alpha \in (0,1)$. We condition on…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
Let $\mathcal G$ be a separable family of graphs. Then for all positive constants $\epsilon$ and $\Delta$ and for every sufficiently large integer $n$, every sequence $G_1,\dotsc,G_t\in\mathcal G$ of graphs of order $n$ and maximum degree…
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological description of the surrounding of the analyzed vertex.…
The $t$-fold pebbling number, $\pi_t(G)$, of a graph $G$ is defined to be the minimum number $m$ so that, from any given configuration of $m$ pebbles on the vertices of $G$, it is possible to place at least $t$ pebbles on any specified…