Related papers: Large sets avoiding linear patterns

We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…

We consider non-negative solutions to some infinite-dimensional SDEs on $\mathbb{Z}^d$ with H\"older continuous noise coefficients. We prove that if the H\"older exponent is less than $1/2$, solutions are compactly supported for almost all…

We prove that a typical compact set does not contain any similar copy of a given pattern. We also prove that a typical compact set of $[0,1]^{d} (d\geq 2)$ intersects any $(d-1)$-dimensional plane in at most $d$ points. We study the…

We prove that in a Euclidean space of dimension at least two, there exists a compact set of Lebesgue measure zero such that any real-valued Lipschitz function defined on the space is differentiable at some point in the set. Such a set is…

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

After fixing a canonical ordering (or labeling) of the elements of a finite poset, one can associate each linear extension of the poset with a permutation. Some recent papers consider specific families of posets and ask how many linear…

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb N$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Our…

We say that $E$ is a microset of the compact set $K\subset \mathbb{R}^d$ if there exist sequences $\lambda_n\geq 1$ and $u_n\in \mathbb{R}^d$ such that $(\lambda_n K + u_n ) \cap [0,1]^d$ converges to $E$ in the Hausdorff metric, and…

We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance in permutations on partially ordered sets. The number of permutations on $P$ that avoid the pattern $\pi$ is denoted $Av_P(\pi)$. We…

We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a…

Let $\alpha\in(0,1)$, $K\geq 1$, and $d=2\frac{1+\alpha K}{1+K}$. Given a compact set $E\subset\C$, it is known that if $\H^d(E)=0$ then $E$ is removable for $\alpha$-H\"older continuous $K$-quasiregular mappings in the plane. The sharpness…

Large algebraic structures are found inside the space of sequences of continuous functions on a compact interval having the property that, the series defined by each sequence converges absolutely and uniformly on the interval but the series…

We study pattern avoidance by combinatorial objects other than permutations, namely by ordered partitions of an integer and by permutations of a multiset. In the former case we determine the generating function explicitly, for integer…

Michalski gave a short and elegant proof of a theorem of A. Kumar which states that for each set A in R, there exists a subset B of A which is full in A and such that no distance between points in B is a rational number. He also proved a…

A $1$-avoiding set is a subset of $\mathbb{R}^n$ that does not contain pairs of points at distance $1$. Let $m_1(\mathbb{R}^n)$ denote the maximum fraction of $\mathbb{R}^n$ that can be covered by a measurable $1$-avoiding set. We prove two…

We show that for any infinite set $A$ in ${\mathbb R}$, there exists a compact set $E \subseteq \mathbb{R}$ of positive Lebesgue measure that does not contain any non-trivial affine copy of $A$. This proves the Erd\"os similarity…

If $g$ is a map from a space $X$ into $\mathbb R^m$ and $q$ is an integer, let $B_{q,d,m}(g)$ be the set of all lines $\Pi^d\subset\mathbb R^m$ such that $|g^{-1}(\Pi^d)|\geq q$. Let also $\mathcal H(q,d,m,k)$ denote the maps $g\colon…

We show that for arbitrary linearly ordered set $X$ any bounded family of (not necessarily, continuous) real valued functions on $X$ with bounded total variation does not contain independent sequences. We obtain generalized Helly's…