English
Related papers

Related papers: $SL_k$-Tiling of the Plane

200 papers

We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…

Combinatorics · Mathematics 2011-06-10 Hidehiko Kamiya , Akimichi Takemura , Hiroaki Terao

The entries of frieze patterns may be interpreted as coordinates of roots of a finite Weyl groupoid of rank two. We prove the existence of maximal elements in their root posets and classify those frieze patterns which can be used to build…

Combinatorics · Mathematics 2014-06-25 Michael Cuntz

For any semiring, the concept of k-congruences is introduced, criteria for k-congruences are established, it is proved that there is an inclusion-preserving bijection between k-congruences and k-ideals, and an equivalent condition for the…

Rings and Algebras · Mathematics 2016-10-04 Song-Chol Han

We show that a basis of a semisimple Lie algebra of compact type, for which any diagonal left-invariant metric has a diagonal Ricci tensor, is characterized by the Lie algebraic condition of being "nice". Namely, the bracket of any two…

Differential Geometry · Mathematics 2021-12-30 Anusha M. Krishnan

Given a henselian pair $(R, I)$ of commutative rings, we show that the relative $K$-theory and relative topological cyclic homology with finite coefficients are identified via the cyclotomic trace $K \to \mathrm{TC}$. This yields a…

K-Theory and Homology · Mathematics 2020-07-21 Dustin Clausen , Akhil Mathew , Matthew Morrow

A linkage of order k of a graph G is a subgraph with k components, each of which is a path. A linkage is vital if it spans all vertices, and no other linkage connects the same pairs of end vertices. We give a characterization of the graphs…

Combinatorics · Mathematics 2011-07-19 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

Let $G=(V,E)$ be a graph of order $n$ and let $1\leq k< n$ be an integer. The $k$-token graph of $G$ is the graph whose vertices are all the $k$-subsets of $V$, two of which are adjacent whenever their symmetric difference is a pair of…

Combinatorics · Mathematics 2018-02-21 Walter Carballosa , Ruy Fabila-Monroy , Jesús Leaños , Luis Manuel Rivera

In this paper, we first prove a theorem by a little modification on the Lax-Milgram theorem. Then, using $K$-frames, we obtain lower and upper bounds for the results obtained from this theorem. Also, we present some methods for the…

Functional Analysis · Mathematics 2024-02-13 F. Javadi , M. J. Mehdipour

Although the prime numbers are deterministic, they can be viewed, by some measures, as pseudo-random numbers. In this article, we numerically study the pair statistics of the primes using statistical-mechanical methods, especially the…

Statistical Mechanics · Physics 2018-02-15 Ge Zhang , Fausto Martelli , Salvatore Torquato

We discuss a conjecture of Ingleton on excluded minors for base-orderability, and, extending a result he stated, we prove that infinitely many of the matroids that he identified are excluded minors for base-orderability, as well as for the…

Combinatorics · Mathematics 2024-08-07 Joseph E. Bonin , Thomas J. Savitsky

The bisector of two nonempty sets P and Q in a metric space is the set of all points with equal distance to P and to Q. A distance k-sector of P and Q, where k is an integer, is a (k-1)-tuple (C_1, C_2, ..., C_{k-1}) such that C_i is the…

Computational Geometry · Computer Science 2010-07-19 Keiko Imai , Akitoshi Kawamura , Jiří Matoušek , Daniel Reem , Takeshi Tokuyama

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

Geometric Topology · Mathematics 2016-02-25 Tarik Aougab

Let $A = \bigoplus_{n=0}^{\infty}A_n$ be a connected graded $k$-algebra over an algebraically closed field $k$ (thus $A_0=k$). Assume that a finite abelian group $G$, of order coprime to the characteristic of $k$, acts on $A$ by graded…

Rings and Algebras · Mathematics 2015-04-24 Andrew Davies

We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…

Functional Analysis · Mathematics 2014-05-30 Paul Poncet

Let $\cal T$ be a tiling of the plane with equilateral triangles no two of which share a side. We prove that if the side lengths of the triangles are bounded from below by a positive constant, then $\cal T$ is periodic and it consists of…

Combinatorics · Mathematics 2018-05-24 Janos Pach , Gabor Tardos

We construct a countable simple theory which, in Keisler's order, is strictly above the random graph (but "barely so") and also in some sense orthogonal to the building blocks of the recently discovered infinite descending chain. As a…

Logic · Mathematics 2019-07-29 M. Malliaris , S. Shelah

Let d > 1 and 0 < k < d. The k-plane transform satisies some Lp to Lq dilation-invariant inequality. In this case the best constant and the extremizers are explicitly known. We give a quantitative form of the inequality with respect to…

Classical Analysis and ODEs · Mathematics 2014-11-19 Alexis Drouot

We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…

Discrete Mathematics · Computer Science 2010-12-08 Emmanuel Jeandel , Pascal Vanier

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

Combinatorics · Mathematics 2014-02-25 Jan-Oliver Fröhlich , Ken-ichi Kawarabayashi , Theodor Müller , Julian Pott , Paul Wollan

We introduce the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) the two-variable fragment…

Logic in Computer Science · Computer Science 2024-09-04 Bartosz Bednarczyk , Daumantas Kojelis , Ian Pratt-Hartmann
‹ Prev 1 3 4 5 6 7 10 Next ›