中文
相关论文

相关论文: On Lattice Barycentric Tetrahedra

200 篇论文

The lattice of noncrossing partitions is well-known for its wide variety of combinatorial appearances and properties. For example, the lattice is rank-symmetric and enumerated by the Catalan numbers. In this article, we introduce a large…

组合数学 · 数学 2024-09-17 Stella Cohen , Michael Dougherty , Andrew D. Harsh , Spencer Park Martin

We analyze polyhedra composed of hexagons and triangles with three faces around each vertex, and their 3-regular planar graphs of edges and vertices, which we call "trihexes". Trihexes are analogous to fullerenes, which are 3-regular planar…

组合数学 · 数学 2025-07-01 Linda Green , Stellen Li

In this paper we show that a simplicial complex can be determined uniquely up to isomorphism by its barycentric subdivision or comparability graph. At the end, it is summarized several algebraic, combinatorial and topological invariants of…

交换代数 · 数学 2013-03-15 Rashid Zaare-Nahandi

In this paper we discuss the classification rank $3$ lattices preserved by finite orthogonal groups of isometries and derive from it the classification of regular polyhedra in the $3$-dimensional torus. This classification is highly related…

组合数学 · 数学 2016-04-25 Antonio Montero

Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…

逻辑 · 数学 2007-05-23 K. Dosen

Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…

范畴论 · 数学 2017-07-21 Greg Stevenson

We describe a classification of pairs $M, N$ of lattices isometric to $EE_8:=\sqrt 2 E_8$ such that the lattice $M + N$ is integral and rootless and such that the dihedral group associated to them has order at most 12. It turns out that…

表示论 · 数学 2012-08-27 Robert L. Griess, , Ching Hung Lam

An empty simplex is a lattice simplex with only its vertices as lattice points. Their classification in dimension three was completed by White in 1964. In dimension four, the same task was started in 1988 by Mori, Morrison, and Morrison,…

组合数学 · 数学 2021-11-05 Óscar Iglesias Valiño , Francisco Santos

We study the existence of cocompact lattices in Lie groups with bi-invariant metric of signature $(2,n-2)$. We assume in addition that the Lie groups under consideration are simply-connected, indecomposable and solvable. Then their centre…

微分几何 · 数学 2019-12-11 Ines Kath

We provide a classification, up to isomorphism, of four-dimensional ternary Leibniz algebras over an algebraically closed field of characteristic zero. For each non-abelian algebra in the classification, we explicitly determine its centroid…

环与代数 · 数学 2026-02-26 Ahmed Zahari Abdou Damdji

The symmedian point of a triangle enjoys several geometric and optimality properties, which also serve to define it. We develop a new dynamical coordinatization of the symmedian, which naturally generalizes to other ideal hyperbolic…

微分几何 · 数学 2025-03-21 Maxim Arnold , Carlos E. Arreche

In this paper, first steps are taken towards characterising lattices of cyclic flats $\mathcal{Z}(M)$ that belong to matroids $M$ that can be represented over a prescribed finite field $\mathbb{F}_q$. Two natural maps from $\mathcal{Z}(M)$…

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

组合数学 · 数学 2016-12-30 Gabriele Balletti , Alexander M. Kasprzyk

In his study of a Hochschild complex arising in connection with the free loop fibration, S. Saneblidze defined the freehedron, a certain polytope constructed via a truncation process from the hypercube. It was recently conjectured by F.…

组合数学 · 数学 2023-02-07 Henri Mühle

We classify the simple even lattices of square free level and signature (2,n) for n > 3. A lattice is called simple if the space of cusp forms of weight 1+n/2 for the dual Weil representation of the lattice is trivial. For a simple lattice…

数论 · 数学 2015-02-10 Moritz Dittmann , Heike Hagemeier , Markus Schwagenscheidt

It is shown that the lattices of flats of boolean representable simplicial complexes are always atomistic, but semimodular if and only if the complex is a matroid. A canonical construction is introduced for arbitrary finite atomistic…

组合数学 · 数学 2015-10-20 Stuart Margolis , John Rhodes , Pedro V. Silva

A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…

度量几何 · 数学 2013-02-13 Karoly Bezdek , Marton Naszodi

We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…

数论 · 数学 2017-12-19 Fernando Chamizo , Carlos Pastor

We prove the following fundamental property for the Fermat-Torricelli point for four non-collinear and non-coplanar points forming a tetrahedron in $\mathbb{R}^{3},$ which states that: The three bisecting lines having as a common vertex the…

度量几何 · 数学 2023-07-04 Anastasios N. Zachos

The h^*-polynomial of a lattice polytope is the numerator of the generating function of the Ehrhart polynomial. Let P be a lattice polytope with h^*-polynomial of degree d and with linear coefficient h^*_1. We show that P has to be a…

组合数学 · 数学 2008-09-29 Benjamin Nill