Embedding and unsolvability theorems for modular lattices

LetR be a nontrivial ring with 1 and δ a cardinal. Let,L(R, δ) denote the lattice of submodules of a free unitaryR-module on δ generators. Let ? be the variety of modular lattices. A lattice isR-representable if embeddable in the lattice of submodules of someR-module; ?(R) denotes the quasivariety of allR-representable lattices. Let ω denote aleph-null, and let a (m, n) presentation havem generators andn relations,m, n≤ω. THEOREM. There exists a (5, 1) modular lattice presentation having a recursively unsolvable word problem for any quasivarietyV,V ? ?, such thatL(R, ω) is inV. THEOREM. IfL is a denumerable sublattice ofL(R, δ), then it is embeddable in some sublatticeK ofL(R,δ^*) having five generators, where δ^*=δ for infinite δ and δ^*=4δ(m+1) if δ is finite andL has a set ofm generators. THEOREM. The free ?(R)-lattice on ω generators is embeddable in the free ?(R)-lattice on five generators. THEOREM. IfL has an (m, n), ?(R)-presentation for denumerablem and finiten, thenL is embeddable in someK having a (5, 1) ?(R)-presentation.     

A note on rings with involution

LetR be a ring with involution_* and π a right ideal ofR. It is shown that if every symmetric elements∈p satisfiess ⁿ=0 wheren is a fixed positive integer then ?^*?(L(R), the lower nil radical ofR.     

Edge-Ramsey theory

LetK be a configuration, a set of points in some finite-dimensional Euclidean space. Letn andk be positive integers. The notationR(K, n, r) is an abbreviation for the following statement: For everyr-coloring of the points of then-dimensional Euclidean space,R ⁿ , a monochromatic configurationL which is congruent toK exists. A configurationK is Ramsey if the following holds: For every positive integerr, a positive integern=n(K, r) exists such that, for allm≥n, R(K, m, r) holds. A configuration is spherical if it can be embedded in the surface of a sphere inn-space, providedn is sufficiently large. It is relatively easy to show that if a configuration is Ramsey, it must be spherical. Accordingly, a good fraction of the research efforts in Euclidean Ramsey theory is devoted to determining which spherical configurations are Ramsey. It is known that then-dimensional measure polytopes (the higher-dimensional analogs of a cube), then-dimensional simplex, and the regular polyhedra inR ² andR ³ are Ramsey. Now letE denote a set of edges in a configurationK. The pair (K, E) is called an edge-configuration, andR _e (K, E, n, r) is used as an abbreviation for the following statement: For anyr-coloring of the edges ofR ⁿ , there is an edge configuration (L, F) congruent to (K, E) so that all edges inF are assigned the same color. An edge-configuration isedge-Ramsey if, for allr≥1, a positive integern=n(K, E, r) exists so that ifm≥n, the statementR _e (K, E, m, r) holds. IfK is a regular polytope, it is saidK isedge-Ramsey when the configuration determined by the set of edges of minimum length is edge-Ramsey. It is known that then-dimensional simplex is edge-Ramsey and that the nodes of any edge-Ramsey configuration can be partitioned into two spherical sets. Furthermore, the edges of any edge-Ramsey configuration must all have the same length. It is conjectured that the unit square is edge-Ramsey, and it is natural to ask the more general question: Which regular polytopes are edge-Ramsey? In this article it is shown that then-dimensional measure polytope and then-dimensional cross polytope are edge-Ramsey. It is also shown that these two infinite families and then-dimensional simplexes are the only regular edge-Ramsey polytopes, with the possible exceptions of the hexagon and the 24-cell.     

Einbettung von topologischen Raumgeometrien auf R3 in den reellen affinen Raum

Betten [1] had defined topological spatial geometries on R ³: In R ³ a system L of closed subsets homeomorphic to R (the lines) and a system ? of closed subsets homeomorphic to R ² (the planes) are given such that through any two different points passes exactly one line and through any three non-collinear points passes exactly one plane. Furthermore, ? and ? carry topologies such that the operations of joining and intersection are continuous. It is proved that any topological spatial geometry on R ³ can be imbedded into R ³ as an open convex subset K such that the lines in ? (planes in ?) are mapped onto intersections of lines (planes) of R ³ with K. The collineation group of the geometry is isomorphic to the subgroup of the colineation group of real projective space consisting of the automorphisms that map K into itself. In particular, it is a Lie group of dimension ?12.     

The set of irreducible graphs for the projective plane is finite

In 1930 Kuratowski proved that a graph does not embed in the real plane R² if and only if it contains a subgraph homeomorphic to one of two graphs, K₅ or K_{3, 3}. For positive integer n, let I_n (P) denote a smallest set of graphs whose maximal valency is n and such that any graph which does not embed in the real projective plane contains a subgraph homeomorphic to a graph in I_n (P) for some n. Glover and Huneke and Milgram proved that there are only 6 graphs in I₃ (P), and Glover and Huneke proved that I_n (P) is finite for all n. This note proves that I_n (P) is empty for all but a finite number of n. Hence there is a finite set of graphs for the projective plane analogous to Kuratowski's two graphs for the plane.     

Order-constrained uniform approximations to the exponential based on restricted rationals

LetR _n/m(z∶γ)=P _n(z∶γ)/(1?γz) ^m be a rational approximation to exp (z),z ∈C, of ordern for all real positiveγ. In this paper we show there exists exactly one value ofγ in each of min(n+1,m) interpolation intervals such that the uniform error overR ^? is at a local minimum.     

Stability theorems for projections of convex sets

LetH ^n?1 denote the set of all (n ? 1)-dimensional linear subspaces of euclideann-dimensional spaceE ⁿ (n≧3), and letJ andK be two compact convex subsets ofE ⁿ. It is well-known thatJ andK are translation equivalent (or homothetic) if for allH ∈H ^n?1 the respective orthogonal projections, sayJ _H, K_H, are translation equivalent (or homothetic). This fact gives rise to the following stability problem: Ifε≧0 is given, and if for everyH ∈H ^n?1 a translate (or homothetic copy) ofK _H is within Hausdorff distanceε ofJ _H, how close isJ to a nearest translate (or homothetic copy) ofK? In the case of translations it is shown that under the above assumptions there is always a translate ofK within Hausdorff distance (1 + 2√2)ε ofJ. Similar results for homothetic transformations are proved and applications regarding the stability of characterizations of centrally symmetric sets and spheres are given. Furthermore, it is shown that these results hold even ifH ^n?1 is replaced by a rather small (but explicitly specified) subset ofH ^n?1.     

Nombres de ramsey dans le cas orienté

Given two directed graphs G₁, G₂, the Ramsey number R(G₁,G₂) is the smallest integer n such that for any partition {U₁,U₂} of the arcs of the complete symmetric directed graph K¹_n, there exists an integer i such that the partial graph generated by U_i contains G_i as a subgraph. In this article, we determine R(P?_m,D?_n) and R(D?_m,D?_n) for some values of m and n, where P?_m denotes the directed path having m vertices and D?_m is obtained from P?_m by adding an arc from the initial vertex of P?_m to the terminal vertex.     

Graphs with bounded valency that do not embed in the projective plane

In 1930 Kuratowski proved that a graph does not embed in the real plane R² if and only if it contains a subgraph homeomorphic to one of two graphs, K₅ or K₃₃. Let I_n(P) denote the minimal set of graphs whose vertices have miximal valency n such that any graph which does not embed in the real projective plane (or equivalently, does not embed in the Möbius band) contains a subgraph homeomorphic to a graph in I_n(P) for some positive integer n. Glover and Huneke and Milgram proved that there are only 6 graphs in I₃(P). This note proves that for each n, I_n(P) is finite.     

Sufficient conditions for the extension ofC R structures

LetM be a smoothC R manifold of dimension 2n ? 1 such that at each point, either the Levi form has at least 3 positive eigenvalues or it hasn ? 1 negative eigenvalues. IfD is a smoothly bounded subdomain ofM, then there is a smoothly bounded integrable almost complex manifoldX of dimension 2n such thatM is contained in the boundary ofX and such that theC R structure thatM inherits as a subset ofX coincides with the original structure ofM.     

Properly coloured Hamiltonian cycles in edge-coloured complete graphs

Let K ^c _n be an edge-coloured complete graph on n vertices. Let Δ_mon(K^c _n) denote the largest number of edges of the same colour incident with a vertex of K^c _n. A properly coloured cycleis a cycle such that no two adjacent edges have the same colour. In 1976, BollobÁs and Erd?s[6] conjectured that every K^c _n with Δ_mon(K^c _n)<?n/2?contains a properly coloured Hamiltonian cycle. In this paper, we show that for any ε>0, there exists an integer n₀ such that every K^c _n with Δ_mon(K^c _n)<(1/2–ε)n and n≥n₀ contains a properly coloured Hamiltonian cycle. This improves a result of Alon and Gutin [1]. Hence, the conjecture of BollobÁs and Erd?s is true asymptotically.     

On then-cutset property

For a partially ordered setP and an elementx ofP, a subsetS ofP is called a cutset forx inP if every element ofS is noncomparable tox and every maximal chain ofP meets {x}∪S. We letc(P) denote the smallest integerk such that every elementx ofP has a cutsetS with ‖S‖?k: Ifc(P)?n we say thatP has then-cutset property. Our results bear on the following question: givenP, what is the smallestn such thatP can be embedded in a partially ordered set having then-cutset property? As usual, 2 ⁿ denotes the Boolean lattice of all subsets of ann-element set, andB _n denotes the set of atoms and co-atoms of 2 ⁿ . We establish the following results: (i) a characterization, by means of forbidden configurations, of whichP can be embedded in a partially ordered set having the 1-cutset property; (ii) ifP contains a copy of 2 ⁿ , thenc(P)?2^[n/2]?1; (iii) for everyn>3 there is a partially ordered setP containing 2 ⁿ such thatc(P)<c(2 ⁿ ); (iv) for every positive integern there is a positive integerN such that, ifB _m is contained in a partially ordered set having then-cutset property, thenm?N.     

Intersection patterns of convex sets

LetK ₁,…K_n be convex sets inR ^d. For 0≦i denote byf _ithe number of subsetsS of {1,2,…,n} of cardinalityi+1 that satisfy ∩{K _i∶i∈S}≠Ø. We prove:Theorem.If f _d+r=0 for somer r>=0, then {fx161-1} This inequality was conjectured by Katchalski and Perles. Equality holds, e.g., ifK ₁=…=K_r=R^d andK _r+1,…,K_n aren?r hyperplanes in general position inR ^d. The proof uses multilinear techniques (exterior algebra). Applications to convexity and to extremal set theory are given.     

Ombres Convexité, régularité et sous-harmonicité

Letf:V→R be a function defined on a subsetV ofR ⁿ ×R ^d let?:x→inf{f(x t);t such that(x t)∈V} denote theshadow off and letΦ={(x t)∈V; f(x t)=?(x)} This paper deals with the characterization of some properties of ? in terms of the infinitesimal behavior off near points ζ∈Φ proving in particular a conjecture of J M Trépreau concerning the cased=1 Characterizations of this type are provided for the convexity the subharmonicity or theC ^{1 1} regularity of ? in the interior ofI={x∈ R ⁿ;εR ^d (x t)∈V} and in theC ^{1 1} case an expression forD ²? is given To some extent an answer is given to the following question: which convex function ?:I→R I interval ?R (resp which function √:I→R of classC ^{1 1}) is the shadow of aC ² functionf:I×R→R?     

On maximal convex lattice polygons inscribed in a plane convex set

Given a convex compact setK ? ?₂ what is the largestn such thatK contains a convex latticen-gon? We answer this question asymptotically. It turns out that the maximaln is related to the largest affine perimeter that a convex set contained inK can have. This, in turn, gives a new characterization ofK ₀, the convex set inK having maximal affine perimeter.     

Characterization off-vectors of families of convex sets inR d Part I: Necessity of Eckhoff’s conditions

LetK=K ₁,...,K_n be a family ofn convex sets inR ^d . For 0≦i<n denote byf _i the number of subfamilies ofK of sizei+1 with non-empty intersection. The vectorf(K) is called thef-vectors ofK. In 1973 Eckhoff proposed a characterization of the set off-vectors of finite families of convex sets inR ^d by a system of inequalities. Here we prove the necessity of Eckhoff's inequalities. The proof uses exterior algebra techniques. We introduce a notion of generalized homology groups for simplicial complexes. These groups play a crucial role in the proof, and may be of some independent interest.