English
Related papers

Related papers: Arithmetic Y-frieze patterns of width 3 and 4

200 papers

Every $K_4$-free graph on $n$ vertices has a set of $\lfloor n/2\rfloor$ vertices spanning at most $n^2/18$ edges.

Combinatorics · Mathematics 2024-10-08 Christian Reiher

Let A be an ample line bundle on a projective toric variety X of dimension n. We show that if l>=n-1+p, then A^l satisfies the property N_p. Applying similar methods, we obtain a combinatorial theorem: For a given lattice polytope P we give…

Algebraic Geometry · Mathematics 2007-05-23 Milena Hering

Thomassen in 1994 published a famous proof of the fact that the choosability of a planar graph is at most 5. Zhu in 2019 generalized this result by showing that the same bound holds for Alon-Tarsi numbers of planar graphs. We present an…

Combinatorics · Mathematics 2023-03-07 Jakub Kozik , Bartosz Podkanowicz

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

Combinatorics · Mathematics 2024-08-16 Thang Pham , Boqing Xue

The characterization of the finite minimal automorphic posets of width three is still an open problem. Niederle has shown that this task can be reduced to the characterization of the nice sections of width three which have a non-trivial…

Combinatorics · Mathematics 2026-05-14 Frank a Campo

We express a general multiple polylogarithm of weight n as an explicit linear combination of multiple polylogarithms of weight n in n-2 variables. We express a general multiple polylogarithm of weight 4 as an explicit linear combination of…

K-Theory and Homology · Mathematics 2011-01-11 Nicusor Dan

We give a complete description of the distance relation on the graph of $4$-ary simplex codes of dimension $2$. This is a connected graph of diameter $3$. For every vertex we determine the sets of all vertices at distance $i\in\{1,2,3\}$…

Combinatorics · Mathematics 2019-08-13 Mariusz Kwiatkowski , Mark Pankov

We use Floer's exact triangle to study the u-map (cup product with the 4-dimensional class) in the Floer cohomology groups of admissible SO(3) bundles over closed, oriented 3-manifolds. In the case of non-trivial bundles we show that…

Differential Geometry · Mathematics 2007-05-23 Kim A. Froyshov

Suppose that $\pi \: Y \to X$ is a finite map of normal varieties over a perfect field of characteristic $p > 0$. Previous work of the authors gave a criterion for when Frobenius splittings on $X$ (or more generally any $p^{-e}$-linear map)…

Algebraic Geometry · Mathematics 2012-01-31 Karl Schwede , Kevin Tucker

Let $[n]=X_1\cup X_2\cup X_3$ be a partition with $\lfloor\frac{n}{3}\rfloor \leq |X_i|\leq \lceil\frac{n}{3}\rceil$ and define $\mathcal{G}=\{G\subset [n]\colon |G\cap X_i|\leq 1, 1\leq i\leq 3\}$. It is easy to check that the trace…

Combinatorics · Mathematics 2023-01-18 Peter Frankl , Jian Wang

We describe pairs (p,n) such that n-dimensional affine space is fibered by pairwise skew p-dimensional affine subspaces. The problem is closely related with the theorem of Adams on vector fields on spheres and the Hurwitz-Radon theory of…

Algebraic Topology · Mathematics 2014-02-26 Valentin Ovsienko , Serge Tabachnikov

We construct frieze patterns of type D_N with entries which are numbers of matchings between vertices and triangles of corresponding triangulations of a punctured disc. For triangulations corresponding to orientations of the Dynkin diagram…

Combinatorics · Mathematics 2020-12-21 Karin Baur , Bethany Marsh

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are…

Combinatorics · Mathematics 2007-05-23 Jonathan David Farley

Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…

Combinatorics · Mathematics 2026-02-25 Sean Dewar , Anthony Nixon , Ben Smith

Congruence between two n-point sets in 4 dimension can be checked in O(n log n) time. On the way to establishing this result, we revisit several parts of 4-dimensional geometry, such as angles and distances between planes, Hopf fibrations,…

Computational Geometry · Computer Science 2016-03-24 Heuna Kim , Günter Rote

The complete tree-level S-matrix of four dimensional ${\cal N}=4$ super Yang-Mills and ${\cal N} = 8$ supergravity has compact forms as integrals over the moduli space of certain rational maps. In this note we derive formulas for amplitudes…

High Energy Physics - Theory · Physics 2015-06-16 Freddy Cachazo , Song He , Ellis Ye Yuan

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

Discrete Mathematics · Computer Science 2020-10-06 N. R. Aravind , Udit Maniyar

We use a class of Farey graphs introduced by the final three authors to enumerate the tame friezes over $\mathbb{Z}/n\mathbb{Z}$. Using the same strategy we enumerate the tame regular friezes over $\mathbb{Z}/n\mathbb{Z}$, thereby reproving…

Combinatorics · Mathematics 2024-11-01 Sammy Benzaira , Ian Short , Matty van Son , Andrei Zabolotskii

Let X and Y be finite dimensional normed spaces, F(X,Y) a collection of all mappings from X into Y. A mapping $P\in F(X,Y)$ is said to be piecewise affine if there exists a finite family of convex polyhedral subsets covering X and such that…

Functional Analysis · Mathematics 2011-11-08 V. V. Gorokhovik

A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…

Computational Geometry · Computer Science 2007-05-23 Helmut Alt , Maike Buchin
‹ Prev 1 3 4 5 6 7 10 Next ›