中文
相关论文

相关论文: Clean Lattice Tetrahedra

200 篇论文

In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…

计算几何 · 计算机科学 2019-12-04 Seri Nishimoto , Takashi Horiyama , Tomohiro Tachi

Let $X$ be a compact metric space, and let $A$ be a pure $\mathrm{C}^*$-algebra. We show that $C(X,A)$ is pure whenever $A$ is simple; or every quotient of $A$ is stably finite (e.g., $A$ has stable rank one). Using permanence properties of…

算子代数 · 数学 2026-02-24 Apurva Seth , Eduard Vilalta

We introduce the concept of basis for a lattice. This basis plays a vital role to determine the completeness and consistency of the lattice. Weighted lattices are introduced and its complexity is formulated. Some axiomatic systems,…

综合数学 · 数学 2007-05-23 Vinod Kumar. P. B , K. Babu Joseph

We show that for an integer $\ell$, there exists an acute integer lattice triangle of lattice perimeter $\ell$ such that its orthocenter is an integer lattice point, if and only if $\ell=6 $ or $\ell\ge 8$. Analogous results are obtained…

综合数学 · 数学 2026-04-30 Christian Aebi , Grant Cairns

A lattice $d$-simplex is the convex hull of $d+1$ affinely independent integer points in ${\mathbb R}^d$. It is called empty if it contains no lattice point apart of its $d+1$ vertices. The classification of empty $3$-simplices is known…

组合数学 · 数学 2019-02-18 Óscar Iglesias Valiño , Francisco Santos

Pogorelov proved in 1949 that every every convex polyhedron has at least three simple closed quasigeodesics. Whereas a geodesic has exactly pi surface angle to either side at each point, a quasigeodesic has at most pi surface angle to…

度量几何 · 数学 2022-03-10 Joseph O'Rourke , Costin Vilcu

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

数论 · 数学 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and…

度量几何 · 数学 2024-06-06 Sándor Bozóki , Gábor Domokos , Dávid Papp , Krisztina Regős

Developments during the last eight years have refuted the folklore that chiral symmetries cannot be preserved on the lattice. The mechanism that permits chiral symmetry to coexist with the lattice is quite general and may work in Nature as…

高能物理 - 格点 · 物理学 2009-11-07 H. Neuberger

We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…

计算几何 · 计算机科学 2011-12-21 Mirela Damian , Erik Demaine , Robin Flatland

The tetrahedron equation is a three-dimensional generalization of the Yang-Baxter equation. Its solutions define integrable three-dimensional lattice models of statistical mechanics and quantum field theory. Their integrability is not…

高能物理 - 理论 · 物理学 2011-02-11 Vladimir V. Bazhanov , Sergey M. Sergeev

An n-dimensional simplex \Delta in \R^n is called empty lattice simplex if \Delta \cap\Z^n is exactly the set of vertices of \Delta . A theorem of G. K. White shows that if n=3 then any empty lattice simplex \Delta \subset\R^3 is isomorphic…

组合数学 · 数学 2010-04-21 Victor Batyrev , Johannes Hofscheier

Skeletal polyhedra and polygonal complexes in ordinary Euclidean 3-space are finite or infinite 3-periodic structures with interesting geometric, combinatorial, and algebraic properties. They can be viewed as finite or infinite 3-periodic…

度量几何 · 数学 2014-03-04 Egon Schulte

The Kodaira dimension of a nondegenerate toric hypersurface can be computed from the dimension of the Fine interior of its Newton polytope according to recent work of Victor Batyrev, where the Fine interior of the Newton polytope is the…

代数几何 · 数学 2025-07-04 Martin Bohnert

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

组合数学 · 数学 2010-01-05 Benjamin Lorenz

We construct a smooth symmetric compactification of the space of all labeled tetrahedra in P^3.

代数几何 · 数学 2007-05-23 Eric Babson , Paul E. Gunnells , Richard Scott

We review the theory of intrinsic geometry of convex surfaces in the Euclidean space and prove the following theorem: if the surface of a convex body K contains arbitrary long closed simple geodesics, then K is an isosceles tetrahedron.

微分几何 · 数学 2018-10-01 Arseniy Akopyan , Anton Petrunin

We systematically investigate properties of various triangle centers (such as orthocenter or incenter) located on the four faces of a tetrahedron. For each of six types of tetrahedra, we examine over 100 centers located on the four faces of…

历史与综述 · 数学 2021-01-08 Stanley Rabinowitz

Let B denote a three-dimensional body of rotation, with respect to one coordinate axis, whose boundary is sufficiently smooth and of bounded nonzero Gaussian curvature throughout, except for the two boundary points on the axis of rotation,…

数论 · 数学 2015-06-26 W. G. Nowak

A lattice in the Euclidean space is standard if it has a basis consisting vectors whose norms equal to the length in its successive minima. In this paper, it is shown that with the $L^2$ norm all lattices of dimension $n$ are standard if…

数论 · 数学 2017-06-06 Rongquan Feng , Longke Tang , Kun Wang