A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra

We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration of the vertices of an arrangement or of a convex polyhedron, in arbitrary dimension. The algorithm has the following properties:

Nonoverlap of the star unfolding

The star unfolding of a convex polytope with respect to a pointx on its surface is obtained by cutting the surface along the shortest paths fromx to every vertex, and flattening the surface on the plane. We establish two main properties of the star unfolding:

L’Extension Abelienne D’une Categorie semi-abelienne

We show that if (K,L) is a semi-abelian category, there exists an abelian categoryK ^x with the followings properties:

Some finite nonsolvable groups characterized by their solvable subgroups

LetG be a finite nonsolvable group andH a proper subgroup ofG. In this paper we determine the structure ofG ifG satisfies one of the following conditions:

Optimization and optimality test for the Max-Cut Problem

We show that the following two problems are polynomially equivalent:

Double bubbles in<Emphasis Type="Bold">S</Emphasis><Superscript>3</Superscript> and<Emphasis Type="Bold">H</Emphasis><Superscript>3</Superscript>

We prove the double bubble conjecture in the three-sphereS ³ and hyperbolic three-spaceH ³ in the cases where we can apply Hutchings theory:

Construction of representation-finite selfinjective artin algebras of classB n andC n

In this paper, we discuss the representation-finite selfinjective artin algebras of classB _n andC _n and obtain the following main results: For any fieldk, let Λ be a representation-finite selfinjective artin algebras of classB _n orC _n overk.

p-Congruences onp-regular semigroups

A pair (S, P) of a regular semigroupsS and a subsetP ofE _s whereE _s is the set of all idempotent elements ofS is called aP-regular semigroupS(P) if it satisfies the following:

Hamilton Cycle Rich 2-factorizations of Complete Multipartite Graphs

For any two 2-regular spanning subgraphs G and H of the complete multipartite graph K, necessary and sufficient conditions are found for the existence of a 2-factorization of K in which

On locally solid topological lattice groups

Let (G, τ) be a commutative Hausdorff locally solid lattice group. In this paper we prove the following:

Undecidability of the centers of groups and group algebras

Let k ≧ 3 be an integer or k = ∞ and let K be a field. There is a recursive family of finitely presented groups G_n over a fixed finite alphabet with solvable word problem such that

Sets in a euclidean space which are not a countable union of convex subsets

We prove that if a closed planar setS is not a countable union of convex subsets, then exactly one of the following holds:

Arbres et suites majeures

The major sequences of lengthn are defined as the words withn letters taken from the integers 1, 2, ,n and containing at least

Applications of induced resultants to polynomial maps

LetF(X, Y) be a two dimensional polynomial map overC. We show how to use the notion of induced resultants in order to give short and elementary proofs to the following three theorems:

Sectionally Semicomplemented Distributive Nearlattices

A nearlattice S is a meet semilattice together with the property that any two elements possessing a common upper bound have a supremum. Here the authors have introduced the notion of sectionally semicomplemented distributive nearlattices and given several characterizations of them. The skeleton SCon(S) of Con(S), the congruence lattice, consists of all those nearlattice congruences which are the pseudocomplements of members of Con(S). The relationship between skeletal congruences and kernel of skeletal congruences leads to numerous characterizations of sectionally semicomplemented distributive nearlattices and semiboolean algebras. For example we prove, for a distributive nearlattice S with 0, the following conditions are equivalent:

Stable properties of plethysm : on two conjectures of Foulkes

Two conjectures made by II.O. Foulkes in 1950 can be stated as follows.

Embedding graphs with bounded degree in sparse pseudorandom graphs

In this paper, we show the equivalence of somequasi-random properties for sparse graphs, that is, graphsG with edge densityp=|E(G)|/( ₂ ⁿ )=o(1), whereo(1)→0 asn=|V(G)|→∞. Our main result (Theorem 16) is the following embedding result. For a graphJ, writeN _J(x) for the neighborhood of the vertexx inJ, and letδ(J) andΔ(J) be the minimum and the maximum degree inJ. LetH be atriangle-free graph and setd _H=max{δ(J):J⊆H}. Moreover, putD _H=min{2d _H,Δ(H)}. LetC>1 be a fixed constant and supposep=p(n)≫n ⁻¹ D _H. We show that ifG is such that

Beurling's theorem and invariant subspaces for the shift on Hardy spaces

Let G be a bounded open subset in the complex plane and let H~2(G) denote the Hardy space on G. We call a bounded simply connected domain W perfectly connected if the boundary value function of the inverse of the Riemann map from W onto the unit disk D is almost 1-1 with respect to the Lebesgue measure on D and if the Riemann map belongs to the weak-star closure of the polynomials in H~∞(W). Our main theorem states: in order that for each M∈Lat (M_z), there exist u∈H~∞(G) such that M=∨{uH~2(G)}, it is necessary and sufficient that the following hold: (1) each component of G is a perfectly connected domain; (2) the harmonic measures of the components of G are mutually singular; (3) the set of polynomials is weak-star dense in H~∞(G). Moreover, if G satisfies these conditions, then every M∈Lat (M_z) is of the form uH~2(G), where u∈H~∞(G) and the restriction of u to each of the components of G is either an inner function or zero.