Related papers: Inducibility in the hypercube

Let $M_d$ be the centered Hardy-Littlewood maximal function associated to cubes in $\mathbb{R}^d$ with Lebesgue measure, and let $c_d$ denote the lowest constant appearing in the weak type (1,1) inequality satisfied by $M_d$. We show that…

For any two-dimensional nearest neighbor shift of finite type X and any integer n > 0, one can define the horizontal strip shift H_n(X) to be the set of configurations on Z x {1,...,n} which do not contain any forbidden transitions for X.…

Alspach [{\sl Bull. Inst. Combin. Appl.}~{\bf 52} (2008), 7--20] defined the maximal matching sequencibility of a graph $G$, denoted~$ms(G)$, to be the largest integer $s$ for which there is an ordering of the edges of $G$ such that every…

We confirm a conjecture of Fox, Pach, and Suk, that for every $d>0$, there exists $c>0$ such that every $n$-vertex graph of VC-dimension at most $d$ has a clique or stable set of size at least $n^c$. This implies that, in the language of…

If we 2-color the vertices of a large hypercube what monochromatic substructures are we guaranteed to find? Call a set S of vertices from Q_d, the d-dimensional hypercube, Ramsey if any 2-coloring of the vertices of Q_n, for n sufficiently…

We prove that a subset of the hypercube $(0,1)^d$ with volume sufficiently close to $\frac12$ has (relative) perimeter greater than or equal to $1$. This settles a conjecture by Brezis and Bruckstein. We also prove that, in contrast with…

We prove that for all natural numbers k,n,d with k <= d and every partition lambda of size kn with at most k parts there exists an irreducible GL(d, C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n) (C^d)). This…

A Latin hypercuboid of order $n$ is a $d$-dimensional matrix of dimensions $n\times n\times\cdots\times n\times k$, with symbols from a set of cardinality $n$ such that each symbol occurs at most once in each axis-parallel line. If $k=n$…

Let $I$ be an independent set drawn from the discrete $d$-dimensional hypercube $Q_d=\{0,1\}^d$ according to the hard-core distribution with parameter $\lambda>0$ (that is, the distribution in which each independent set $I$ is chosen with…

The two-dimensional Hubbard model is studied for small values of the interaction strength (U of the order of the hopping amplitude t), using a variational ansatz well suited for this regime. The wave function, a refined Gutzwiller ansatz,…

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…

Let $H$ be a fixed graph on $n$ vertices. Let $f_H(G) = 1$ iff the input graph $G$ on $n$ vertices contains $H$ as a (not necessarily induced) subgraph. Let $\alpha_H$ denote the cardinality of a maximum independent set of $H$. In this…

The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…

We consider an elastic manifold of internal dimension $d$ and length $L$ pinned in a $N$ dimensional random potential and confined by an additional parabolic potential of curvature $\mu$. We are interested in the mean spectral density…

For $n\geq 2$, let $\Gamma\subset \mathrm{SU}((n,1),\mathcal{O}_{K})$ be a torsion-free, finite-index subgroup, where $\mathcal{O}_K$ denotes the ring of integers of a totally imaginary number field $K$ of degree $2$. Let $\mathbb{B}^n$…

$Q_{n,p}$, the random subgraph of the $n$-vertex hypercube $Q_n$, is obtained by independently retaining each edge of $Q_n$ with probability $p$. We give precise values for the cover time of $Q_{n,p}$ above the connectivity threshold.

Let k>=3 be an integer, we prove that the maximum induced density of the k-vertex directed star in a directed graph is attained by an iterated blow-up construction. This confirms a conjecture by Falgas-Ravry and Vaughan, who proved this for…

An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…

For a fixed infinite graph $H$, we study the largest density of a monochromatic subgraph isomorphic to $H$ that can be found in every two-coloring of the edges of $K_{\mathbb{N}}$. This is called the Ramsey upper density of $H$, and was…

In this paper we study the connectivity properties of the random subgraph of the $n$-cube generated by the $k$-out model and denoted by $Q^n(k)$. Let $k$ be an integer, $1\leq k \leq n-1$. We let $Q^n(k)$ be the graph that is generated by…