On semiregular conditional distributions

Let (,A,P) denote some probability space and some sub--algebra ofA. It is shown that there exists a semiregular versionQ (A),A, , of the conditional distributionP(A|), AA, i.e., Q (A), (AA fixed) is andAQ (A),AA ( fixed), is a probability charge satisfyingQ (N)=0, , for allP-zero setsN, if and only ifL ₁(,P|) has a lifting, which exists for any sub--algebra ofA ifL ₁(,A P) is separable. Separability ofL ₁(,A,P) implies also the existence of a strongly semiregular versionQ (A),A, , ofP(A|), A , i.e., Q (A), (AA fixed), is -measurable andAQ (A),A ( fixed), is a probability charge. Furthermore,P can be written as P ₁+(1–)P ₂, 01, whereP ₁ are probability measures onA such thatP ₁(A|),AA, has a semiregular version vanishing for anyP-zero setN andP ₂ is singular with respect to any probability measure onA of the type ofP ₁. In the case 0<<1 the probability measuresP _j ,j=1, 2, are uniquely determined. The decomposition can be carried over to the case, where the additional condition thatQ (N)=0 for all and anyP-zero setN is valid, is omitted respectively semiregularity is replaced by (i) strong semiregularity, or (ii) classical regularity. In the last mentioned case (ii) the decomposition is multiplicative.     

Representing the sporadic Archimedean polyhedra as abstract polytopes

We present the results of an investigation into the representations of Archimedean polyhedra (those polyhedra containing only one type of vertex figure) as quotients of regular abstract polytopes. Two methods of generating these presentations are discussed, one of which may be applied in a general setting, and another which makes use of a regular polytope with the same automorphism group as the desired quotient. Representations of the 14 sporadic Archimedean polyhedra (including the pseudorhombicuboctahedron) as quotients of regular abstract polyhedra are obtained, and summarised in a table. The information is used to characterize which of these polyhedra have acoptic Petrie schemes (that is, have well-defined Petrie duals).     

Platonic solids symmetry in particle physics

Non-linearity of the Yang-Mills fields caused by the commutator in the Lagrangian calls attention to symmetries helping to reveal important features of the system, while obviating the need of actual solutions. To this end, a charge fixing procedure is carried out by means of counting photon oscillations between test particles moving along trajectories that form Platonic solids shaped patterns. With the infinite-range electromagnetic interaction as its origin, the procedure defines a class of interactions allowed for particle physics. Besides the familiar electromagnetic, weak and strong interactions, the scheme suggests an unusual force that cannot be detected with conventional means though possibly contributes to gravitation.     

On genera of polyhedra

We consider the stable homotopy category S of polyhedra (finite cell complexes). We say that two polyhedra X,Y are in the same genus and write X ∼ Y if X _p ≅ Y _p for all prime p, where X _p denotes the image of Xin the localized category S _p . We prove that it is equivalent to the stable isomorphism X∨B ₀ ≅Y∨B ₀, where B ₀ is the wedge of all spheres S ⁿ such that π _n ^S (X) is infinite. We also prove that a stable isomorphism X ∨ X ≅ Y ∨ X implies a stable isomorphism X ≅ Y.     

On discontinuous Galerkin method and semiregular family of triangulations

Discretization of second order elliptic partial differential equations by discontinuous Galerkin method often results in numerical schemes with penalties. In this paper we analyze these penalized schemes in the context of quite general triangular meshes satisfying only a semiregularity assumption. A new (modified) penalty term is presented and theoretical properties are proven together with illustrative numerical results. This work is a part of the research project MSM 0021620839 financed by MSMT and was partly supported by the project No. 201/04/1503 of the Grant Agency of the Czech Republic.     

On the trace of polyhedra

We consider a convex polyhedronP standing with one of its faces on a fixed plane. We rotateP into another similar position around any of its edges lying on. We call the trace ofP the set of all pointsA of for whichA coincides with some vertex ofP in some position ofP.We investigate the traces of the regular polyhedra, the rectangular parallelepiped. Furthermore we give a sufficient condition for which the trace of a convex polyhedron is everywhere dense.Supported by CNRS Laboratoire de Mathématiques Discrètes, Marseille.     

On recognizing integer polyhedra

We give a simple proof that, determining whether a convex polytope has a fractional vertex, is NP-complete.Research supported by the National Science Foundation.     

On switching paths polyhedra

A class of integer polyhedra with totally dual integral (tdi) systems is proposed, which generalizes and unifies the “Switching Paths Polyhedra” of Hoffman (introduced in his generalization of Max Flow-Min Cut) and such polyhedra as the convex hull of (the incidence vectors of) all “path-closed sets” of an acyclic digraph, or the convex hull of all sets partitionable intok path-closed sets. As an application, new min-max theorems concerning the mentioned sets are given. A general lemma on when a tdi system of inequalities is box tdi is also given and used.     

On polyhedra of Perron-Frobenius eigenvectors

This paper deals with the positive eigenvectors of nonnegative irreducible matrices which are merely characterized by a given upper bound u on their spectral radius and by a given matrix L of lower bounds for their elements. For any such matrix, the normalized positive left [right] eigenvector is shown to belong to the polyhedron the vertices of which are given by the normalized rows [columns] of the matrix $\text{(u}\text{I}\text{?}\text{L}\text{)}{}^{\mathrm{?1}}$. This polyhedron is proven to be also the smallest closed set which is guaranteed to contain the positive left [right] normalized eigenvector; its vertices are therefore the best componentwise bounds one can obtain on the positive eigenvectors of these matrices. A less general result has also been obtained for the symmetrical case, when the matrices are only characterized by a given lower bound l on their spectral radius and by a given matrix U of upper bounds for their elements.     

On the monotonization of polyhedra

In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensional polyhedra. The presence of implicit or explicit equations in the linear system defining such a polyhedron leads to technical difficulties when analyzing its facial structure. It is therefore customary to approach the study of such a polytopeP through the study of one of its (full dimensional) relaxations (monotonizations) known as the submissive and the dominant ofP. Finding sufficient conditions for an inequality that induces a facet of the submissive or the dominant of a polyhedron to also induce a facet of the polyhedron itself has been posed in the literature as an important research problem. Our paper goes a long way towards solving this problem. We address the problem in the framework of a generalized monotonization of a polyhedronP, g-mon(P), that subsumes both the submissive and the dominant, and give a sufficient condition for an inequality that defines a facet of g-mon(P) to define a facet ofP. For the important cases of the traveling salesman (TS) polytope in both its symmetric and asymmetric variants, and of the linear ordering polytope, we give sufficient conditions trivially easy to verify, for a facet of the monotone completion to define a facet of the original polytope itself. Research supported by grant DMI-9201340 of the National Science Foundation and contract N00014-89-J-1063 of the Office of Naval Research. Research supported by MURST, Italy.     

On structures of bisubmodular polyhedra

A bisubmodular polyhedron is defined in terms of a so-called bisubmodular function on a family of ordered pairs of disjoint subsets of a finite set. We examine the structures of bisubmodular polyhedra in terms of signed poset and exchangeability graph. We give a characterization of extreme points together with an O(n ²) algorithm for discerning whether a given point is an extreme point, wheren is the cardinality of the underlying set, and we assume a function evaluation oracle for the bisubmodular function. The algorithm also determines the signed posetructure associated with the given point if it is an extreme point. We reveal the adjacency relation of extreme points by means of the Hasse diagrams of the associated signed posets. Moreover, we investigate the connectivity and the decomposition of a bisubmodular system into its connected components.     

On groups with every normal subgroup transitive or semiregular

We investigate finite solvable permutation groups in which all normal subgroups are transitive or semiregular. The motivation comes from universal algebra: such groups are examples of collapsing transformation monoids.     

On integer points in polyhedra

We give an upper bound on the number of vertices ofP _I , the integer hull of a polyhedronP, in terms of the dimensionn of the space, the numberm of inequalities required to describeP, and the size of these inequalities. For fixedn the bound isO(m ^{n n–} ). We also describe an algorithm which determines the number of integer points in a polyhedron to within a multiplicative factor of 1+ in time polynomial inm, and 1/ when the dimensionn is fixed.Supported by Sonderfschungsbereich 303 (DFG) and NSF grant ECS-8611841.Partially supported by NSF grant DMS-8905645.Supported by NSF grants ECS-8418392 and CCR-8805199.mcd%vax.oxford.ac.uk     

On weakly convex star-shaped polyhedra

Weakly convex polyhedra which are star-shaped with respect to one of their vertices are infinitesimally rigid. This is a partial answer to the question as to whether every decomposable weakly convex polyhedron is infinitesimally rigid. The proof is based on a recent result of Izmestiev on the geometry of convex caps.     

On the isometries of ideal polyhedra

Résumé  On montre que siX est un polyèdre idéal complet fini satisfaisant la condition CAT(−1) locale, alors toute isométrie deX homotope à l’identité est l’identité, pourvu queπ ₁(X) ne soit pas élémentaire. On montre aussi que le groupe des isométies deX est fini.      

On a class of inflexible polyhedra

We consider a class of polyhedra that we call pyramids and prove under some simple but rather general conditions on the extrinsic structure that the pyramids are inflexible. Moreover, this inflexibility property can be established also in multidimensional spaces of arbitrary constant curvature under appropriate conditions.