相关论文: Sizes of witnesses in Covtree

A witness is a sub-database that preserves the query results of the original database but of much smaller size. It has wide applications in query rewriting and debugging, query explanation, IoT analytics, multi-layer network routing, etc.…

We present a null witness of the dimension of a quantum system, discriminating real, complex and classical spaces, based on equality due to linear independence. The witness involves only a single measurement with sufficiently many outcomes…

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…

One can reduce the problem of proving that a polynomial is nonnegative, or more generally of proving that a system of polynomial inequalities has no solutions, to finding polynomials that are sums of squares of polynomials and satisfy some…

Define a(k,q) to be the smallest positive multiple of k such that the sum of its digits in base q is equal to k. The asymptotic behavior, lower and upper bound estimates of a(k,q) are investigated. A characterization of the minimality…

Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

A set $S\subset \mathbb{R}^n$ is a nonnegativity witness for a set $U$ of real homogeneous polynomials if $F$ in $U$ is nonnegative on $\mathbb{R}^n$ if and only if it is nonnegative at all points of $S$. We prove that the union of the…

Let $n_g(k)$ denote the smallest order of a $k$-chromatic graph of girth at least $g$. We consider the problem of determining $n_g(k)$ for small values of $k$ and $g$. After giving an overview of what is known about $n_g(k)$, we provide…

The queen's graph $Q_{m \times n}$ has the squares of the $m \times n$ chessboard as its vertices; two squares are adjacent if they are in the same row, column, or diagonal of the board. A set $D$ of squares of $Q_{m \times n}$ is a…

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

A $(k,m)$-Furstenberg set $S \subset \mathbb{F}_q^n$ over a finite field is a set that has at least $m$ points in common with a $k$-flat in every direction. The question of determining the smallest size of such sets is a natural…

Phenomenological approaches to quantum gravity try to infer model-independent laws by analyzing thought experiments and combining both quantum, relativistic, and gravitational ingredients. We first review these ingredients -three basic…

We prove that any set of points in $\mathbb{R}^d$, any three of which form an angle less than $\frac{\pi}{3} + c$, has size $(1+\Theta(c))^d$ for sufficiently small $c>0$. The proof is based on a refinement of an approach by Erd\H{o}s and…

In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size $n$ using pairwise comparisons if $k$ of the comparisons might be erroneous where $k$ is a fixed constant. We prove…

Let $G$ be a graph and $\Gamma$ a finite abelian group. The zero-sum Ramsey number of $G$ over $\Gamma$, denoted by $R(G, \Gamma)$, is the smallest positive integer $t$ (if it exists) such that any edge-colouring $c:E(K_t)\to\Gamma$…

For two posets $P$ and $Q$, we say $Q$ is $P$-free if there does not exist any order-preserving injection from $P$ to $Q$. The speical case for $Q$ being the Boolean lattice $B_n$ is well-studied, and the optiamal value is denoted as…

The {\em metric dimension} of a graph $\Gamma$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph…

A subset $S$ of vertices of a graph $G$ is in \emph{general position} if no shortest path in $G$ contains three vertices of $S$. The \emph{general position problem} consists of finding the number of vertices in a largest general position…

For $\Lambda$-$n$-coalescents with mutation, we analyse the size $O_n$ of the partition block of $i\in\{1,\ldots,n\}$ at the time where the first mutation appears on the tree that affects $i$ and is shared with any other…