Convex 4-valent polytopes

Let {p_k}_k≥3 be a sequence of nonnegative integers which satisfies 8 + Σ_k≥3 (k-4) p_k = 0 and p₄ ≥ p₃. Then there is a convex 4-valent polytope P in E³ such that P has exactly p_k k-gons as faces. The inequality p₄ ≥ p₃ is the best possible in the sense that for c < 1 there exist sequences that are not 4-realizable that satisfy both 8 + Σ_{k ≥3} (k - 4) p_k = 0 and p₄ > cp₃. When Σ_{k ≥ 5} p_k ≠ 1, one can make the stronger statement that the sequence {p_k} is 4-reliazable if it satisfies 8 + Σ_{k ≥ 3} (k - 4) p_k = 0 and p₄ ≥ 2Σ_{k ≥ 5} p_k + max{k ¦ p_k ≠ 0}.     

Convex polytopes and formal groups

Some constructions of commutative formal groups proceeding from convex polytopes and Laurent polynomials are studied.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 75, pp. 87–90, 1978.     

Centrally symmetric polytopes with many faces

We present explicit constructions of centrally symmetric polytopes with many faces: (1) we construct a d-dimensional centrally symmetric polytope P with about 3 ^d/4 ≈ (1.316) ^d vertices such that every pair of non-antipodal vertices of P spans an edge of P, (2) for an integer k ≥ 2, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitrarily large number N of vertices such that for some 0 < δ _k < 1 at least (1 ? (δ _k ) ^d )( _k ^N ) k-subsets of the set of vertices span faces of P, and (3) for an integer k ≥ 2 and α > 0, we construct a centrally symmetric polytope Q with an arbitrarily large number of vertices N and of dimension d = k ^1+o(1) such that at least $(1 - k^{ - \alpha } )(_k^N )$ k-subsets of the set of vertices span faces of Q.     

The numbers of faces of simplicial polytopes

In this paper is considered the problem of determining the possiblef-vectors of simplicial polytopes. A conjecture is made about the form of the sclution to this problem; it is proved in the case ofd-polytopes with at mostd+3 vertices.     

Convex polytopes of permutation invariant doubly stochastic matrices

We investigate the extreme points, faces and their dimensions of the convex polytope of doubly stochastic matrices which are invariant under a fixed row and column permutation.     

Convex polyhedra with parquet faces

Doklady Mathematics -     

Hamiltonian circuits in polytopes with even sided faces

It has been conjectured that ifP is a simple 3-polytope all of whose faces have an even number of sides, thenP has a Hamiltonian circuit. In this paper it is shown that, if all the faces ofP are either quadrilaterals or hexagons, thenP does have a Hamiltonian circuit.     

On low-dimensional faces that high-dimensional polytopes must have

We prove that every five-dimensional polytope has a two-dimensional face which is a triangle or a quadrilateral. We state and discuss the following conjecture: For every integerk1 there is an integer f(k) such that everyd-polytope,df(k), has ak-dimensional face which is either a simplex or combinatorially isomorphic to thek-dimensional cube.We give some related results concerning facet-forming polytopes and tilings. For example, sharpening a result of Schulte [25] we prove that there is no face to face tiling of ⁵ with crosspolytopes.Supported in part by a BSF Grant and by I.H.E.S, Bures-Sur-Yvette.     

Convex combinations of nilpotent triangular norms

In this paper we deal with the open problem of convex combinations of continuous triangular norms stated by Alsina, Frank, and Schweizer [C. Alsina, M.J. Frank, B. Schweizer, Problems on associative functions, Aequationes Math. 66 (2003) 128-140, Problems 5 and 6]. They pose a question whether a non-trivial convex combination of triangular norms can ever be a triangular norm. The main result of this paper gives a negative answer to the question for any pair of continuous Archimedean triangular norms with different supports. With the help of this result we show that a non-trivial convex combination of nilpotent t-norms is never a t-norm. The main result also gives an alternative proof to the result presented by Ouyang and Fang [Y. Ouyang, J. Fang, Some observations about the convex combination of continuous triangular norms, Nonlinear Anal., 68 (11) (2008) 3382-3387, Theorem 3.1]. In proof of the main theorem we utilize the Reidmeister condition known from the web geometry.     

Simple polytopes without small separators

We show that by cutting off the vertices and then the edges of neighborly cubical polytopes, one obtains simple 4-dimensional polytopes with n vertices such that all separators of the graph have size at least Ω(n/log^3/2 n). This disproves a conjecture by Kalai from 1991/2004.     

On the number of faces of centrally-symmetric simplicial polytopes

I. Bárány and L. Lovász [Acta Math. Acad. Sci. Hung.40, 323–329 (1982)] showed that ad-dimensional centrally-symmetric simplicial polytopeP has at least 2 ^d facets, and conjectured a lower bound for the numberf _i ofi-dimensional faces ofP in terms ofd and the numberf ₀ =2n of vertices. Define integers A. Björner conjectured (unpublished) that (which generalizes the result of Bárány-Lovász sincef _d–1 = h _i ), and more strongly that , which is easily seen to imply the conjecture of Bárány-Lovász. In this paper the conjectures of Björner are proved.Partially supported by NSF grant MCS-8104855. The research was performed when the author was a Sherman Fairchild Distinguished Scholar at Caltech.     

Convex polytopes whose projection bodies and difference sets are polars

In a paper by the author and B. Weissbach it was proved that the projection body and the difference set of ad-simplex (d≥2) are polars. Obviously, ford=2 a convex domain has this property if and only if its difference set is bounded by a so-called Radon curve. A natural question emerges about further classes of convex bodies inR ^d (d≥3) inducing the mentioned polarity. The aim of this paper is to show that a convexd-polytope (d≥3) is a simplex if and only if its projection body and its difference set are polars.     

Convex polytopes all of whose reverse lexicographic initial ideals are squarefree

A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a -polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed -polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of perfect graphs.

     

Typical faces of extremal polytopes with respect to a thin three-dimensional shell

Summary Given <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"6"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>r>1$, we search for the convex body of minimal volume in $\mathbb{E}^3$ that contains a unit ball, and whose extreme points are of distance at least $r$ from the centre of the unit ball. It is known that the extremal body is the regular octahedron and icosahedron for suitable values of $r$. In this paper we prove that if $r$ is close to one then the typical faces of the extremal body are asymptotically regular triangles. In addition we prove the analogous statement for the extremal bodies with respect to the surface area and the mean width.     

Convex games without side payments

A convex game without side payments is defined and discussed. It is shown that such a game is totally balanced. With a second and more restrictive definition of convexity it is shown that the core coincides with the von Neumann-Morgenstern solution.