English
Related papers

Related papers: Simple Euclidean arrangements with one (>=5)-gon

200 papers

Let L be a finite-dimensional simple Lie algebra over an algebraically closed field of F characteristic p>3. We prove that if the p-envelope of L in the derivation algebra of L contains nonstandard tori of maximal dimension, then p=5 and L…

Representation Theory · Mathematics 2008-08-11 Alexander Premet , Helmut Strade

Let (G,w) be a weighted graph. The necessary and sufficient conditions under which a weight w : E(G)-->R^+ can be extended to a pseudoultrametric on V(G) are found. A criterion of the uniqueness of this extension is also obtained. It is…

Metric Geometry · Mathematics 2011-11-01 O. Dovgoshey , E. Petrov

The action of $PGL(2,2^m)$ on the set of exterior lines to a nonsingular conic in $PG(2,2^m)$ affords an association scheme, which was shown to be pseudocyclic in Hollmann's thesis in 1982. It was further conjectured in Hollmann's thesis…

Combinatorics · Mathematics 2007-05-23 Henk D. L. Hollmann , Qing Xiang

Let P be a planar n-point set. A k-partition of P is a subdivision of P into n/k parts of roughly equal size and a sequence of triangles such that each part is contained in a triangle. A line is k-shallow if it has at most k points of P…

Computational Geometry · Computer Science 2012-02-03 Wolfgang Mulzer , Daniel Werner

We consider hyperbolic manifolds with boundary, which admit an ideal triangulation with n ideal triangles and one edge. We prove that the number of these manifolds is $\exp(n\ln(n)+O(n))$.

Combinatorics · Mathematics 2015-06-30 A. Magazinov , I. Shnurnikov

Let $P$ be a finite poset of width two, i.e., with no three-element antichain. We associate with $P$ a skew Young diagram $\Upsilon(P)$ and discuss some of the properties of the map $\Upsilon$. In particular, if we regard $\Upsilon(P)$ as a…

Combinatorics · Mathematics 2023-05-05 Richard P. Stanley

A pseudo-Euclidean Novikov superalgebra $A$ is a Novikov superalgebra endowed with a non-degenerate symmetric bilinear form $\langle,\rangle$ such that all left multiplication operators are $\langle,\rangle$-antisymmetric. In this case, the…

Rings and Algebras · Mathematics 2026-05-21 Said Benayadi , Sofiane Bouarroudj , Hamza El Ouali

Let U(N) be the quasi-split unitary group in N variables for a quadratic unramified extension of p-adic fields. We compute the characters of simple supercuspidal representations of twisted GL(N) and U(N). Comparing them by the endoscopic…

Number Theory · Mathematics 2018-10-16 Masao Oi

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…

Combinatorics · Mathematics 2025-04-11 Nicolas Bonichon , Mireille Bousquet-Mélou , Paul Dorbec , Claire Pennarun

We consider incomplete tilings of the equilateral triangle of edge length n that is subdivided into n^2 regular equilateral smaller unit triangles. Pairs of the unit triangles that share a side may be converted into lozenges, leaving some…

Combinatorics · Mathematics 2020-07-28 Richard J. Mathar

In arrangements of pseudocircles (Jordan curves) the weight of a vertex (intersection point) is the number of pseudocircles that contain the vertex in its interior. We give improved upper bounds on the number of vertices of weight <=k in…

Combinatorics · Mathematics 2008-06-13 Ronald Ortner

Let $P$ be a finite set of points in the plane in general position, that is, no three points of $P$ are on a common line. We say that a set $H$ of five points from $P$ is a $5$-hole in $P$ if $H$ is the vertex set of a convex $5$-gon…

An equilateral pentagon is a polygon in the plane with five sides of equal length. In this paper we classify the central configurations of the $5$-body problem having the five bodies at the vertices of an equilateral pentagon with an axis…

Dynamical Systems · Mathematics 2022-05-25 Martha Alvarez-Ramírez , Armengol Gasull , Jaume Llibre

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke

We study a non-trivial extreme case of the orchard problem for $12$ pseudolines and we provide a complete classification of pseudoline arrangements having $19$ triple points and $9$ double points. We have also classified those that can be…

Combinatorics · Mathematics 2023-01-10 Jürgen Bokowski , Piotr Pokora

The family of Euclidean triangles having some fixed perimeter and area can be identified with a subset of points on a nonsingular cubic plane curve, i.e., an elliptic curve; furthermore, if the perimeter and the square of the area are…

Number Theory · Mathematics 2015-05-13 Nicolas Brody , Jordan Schettler

The property of triality only appears in one linear simple Lie algebra: $D_4$, a.k.a. $\mathfrak{so}(8, \mathbb{C})$. Though often explored in abstract, it is desirable to have an explicit realization of the concept since there are no other…

Representation Theory · Mathematics 2025-02-21 Craig McRae

This proof without words demonstrates that there are $\binom{n+2}{4}$ equilateral triangles in the regular $n$-vertices-per-side triangular grid by describing a map from four-element subsets of $\{1,2, \dots, n+2\}$ into the set of…

History and Overview · Mathematics 2022-11-02 Peter Kagey

We prove that 1) There exist infinitely many non-trivial codimension one "thick" knots in $\mathbb{R}^5$; 2) For each closed four-dimensional smooth manifold $M$ and for each sufficiently small positive $\epsilon$ the set of isometry…

Metric Geometry · Mathematics 2016-03-17 Boris Lishak , Alexander Nabutovsky

We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have…

Computational Geometry · Computer Science 2010-01-21 Erik D. Demaine , David Eppstein , Jeff Erickson , George W. Hart , Joseph O'Rourke