Related papers: Strong marker sets and applications

We show that there exist constants $\alpha,\epsilon>0$ such that for every positive integer $n$ there is a continuous odd function $f:S^m\to S^n$, with $m\geq \alpha n$, such that the $\epsilon$-expansion of the image of $f$ does not…

Let m be a positive integer and A an elementary abelian group of order q^r with r greater than or equal to 2 acting on a finite q'-group G. We show that if for some integer d such that 2^{d} is less than or equal to (r-1) the dth derived…

We give sharp bounds in Breuillard, Green and Tao's finitary version of Gromov's theorem on groups with polynomial growth. Precisely, we show that for every non-negative integer d there exists $c=c(d)>0$ such that if $G$ is a group with…

We complete and precise the results of [B.13] and we prove a strong version of the semi-proper direct image theorem with values in the space C f n (M) of finite type closed n--cycles in a complex space M. We describe the strongly…

A strong edge coloring of a graph $G$ is a proper edge coloring of $G$ such that every color class is an induced matching. The minimum number of colors required is termed the strong chromatic index. In this paper, we determine the exact…

We study $1$-perfect codes in Doob graphs $D(m,n)$. We show that such codes that are linear over $GR(4^2)$ exist if and only if $n=(4^{g+d}-1)/3$ and $m=(4^{g+2d}-4^{g+d})/6$ for some integers $g \ge 0$ and $d>0$. We also prove necessary…

In this paper, we study pattern matching in the set F_{n,k} of fillings of the k x n rectangle with the integers 1,...,kn such that the elements in any column increase from bottom to top. Let P be a column strict tableau of shape 2^k. We…

We show, for any positive integer k, that there exists a graph in which any equitable partition of its vertices into k parts has at least ck^2/\log^* k pairs of parts which are not \epsilon-regular, where c,\epsilon>0 are absolute…

Although the property of strong metric subregularity of set-valued mappings has been present in the literature under various names and with various definitions for more than two decades, it has attracted much less attention than its older…

We establish for the matrix group $G=\mathrm{SL}_{n}\left(\mathbb{F}_{p}\right)$ that there exist absolute constants $c\in\left(0,1\right)$ and $C>0$ such that any symmetric generating set $A$, with $\left|A\right|\geq\left|G\right|^{1-c}$…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

In this follow-up paper, we again inspect a surprising relationship between the set of fixed points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ or $\in \mathbb{Z}_{p}$ or…

We prove boundedness of global strong $(\delta,n)$-complements for generalized $\epsilon$-log canonical pairs of Fano type. We also prove some partial results towards boundedness of local strong $(\delta,n)$-complements for semi-stable…

In this paper we study nonlinear interpolation problems for interpolation and peak-interpolation sets of function algebras. The subject goes back to the classical Rudin-Carleson interpolation theorem. In particular, we prove the following…

We study orbits and fixed points of polynomials in a general skew polynomial ring $D[x,\sigma, \delta]$. We extend results of the first author and Vishkautsan on polynomial dynamics in $D[x]$. In particular, we show that if $a \in D$ and $f…

We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be…

Let $p$ be an odd prime and $F_\infty$ be a $\mathbb{Z}_p$-extension of a number field $F$. Given an elliptic curve $E$ over $F$, we study the structure of the fine Selmer group over $F_\infty$. It is shown that under certain conditions,…

Let $H$ be a graph with $\Delta(H) \leq 2$, and let $G$ be obtained from $H$ by gluing in vertex-disjoint copies of $K_4$. We prove that if $H$ contains at most one odd cycle of length exceeding $3$, or if $H$ contains at most $3$…

A strong edge-coloring of a graph $G$ is an assignment of colors to edges such that every color class induces a matching. We here focus on bipartite graphs whose one part is of maximum degree at most $3$ and the other part is of maximum…

The class of strictly sign regular (SSR) matrices has been extensively studied by many authors over the past century, notably by Schoenberg, Motzkin, Gantmacher, and Krein. A classical result of Gantmacher-Krein assures the existence of SSR…