Related papers: Large sets avoiding linear patterns

We show that, given a set $E\subset \mathbb R^{n+1}$ with finite $n$-Hausdorff measure $H^n$, if the $n$-dimensional Riesz transform $$R_{H^n|E} f(x) = \int_{E} \frac{x-y}{|x-y|^{n+1}} f(y) dH^n(y)$$ is bounded in $L^2(H^n|E)$, then $E$ is…

We prove that the number of permutations avoiding an arbitrary consecutive pattern of length m is asymptotically largest when the avoided pattern is 12...m, and smallest when the avoided pattern is 12...(m-2)m(m-1). This settles a…

A $d$-dimensional zero-one matrix $A$ avoids another $d$-dimensional zero-one matrix $P$ if no submatrix of $A$ can be transformed to $P$ by changing some ones to zeroes. Let $f(n,P,d)$ denote the maximum number of ones in a $d$-dimensional…

This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321.…

We prove that there exists a dimension group $G$ whose positive cone is not isomorphic to the dimension monoid Dim$L$ of any lattice $L$. The dimension group $G$ has an order-unit, and can be taken of any cardinality greater than or equal…

In the last decade a huge amount of articles has been published studying pattern avoidance on permutations. From the point of view of enumeration, typically one tries to count permutations avoiding certain patterns according to their…

Let ${\cal A}=\{A_1,\ldots, A_r\}$ be a partition of a set $\{1,\ldots,m\}\times\{1,\ldots, n\}$ into $r$ nonempty subsets, and $A=(a_{ij})$ be an $m\times n$ matrix. We say that $A$ has a pattern ${\cal A}$ provided that $a_{ij}=a_{i'j'}$…

We study how the geometry of a projective variety $X$ is reflected in the positivity properties of the diagonal $\Delta_X$ considered as a cycle on $X \times X$. We analyze when the diagonal is big, when it is nef, and when it is rigid. In…

Kolmogorov asked the following question: can every bounded measurable set in the plane be mapped onto a polygon by a 1-Lipschitz map with arbitrarily small measure loss? The answer is negative in general, however, the case of compact sets…

We consider a random permutation drawn from the set of permutations of length $n$ that avoid some given set of patterns of length 3. We show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after suitable…

This note presents an analytic technique for proving the linear independence of certain small subsets of real numbers over the rational numbers. The applications of this test produce simple linear independence proofs for the subsets of…

Continuous functions on the unit interval are relatively tame from the logical and computational point of view. A similar behaviour is exhibited by continuous functions on compact metric spaces equipped with a countable dense subset. It is…

In this article, we study two problems concerning the size of the set of finite point configurations generated by a compact set $E\subset \mathbb{R}^d$. The first problem concerns how the Lebesgue measure or the Hausdorff dimension of the…

Mesh patterns are a generalization of classical permutation patterns that encompass classical, bivincular, Bruhat-restricted patterns, and some barred patterns. In this paper, we describe all mesh patterns whose avoidance is coincident with…

For a graph $H$ let $c(H)$ denote the supremum of $|E(G)|/|V(G)|$ taken over all non-null graphs $G$ not containing $H$ as a minor. We show that $$c(H) \leq \frac{|V(H)|+\mathrm{comp}(H)}{2}-1,$$ when $H$ is a union of cycles, verifying…

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

Let $\mathcal A=\{A_1,\ldots,A_n\}$ be a family of sets in the plane. For $0 \leq i < n$, denote by $f_i$ the number of subsets $\sigma$ of $\{1,\ldots,n\}$ of cardinality $i+1$ that satisfy $\bigcap_{i \in \sigma} A_i \neq \emptyset$. Let…

Let $m,n$ be positive integers. In this short note we prove that the set of all continuous and surjective functions from $\mathbb{R}^{m}$ to $\mathbb{R}^{n}$ contains (excluding the 0 function) a $\mathfrak{c}$-dimensional vector space.…

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…