相关论文: Bounded quantifier depth spectrum for random unifo…

A $k$-ordering of a graph $G$ assigns distinct order-labels from the set $\{1,\ldots,|G|\}$ to $k$ vertices in $G$. Given a $k$-ordering $H$, the ordered Ramsey number $R_<(H)$ is the minimum $n$ such that every edge-2-coloring of the…

A $k$-dispersed labelling of a graph $G$ on $n$ vertices is a labelling of the vertices of $G$ by the integers $1, \dots , n$ such that $d(i,i+1) \geq k$ for $1 \leq i \leq n-1$. $DL(G)$ denotes the maximum value of $k$ such that $G$ has a…

We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.

The colored neighborhood metric for sparse graphs was introduced by Bollob\'as and Riordan. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm. We prove that even in this refined sense, the…

We establish an upper bound on the spectral gap for compact quantum graphs which depends only on the diameter and total number of vertices. This bound is asymptotically sharp for pumpkin chains with number of edges tending to infinity.

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…

The angular bispectrum of spherical random fields has recently gained an enormous importance, especially in connection with statistical inference on cosmological data. In this paper, we provide expressions for its moments of arbitrary order…

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

For a $k$-uniform hypergraph $H$, we obtain some trace formulas for the Laplacian tensor of $H$, which imply that $\sum_{i=1}^nd_i^s$ ($s=1,\ldots,k$) is determined by the Laplacian spectrum of $H$, where $d_1,\ldots,d_n$ is the degree…

For an irrational number $x\in [0,1)$, let $x=[a\_1(x), a\_2(x),\cdots]$ be its continued fraction expansion. Let $\psi : \mathbb{N} \rightarrow \mathbb{N}$ be a function with $\psi(n)/n\to \infty$ as $n\to\infty$. The (upper, lower) fast…

Min-entropy sampling gives a bound on the min-entropy of a randomly chosen subset of a string, given a bound on the min-entropy of the whole string. K\"onig and Renner showed a min-entropy sampling theorem that holds relative to quantum…

We establish a new spectral inequality for the quantified estimation of the $H^s$-norm, $s\ge 0$ of a finite linear combination of eigenfunctions in a domain in terms of its $H^s$-norm in a strictly open subset of the whole domain. The…

Unitary t-designs are distributions on the unitary group whose first t moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate…

The quantum color coding scheme proposed by Korff and Kempe (quant-ph/0405086) is easily extended so that the color coding quantum system is allowed to be entangled with an extra auxiliary quantum system. It is shown that in the extended…

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

We determine criteria for the prime spectrum of an ambiskew polynomial algebra $R$ over an algebraically closed field $K$ to be akin to those of two of the principal examples of such an algebra, namely the universal enveloping algebra…

Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…

Given a $k$-uniform hypergraph $G$ with vertex set $[n]$ and edge set $E(G)$, the ABC tensor $\mathcal{ABC}(G)$ of $G$ is the $k$-order $n$-dimensional tensor with \[ \mathcal{ABC}(G)_{i_1, \dots, i_k}= \begin{cases}…

We study the spectrum of unbounded J-self-adjoint block operator matrices. In particular, we prove enclosures for the spectrum, provide a sufficient condition for the spectrum being real and derive variational principles for certain real…