Related papers: Wildest $\mathrm{SL}_2$-tilings

Here we report the measurements of two-dimensional (2-D) spectra of the streamwise velocity ($u$) in a high Reynolds number turbulent boundary layer. A novel experiment employing multiple hot-wire probes was carried out at friction Reynolds…

Let $S=S_1S_2S_3\ldots S_n$ be a finite string. Write $S$ in the form $XYY\ldots Y=XY^k$, consisting of a prefix $X$ (which may be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest value of this integer $k$ is…

A group is called strongly bounded, if the speed with which it is generated by finitely many conjugacy classes has a positive, lower bound only dependent on the number of the conjugacy classes in question rather than the actual conjugacy…

There are finitely many graphs with diameter $2$ and girth 5. What if the girth 5 assumption is relaxed? Apart from stars, are there finitely many triangle-free graphs with diameter $2$ and no $K_{2,3}$ subgraph? This question is related to…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

Consider the problem of determining the maximal induced subgraph in a random $d$-regular graph such that its components remain bounded as the size of the graph becomes arbitrarily large. We show, for asymptotically large $d$, that any such…

This paper considers $n$-ribbon tilings of general regions and their per-tile entropy (the binary logarithm of the number of tilings divided by the number of tiles). We show that the per-tile entropy is bounded above by $\log_2 n$. This…

Let $TT_k$ denote the transitive tournament on $k$ vertices. Let $TT(h,k)$ denote the graph obtained from $TT_k$ by replacing each vertex with an independent set of size $h \geq 1$. The following result is proved: Let $c_2=1/2$, $c_3=5/6$…

It has been recently shown that if $X$ is an $n\times N$ matrix whose entries are i.i.d. standard complex Gaussian and $l_1$ is the largest eigenvalue of $X^*X$, there exist sequences $m_{n,N}$ and $s_{n,N}$ such that…

We use a class of Farey graphs introduced by the final three authors to enumerate the tame friezes over $\mathbb{Z}/n\mathbb{Z}$. Using the same strategy we enumerate the tame regular friezes over $\mathbb{Z}/n\mathbb{Z}$, thereby reproving…

Let $\mathcal{\scriptstyle{O}}_K$ be the ring of integers of an imaginary quadratic number field $K$. In this paper we give a new description of the maximal discrete extension of the group $SL_2(\mathcal{\scriptstyle{O}}_K)$ inside…

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number of $\mathcal{F}$ is the maximum number of copies of $T$ in an $\mathcal{F}$-free graph on $n$ vertices, denoted by $ex(n,T,\mathcal{F})$. When $T = K_r$,…

We consider a directed graph on the 2-dimensional integer lattice, placing a directed edge from vertex $(i_1,i_2)$ to $(j_1,j_2)$, whenever $i_1 \le j_1$, $i_2 \le j_2$, with probability $p$, independently for each such pair of vertices.…

A graph is $2$-planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal $2$-planar if no edge can be added such that the resulting graph remains…

What is the maximum number of copies of a fixed forest $T$ in an $n$-vertex graph in a graph class $\mathcal{G}$ as $n\to \infty$? We answer this question for a variety of sparse graph classes $\mathcal{G}$. In particular, we show that the…

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V|)+1 where V is the set of vertices of the graph.…

We study the linear list chromatic number, denoted $\lcl(G)$, of sparse graphs. The maximum average degree of a graph $G$, denoted $\mad(G)$, is the maximum of the average degrees of all subgraphs of $G$. It is clear that any graph $G$ with…

In this paper, we consider the problem of determining when two tensor networks are equivalent under a heterogeneous change of basis. In particular, to a string diagram in a certain monoidal category (which we call tensor diagrams), we…

Characterized are all simple undirected graphs $G$ such that any real symmetric matrix that has graph $G$ has no eigenvalues of multiplicity more than 2. All such graphs are partial 2-trees (and this follows from a result for rather general…

We consider classes of graphs, which we call thick graphs, that have the vertices of a corresponding thin graph replaced by cliques and the edges replaced by cobipartite graphs In particular, we consider the case of thick forests, which we…