Related papers: Polytopes, polyhedra, and the Farkas lemma
In this work a new empirical tolerance factor for compounds with pyrochlore structure is proposed. This suggested tolerance factor is based on experimental structural data and on the tolerance factors currently proposed. However, since it…
This paper is devoted to the analysis of a false generalization of the rule of Sarrus and its properties that can be derived with the help of dihedral groups. Further, we discuss a Sarrus-like scheme that could be helpful for students to…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
Sheaves of structures are useful to give constructions in universal algebra and model theory. We can describe their logical behavior in terms of Heyting-valued structures. In this paper, we first provide a systematic treatment of sheaves of…
We show that a single special separation theorem (namely, a consequence of the geometric form of the Hahn-Banach theorem) can be used to prove Farkas type theorems, existence theorems for numerical quadrature with positive coefficients, and…
The Jacobi polynomial has been advocated by many authors as a useful tool to evolve non-singlet structure functions to higher $Q^2$. In this work, it is found that the convergence of the polynomial sum is not absolute, as there is always a…
Two basic theorems of the theory of flexible polyhedra were proven by completely different methods: R. Alexander used analysis, namely, the Stokes theorem, to prove that the total mean curvature remains constant during the flex, while I.Kh.…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
A renowned theorem of Blind and Mani, with a constructive proof by Kalai and an efficiency proof by Friedman, shows that the whole face lattice of a simple polytope can be determined from its graph. This is part of a broader story of…
A toric polyhedron is a reduced closed subscheme of a toric variety that are partial unions of the orbits of the torus action. We prove vanishing theorems for toric polyhedra. We also give a proof of the $E_1$-degeneration of Hodge to de…
Sperner's lemma is a statement about labeled triangulations of a simplex. McLennan and Tourky (2007) provided a novel proof of Sperner's Lemma by examining volumes of simplices in a triangulation under time-linear simplex-linear…
Even though flt is a number theoretic result we prove that the result depends on the topological as well as the field structure of the underlying space.
We prove the Yoneda lemma inside an elementary higher topos, generalizing the Yonda lemma for spaces.
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…
One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…
A construction of polytopes is given based on integers. These geometries are constructed through a mapping to pure numbers and have multiple applications, including statistical mechanics and computer science. The number form is useful in…
We implement a real polyhedral homotopy method using three functions. The first function provides a certificate that our real polyhedral homotopy is applicable to a given system; the second function generates binomial systems for a start…
We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…
This paper is about the logarithmic limit sets of real semi-algebraic sets, and, more generally, about the logarithmic limit sets of sets definable in an o-minimal, polynomially bounded structure. We prove that most of the properties of the…