Related papers: Strong marker sets and applications

For a positive integer $n$ let $\mathcal{X}_n$ be either the algebra $M_n$ of $n \times n$ complex matrices, the set $N_n$ of all $n \times n$ normal matrices, or any of the matrix Lie groups $\mathrm{GL}(n)$, $\mathrm{SL}(n)$ and…

Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

A graph $H$ is called strongly common if for every coloring $\phi$ of $K_n$ with two colors, the number of monochromatic copies of $H$ is at least the number of monochromatic copies of $H$ in a random coloring of $K_n$ with the same density…

We prove that, for every graph $F$ with at least one edge, there is a constant $c_F$ such that there are graphs of arbitrarily large chromatic number and the same clique number as $F$ in which every $F$-free induced subgraph has chromatic…

Let $d\ge 3$ be a fixed integer. Let $y:= y(p)$ be the probability that the root of an infinite $d$-regular tree belongs to an infinite cluster after $p$-bond-percolation. We show that for every constants $b,\alpha>0$ and $1<\lambda< d-1$,…

One method of constructing $(a^2+1, 2,a, 1)$-SEDFs (i.e., strong external difference families) in $\mathbb{Z}_{a^2+1}$ makes use of $\alpha$-valuations of complete bipartite graphs $K_{a,a}$. We explore this approach and we provide a…

We introduce a notion of genus range as a set of values of genera over all surfaces into which a graph is embedded cellularly, and we study the genus ranges of a special family of four-regular graphs with rigid vertices that has been used…

We resolve a 1983 question of Serre by constructing curves with many points of every genus over every finite field. More precisely, we show that for every prime power q there is a positive constant c_q with the following property: for every…

In this paper, we study the problem of certifying whether a graph is bipartite (i.e. $2$-colorable) with a locally checkable proof (LCP) that is able to hide a $2$-coloring from the verifier. More precisely, we say an LCP for $2$-coloring…

We performed a high-resolution angle-resolved photoemission spectroscopy study of the Tl$_{0.63}$K$_{0.37}$Fe$_{1.78}$Se$_2$ superconductor ($T_c=29$ K). We show the existence of two electronlike bands at the M$(\pi, 0)$ point which cross…

I prove that a closed $n$-regular set $E \subset \mathbb{R}^{d}$ with plenty of big projections has big pieces of Lipschitz graphs. This answers a question of David and Semmes.

A. Ya. Zaslavskii's results on the existence of a linear (affine) selection for a linear (affine) or superlinear (convex) map $\Phi : K \to 2^Y$ defined on a convex cone (convex set) $K$ having the interpolation property are extended. We…

This paper extends the result from Amnon Neeman regarding strong generators in Dperf(X), from X being a quasicompact, separated scheme to X being quasicompact, quasiseparated scheme that admits a separator. Neeman's result states a…

An explicit construction of infinite sequences of strongly regular digraphs with parameter sets $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$ is described. A computer program was used to find the initial digraphs. The remaining…

To investigate hyperbinary expansions of a nonnegative integer~$n$, an edge-labeled directed graph $A(n)$ has recently been introduced. After pointing out some new simple facts about its cyclomatic number, we give a relatively simple…

Let $d\geq 2$ be a positive integer, $K$ an algebraically closed field of characteristic not dividing $d$, $n\geq d+1$ a positive integer that is prime to $d$, $f(x)\in K[x]$ a degree $n$ monic polynomial without multiple roots, $C_{f,d}:…

Let $F$ and $G$ be simple finite undirected graphs. A graph $G$ is called $F$-irregular if any two of its distinct vertices belong to different numbers of copies of $F$ in $G$. According to the strong conjecture about $F$-irregular graphs…

A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree D has a strong edge coloring with at most 4D + 4 colors. We…

The property of spatial mixing and strong spatial mixing in spin systems has been of interest because of its implications on uniqueness of Gibbs measures on infinite graphs and efficient approximation of counting problems that are otherwise…