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

We identify the maximally dense lattice packings of tangent-disk trimers with fixed bond angles ($\theta = \theta_0$) and contrast them to both their nonmaximally-dense-but-strictly-jammed lattice packings as well as the disordered jammed…

Let $Y_{3,2}$ be the 3-graph with two edges intersecting in two vertices. We prove that every 3-graph $ H $ on $ n $ vertices with at least $ \max \left \{ \binom{4\alpha n}{3}, \binom{n}{3}-\binom{n-\alpha n}{3} \right \}+o(n^3) $ edges…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

We study the Tur\'{a}n problem for highly symmetric bipartite graphs arising from geometric shapes and periodic tilings commonly found in nature. 1. The prism $C_{2\ell}^{\square}:=C_{2\ell}\square K_{2}$ is the graph consisting of two…

We show that for integers k > 1 and n > 2, the diameter of the Cayley graph of SL_n(Z/kZ) associated to a standard two-element generating set, is at most a constant times n^2 ln k. This answers a question of A. Lubotzky concerning SL_n(F_p)…

Tight $2 s$-designs are the $2 s$-$(v, k, \lambda)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs.…

We show that if M is a surface bundle over S^1 with fiber of genus 2, then for any integer n, M has a finite cover tilde(M) with b_1(tilde(M)) > n. A corollary is that M can be geometrized using only the `non-fiber' case of Thurston's…

Let $S\subset \text{SL}_2(\mathbb Z)\times \text{SL}_2(\mathbb Z)$ or $\text{SL}_2(\mathbb Z)\ltimes \mathbb Z^2$ be finite symmetric and assume $S$ generates a group $G$ which is a Zariski-dense subgroup $\text{SL}_2(\mathbb Z)\times…

We provide a complete classification of all tame and wild symmetric special multiserial algebras in terms of the underlying Brauer configuration. Our classification contains the symmetric special multiserial algebras of finite…

In our previous work arXiv:1306.1770, we found all Borel-Schur algebra of finite representation type. In the present article, we determine which Borel-Schur algebras of infinite representation type are tame, and which are wild.

The k-neighbor graph is a directed percolation model on the hypercubic lattice Z d in which each vertex independently picks exactly k of its 2d nearest neighbors at random, and we open directed edges towards those. We prove that the…

The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The…

We consider the dimer model on piecewise Temperleyan, simply connected domains, on families of graphs which include the square lattice as well as superposition graphs. We focus on the spanning tree $\mathcal{T}_\delta$ associated to this…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We consider (not necessarily proper) colorings of the vertices of a graph where every color is thoroughly distributed, that is, appears in every open neighborhood. Equivalently, every color is a total dominating set. We define $\td(G)$ as…

Let $G$ be a simple graph with a perfect matching. Deng and Zhang showed that the maximum anti-forcing number of $G$ is no more than the cyclomatic number. In this paper, we get a novel upper bound on the maximum anti-forcing number of $G$…

We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending…

If $G$ is a group and $S$ a generating set, $G$ canonically embeds into the automorphism group of its Cayley graph and it is natural to try to minimize, over all generating sets, the index of this inclusion. This infimum is called the…

It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…

SU(2) configurations, which have been generated by the Wilson action, are transformed to a Landau gauge and smoothed by Fourier filtering. This leads to sharp peaks in the field strengths and in related quantities. These spikes are caused…