Related papers: Orthocentric simplices and their centers

We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…

A regular polygon circumscribing another regular polygon (with a different side number) may be tightened to minimize the difference of both areas. The manuscripts computes the optimum result under the restriction that both polygons are…

A lattice in Euclidean $d$-space is called well-rounded if it contains $d$ linearly independent vectors of minimal length. This class of lattices is important for various questions, including sphere packing or homology computations. The…

A triangle center such as the incenter, barycenter, etc., is specified by a function thrice- and cyclically applied on sidelengths and/or angles. Consider the 1d family of 3-periodics in the elliptic billiard, and the loci of its triangle…

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

We revisit constructions based on triads of conics with foci at pairs of vertices of a reference triangle. We find that their 6 vertices lie on well-known conics, whose type we analyze. We give conditions for these to be circles and/or…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

We establish a new refinement of the right-hand side of the Hermite-Hadamard inequality for simplices, based on the average values of a convex function over the faces of a simplex and over the values at their barycenters.

A building is a simplicial complex with a covering by Coxeter complexes (called apartments) satisfying certain combinatorial conditions. A building whose apartments are spherical (respectively Euclidean) Coxeter complexes has a natural…

Brenti and Welker have shown that for any simplicial complex X, the face vectors of successive barycentric subdivisions of X have roots which converge to fixed values depending only on the dimension of X. We improve and generalize this…

We prove that two dimensional convex subsets of spherical buildings are either buildings or have a center.

Given a right triangle ABC, with the ninety degree angle at A; consider the triangle O1OO2.Where the point O is the midpoint of the hypotenuseBC(and so the center of the triangle ABC's circumcircle), the point O1 being the triangle AOB's…

Intersection homology is obtained from ordinary homology by imposing conditions on how the embedded simplices meet the strata of a space $X$. In this way, for the middle perversity, properties such as strong Lefschetz are preserved. This…

We discuss the global regularity of 2 dimensional minimal sets that are near a union of two planes, and prove that every global minimal set in R^4 that looks like a union of two almost orthogonal planes at infinity is a cone. The main point…

We study rationality constructions for smooth complete intersections of two quadrics over nonclosed fields. Over the real numbers, we establish a criterion for rationality in dimension four.

In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

A polygonal complex in euclidean 3-space is a discrete polyhedron-like structure with finite or infinite polygons as faces and finite graphs as vertex-figures, such that a fixed number r of faces surround each edge. It is said to be regular…

We focus on two important classes of lattices, the well-rounded and the cyclic. We show that every well-rounded lattice in the plane is similar to a cyclic lattice, and use this cyclic parameterization to count planar well-rounded…

This note proves a result on the existence of barycenters in a class of uniformly convex geodesic spaces.