中文
相关论文

相关论文: Arithmetic Y-frieze patterns of width 3 and 4

200 篇论文

A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…

组合数学 · 数学 2017-09-22 Diego Nicodemos , Matěj Stehlík

Frieze patterns are combinatorial objects that are deeply related to cluster theory. Determinants of frieze patterns arise from triangular regions of the frieze, and they have been considered in previous works by Broline-Crowe-Isaacs, and…

组合数学 · 数学 2023-10-24 Juan Pablo Maldonado

We extend a recent argument of Kahn, Narayanan and Park (Proceedings of the AMS, to appear) about the threshold for the appearance of the square of a Hamilton cycle to other spanning structures. In particular, for any spanning graph, we…

组合数学 · 数学 2021-06-21 Alberto Espuny Díaz , Yury Person

The following article is one of introduction to additive frieze patterns, linking the subject to multiplicative frieze patterns. We also add two new theorems about additive frieze patterns (see theorem 2 and 5) and a conjecture about…

组合数学 · 数学 2012-05-24 Jean-François Marceau

In this paper we develop a new geometric approach to subtractive continued fraction algorithms in high dimensions. We adapt a version of Farey summation to the geometric techniques proposed by F. Klein in 1895. More specifically we…

数论 · 数学 2025-10-30 Oleg Karpenkov , Matty van Son

The $\lambda$-quiddities of size $n$ are $n$-tuples of elements of a fixed set, solutions of a matrix equation appearing in the study of Coxeter's friezes. Their number and their properties are closely linked to the structure and the…

组合数学 · 数学 2024-02-16 Flavien Mabilat

Frieze patterns are defined by objects of a category of Dyck paths, to do that, it is introduced the notion of diamond of Dynkin type An. Such diamonds constitute a tool to build integral frieze patterns.

We discuss here the geometry of frieze patterns, and add a few words about Greek vases, molecular symmetry, and 2D crystallography. The work is written primarily for school students.

历史与综述 · 数学 2023-12-05 Aleksei Panov , Dmitri Panov , Peter Panov

We compute the partition function of the Potts model with arbitrary values of $q$ and temperature on some strip lattices. We consider strips of width $L_y=2$, for three different lattices: square, diced and `shortest-path' (to be defined in…

统计力学 · 物理学 2015-03-13 Pedro D. Alvarez , Fabrizio Canfora , Sebastian A. Reyes , Simon Riquelme

We show the quarter of a century old conjecture that every $K_4$-free graph with $n$ vertices and $\lfloor n^2/4 \rfloor +k$ edges contains $k$ pairwise edge disjoint triangles.

组合数学 · 数学 2015-06-11 Ervin Győri , Balázs Keszegh

We study the projective closures of three important families of affine monomial curves in dimension $4$, namely the Backelin curve, the Bresinsky curve and the Arslan curve, in order to explore possible connections between syzygies and the…

交换代数 · 数学 2022-12-16 Joydip Saha , Indranath Sengupta , Pranjal Srivastava

It is a well-known fact that the first and last non-trivial coefficients of the characteristic polynomial of a linear operator are respectively its trace and its determinant. This work shows how to compute recursively all the coefficients…

数学物理 · 物理学 2007-05-23 Ronaldo Rodrigues Silva

We are interested in conjecturing the sign of the pizza quantity P(H,B(a,R)) for the irreducible Coxeter arrangements H of type A_n, where n=2,3 bmod 4, and type D_n, where n is odd. Our approach is to express the pizza quantity in terms of…

组合数学 · 数学 2024-10-18 Richard Ehrenborg

Each acyclic graph, and more generally, each acyclic orientation of the graph associated to a Cartan matrix, allows to define a so-called frise; this is a collection of sequences over the positive natural numbers, one for each vertex of the…

环与代数 · 数学 2009-06-12 Ibrahim Assem , Christophe Reutenauer , David Smith

Treewidth is an important and well-known graph parameter that measures the complexity of a graph. The Kneser graph Kneser(n,k) is the graph with vertex set $\binom{[n]}{k}$, such that two vertices are adjacent if they are disjoint. We…

组合数学 · 数学 2015-06-08 Daniel J. Harvey , David R. Wood

We consider planar maps adjusted with a (regular critical) Boltzmann distribution and show that the expected number of pattern occurrences of a given map is asymptotically linear when the number n of edges goes to infinity. The main…

组合数学 · 数学 2019-05-20 Michael Drmota , Benedikt Stufler

Map vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least a unit distance apart. The plane-width of a graph is the minimum diameter of the image of the vertex set over all…

离散数学 · 计算机科学 2013-01-08 Marcin Kaminski , Paul Medvedev , Martin Milanic

We study non-zero integral friezes for Dynkin types $A_n$, $B_n$, $C_n$, $D_n$ and $G_2$. These differ from standard Coxeter-Conway (positive) friezes by allowing any non-zero integer to appear. In each case we show that there are either…

组合数学 · 数学 2014-09-23 Bruce Fontaine

The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…

高能物理 - 理论 · 物理学 2008-02-03 R. Coquereaux

We prove flexibility of two families of affine varieties: the complement in $\mathbb{P}^n$ of a projective quadric of rank at least three and affine cones over a smooth complete intersection of two quadrics in $\mathbb{P}^{n + 2}$, $n \ge…

代数几何 · 数学 2025-12-08 Kirill Shakhmatov , Hoang Le Truong