English
Related papers

Related papers: $SL_k$-Tilings and Paths in $\mathbb{Z}^k$

200 papers

A $k$-modal sequence is a sequence of real numbers that can be partitioned into $k+1$ (possibly empty) monotone sections such that adjacent sections have opposite monotonicities. For every positive integer $k$, we prove that any sequence of…

Combinatorics · Mathematics 2024-03-21 Zijian Xu

This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…

Combinatorics · Mathematics 2025-03-19 Valcho Milchev

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…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár

Let k be a non archimedean field. If X is a k-algebraic variety and U a locally closed semi-algebraic subset of X^{an} -- the Berkovich space associated to X -- we show that for l \neq char(\tilde{k}), the cohomology groups H^i_c (\bar{U},…

Algebraic Geometry · Mathematics 2016-10-27 Florent Martin

Several complete congruences on the lattice L(CR) of varieties of completely regular semi- groups have been fundamental to studies of the structure of L(CR). These are the kernel relation K , the left trace relation Tl , the right trace…

Rings and Algebras · Mathematics 2018-05-25 Norman R. Reilly

We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…

Combinatorics · Mathematics 2016-08-05 Gasper Fijavz , Matthias Kriesell

Motivated by the desire for a new kind of approximation, we define a type of localization called pixelation. We present how pixelation manifests in representation theory and in the study of sites and sheaves. A path category is constructed…

Category Theory · Mathematics 2026-03-27 J. Daisie Rock

We prove the existence of a sequence of commutative diagrams generalizing existing results on the cohomology of the Borel-Serre boundary and well-rounded retract to the context of the well-tempered complex. Our main theorem provides a…

Number Theory · Mathematics 2025-10-21 Dylan Galt , Mark McConnell

In relation to Fuglede's conjecture, we establish several Plancherel-type identities and demonstrate the surjectivity of the Fourier transform between certain unbounded tiling sets of $\mathbb{R}$ that are in duality. In the terminology…

Functional Analysis · Mathematics 2026-03-05 Piyali Chakraborty , Dorin Ervin Dutkay

In this thesis we will present and discuss various results pertaining to tiling problems and mathematical logic, specifically computability theory. We focus on Wang prototiles, as defined in [32]. We begin by studying Domino Problems, and…

Logic · Mathematics 2023-07-26 Mark Carney

Lattice tilings of $\mathbb{Z}^n$ by limited-magnitude error balls correspond to linear perfect codes under such error models and play a crucial role in flash memory applications. In this work, we establish three main results. First, we…

Combinatorics · Mathematics 2025-05-14 Ka Hin Leung , Ran Tao , Daohua Wang , Tao Zhang

We present three bijections, the first between little Schr\"{o}der paths and a class of growth-constrained integer sequences, the second between lattice paths consisting of steps with nonnegative slope and another class of…

Combinatorics · Mathematics 2021-12-14 David Callan

For the ordered set $[n]$ of $n$ elements, we consider the class $\Bscr_n$ of bases $B$ of tropical Pl\"ucker functions on $2^{[n]}$ such that $B$ can be obtained by a series of mutations (flips) from the basis formed by the intervals in…

Combinatorics · Mathematics 2010-11-15 Vladimir I. Danilov , Alexander V. Karzanov , Gleb A. Koshevoy

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal…

Discrete Mathematics · Computer Science 2014-01-03 Nathan Lindzey , Ross M. McConnell

Given a graph $G(V, E)$ and a positive integer $k$ ($k \geq 1$), a simple path on $k$ vertices is a sequence of $k$ vertices in which no vertex appears more than once and each consecutive pair of vertices in the sequence are connected by an…

Data Structures and Algorithms · Computer Science 2023-04-18 Thai Bui

We prove that $KL_k(\mathfrak{sl}_m)$ is a semi-simple, rigid braided tensor category for all even $m\ge 4$, and $k= -\frac{m+1}{2}$ which generalizes result from arXiv:2103.02985 obtained for $m=4$. Moreover, all modules in…

Quantum Algebra · Mathematics 2022-12-02 Drazen Adamovic , Thomas Creutzig , Ozren Perse , Ivana Vukorepa

Under suitable conditions, a substitution tiling gives rise to a Smale space, from which three equivalence relations can be constructed, namely the stable, unstable, and asymptotic equivalence relations. We denote with $S$, $U$, and $A$…

Operator Algebras · Mathematics 2018-09-25 Daniel Gonçalves , Maria Ramirez-Solano

We give a process to construct non-split, three-dimensional simple Lie algebras from involutions of sl(2,k), where k is a field of characteristic not two. Up to equivalence, non-split three-dimensional simple Lie algebras obtained in this…

Rings and Algebras · Mathematics 2023-11-28 Philippe Meyer

Let $l$ and $k$ be two integers such that $l|k$. Define $T_l^k(X):=X+X^{p^l}+\cdots+X^{p^{l(k/l-2)}}+X^{p^{l(k/l-1)}}$ and $S_l^k(X):=X-X^{p^l}+\cdots+(-1)^{(k/l-1)}X^{p^{l(k/l-1)}}$, where $p$ is any prime. This paper gives explicit…

Information Theory · Computer Science 2020-02-19 Sihem Mesnager , Kwang Ho Kim , Jong Hyok Choe , Dok Nam Lee

We present a bijection between the set of standard Young tableaux of staircase minus rectangle shape, and the set of marked shifted standard Young tableaux of a certain shifted shape. Numerically, this result is due to DeWitt (2012).…

Combinatorics · Mathematics 2021-05-18 Zachary Hamaker , Alejandro H. Morales , Igor Pak , Luis Serrano , Nathan Williams