English
Related papers

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

200 papers

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Number Theory · Mathematics 2021-02-12 Ron Brown

When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a…

Number Theory · Mathematics 2016-05-31 Maciej Borodzik , Danny Nguyen , Sinai Robins

We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…

Category Theory · Mathematics 2010-01-06 Petter Andreas Bergh , Steffen Oppermann

The term "strong approximation" is used to describe phenomena where an arithmetic group as well as all of its Zariski dense subgroups have a large image in the congruence quotients. We exhibit analogues of such phenomena in a probabilistic,…

Combinatorics · Mathematics 2009-05-05 Yair Glasner

We consider the thickness $\theta (G))$ and outerthickness $\theta _o(G)$ of a graph G in terms of its orientable and nonorientable genus. Dean and Hutchinson provided upper bounds for thickness of graphs in terms of their orientable genus.…

Combinatorics · Mathematics 2015-12-17 Baogang Xu , Xiaoya Zha

There are two types of Belyi's Theorem for curves defined over finite fields of characteristic p, namely the Wild and the Tame p-Belyi Theorems. In this paper, we discuss them in the language of function fields. We provide a self-contained…

Number Theory · Mathematics 2018-11-05 Nurdagul Anbar , Seher Tutdere

We examine several types of visibility graphs in which sightlines can pass through $k$ objects. For $k \geq 1$ we bound the maximum thickness of semi-bar $k$-visibility graphs between $\lceil \frac{2}{3} (k + 1) \rceil$ and $2k$. In…

Combinatorics · Mathematics 2014-11-14 Matthew Babbitt , J. T. Geneson , Tanya Khovanova

It has been shown recently that the toroidally compactified type IIB string effective action possesses an SL(2, R) invariance. Using this symmetry we construct an infinite family of macroscopic string-like solutions permuted by SL(2, Z)…

High Energy Physics - Theory · Physics 2010-11-19 Shibaji Roy

We study the number of tilings of skew Young diagrams by ribbon tiles shaped like Dyck paths, in which the tiles are "vertically decreasing". We use these quantities to compute pairing probabilities in the double-dimer model: Given a planar…

Combinatorics · Mathematics 2012-05-31 Richard W. Kenyon , David B. Wilson

The study of upper density problems on Ramsey theory was initiated by Erd\H{o}s and Galvin in 1993. In this paper we are concerned with the following problem: given a fixed finite graph $F$, what is the largest value of $\lambda$ such that…

Combinatorics · Mathematics 2020-10-27 József Balogh , Ander Lamaison

The Fiedler value $\lambda_2$, also known as algebraic connectivity, is the second smallest Laplacian eigenvalue of a graph. We study the maximum Fiedler value among all planar graphs $G$ with $n$ vertices, denoted by $\lambda_{2\max}$, and…

Combinatorics · Mathematics 2020-07-21 Lali Barrière , Clemens Huemer , Dieter Mitsche , David Orden

We consider a prototypical two-parameter family of invertible maps of $\mathbb{Z}^2$, representing rotations with decreasing rotation number. These maps describe the dynamics inside the island chains of a piecewise affine discrete twist map…

Dynamical Systems · Mathematics 2017-09-27 Fairuz Alwani , Franco Vivaldi

Reiher, R\"odl, Sales, and Schacht initiated the study of relative Tur\'an densities of ordered graphs and showed that it is more subtle and interesting than the unordered case. For an ordered graph $F$, its relative Tur\'an density,…

Combinatorics · Mathematics 2025-11-27 Freddie Illingworth , Arjun Ranganathan , Leo Versteegen , Ella Williams

We construct a sequence of lattices $\{L_{n_i}\subset \mathbb R^{n_i}\}$ for $n_i\longrightarrow\infty$, with exponentially large kissing numbers, namely, $\log_2\tau(L_{n_i})> 0.0338\cdot n_i -o(n_i)$. We also show that the maximum lattice…

Number Theory · Mathematics 2024-10-02 Serge Vlăduţ

Let r, s >= 2 be integers. Suppose that the number of blue r-cliques in a red/blue coloring of the edges of the complete graph K_n is known and fixed. What is the largest possible number of red s-cliques under this assumption? The well…

Combinatorics · Mathematics 2013-12-10 Hao Huang , Nati Linial , Humberto Naves , Yuval Peled , Benny Sudakov

This paper deals with stratifying systems over hereditary algebras. In the case of tame hereditary algebras we obtain a bound for the size of the stratifying systems composed only by regular modules and we conclude that stratifying systems…

Representation Theory · Mathematics 2013-08-27 Paula A. Cadavid , Eduardo do N. Marcos

We present the rest-frame B-band Tully-Fisher relation for a sample of 8 cluster spiral galaxies at z = 0.83 and 19 field spirals at z = 0.15-0.90 based on VLT spectroscopy and HST photometry. No strong difference is detected between the…

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

Metric Geometry · Mathematics 2025-05-07 Károly Bezdek , Zsolt Lángi

We detail an explicit construction of ordinary irreducible representations for the family of finite groups $SL_2({\mathbb Z} /p^n {\mathbb Z})$ for odd primes $p$ and $n\geq 2$. For $n=2$, the construction is a complete set of irreducible…

Representation Theory · Mathematics 2018-11-08 Benjamin K. Breen , Daryl R. Deford , Jason D. Linehan , Daniel N. Rockmore

Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, then we call the colouring t-bounded, and the t-bounded…

Combinatorics · Mathematics 2024-09-27 Annika Heckel , Konstantinos Panagiotou