Bases of minimal vectors in lattices,I

We prove that a Euclidean lattice of dimension n ≤ 8 which is generated by its minimal vectors possesses a basis of minimal vectors. Received: 7 December 2006     

Commuting Derivations and Automorphisms of Certain Nilpotent Lie Algebras Over Commutative Rings

Let L be a finite-dimensional complex simple Lie algebra, L _? be the ?-span of a Chevalley basis of L, and L _R  = R ?_? L _? be a Chevalley algebra of type L over a commutative ring R. Let 𝒩(R) be the nilpotent subalgebra of L _R spanned by the root vectors associated with positive roots. A map ? of 𝒩(R) is called commuting if [?(x), x] = 0 for all x ∈ 𝒩(R). In this article, we prove that under some conditions for R, if Φ is not of type A ₂, then a derivation (resp., an automorphism) of 𝒩(R) is commuting if and only if it is a central derivation (resp., automorphism), and if Φ is of type A ₂, then a derivation (resp., an automorphism) of 𝒩(R) is commuting if and only if it is a sum (resp., a product) of a graded diagonal derivation (resp., automorphism) and a central derivation (resp., automorphism).     

Some remarks on foliatedS 1 bundles

Summary Every two homomorphisms from the fundamental group of an oriented closed surface of genus 2 into the group of orientation preserving homeomorphisms (resp.C ² diffeomorphisms) of the circle are shown to be mutually semi-conjugate (resp. topologically conjugate), provided their Euler numbers attain the minimal value (or the maximal value) allowed by the Milnor-Wood inequality.     

Sampling of Band-Limited Vectors

Given a self-adjoint, positive definite operator on a Hilbert space the concept of band-limited vectors (with a given band-width) is developed, using the spectral decomposition of that operator. By means of this concept sufficient conditions on collections of linear functionals {j_n}\{\varphi_{\nu}\} are derived which imply that all band limited vectors in a given class are uniquely determined resp.can be reconstructed in a stable way from the set of discrete values {j_n(f)}\{\varphi_{\nu}(f)\}.     

Smith Normal Form and acyclic matrices

An approach, based on the Smith Normal Form, is introduced to study the spectra of symmetric matrices with a given graph. The approach serves well to explain how the path cover number (resp. diameter of a tree T) is related to the maximal multiplicity MaxMult(T) occurring for an eigenvalue of a symmetric matrix whose graph is T (resp. the minimal number q(T) of distinct eigenvalues over the symmetric matrices whose graphs are T). The approach is also applied to a more general class of connected graphs G, not necessarily trees, in order to establish a lower bound on q(G).     

On minimal disjoint degenerations of modules over tame path algebras

For representations of tame quivers the degenerations are controlled by the dimensions of various homomorphism spaces. Furthermore, there is no proper degeneration to an indecomposable. Therefore, up to common direct summands, any minimal degeneration from M to N is induced by a short exact sequence 0→U→M→V→0 with indecomposable ends that add up to N. We study these ‘building blocs’ of degenerations and we prove that the codimensions are bounded by two. Therefore, a quiver is Dynkin resp. Euclidean resp. wild iff the codimension of the building blocs is one resp. bounded by two resp. unbounded. We explain also that for tame quivers the complete classification of all the building blocs is a finite problem that can be solved with the help of a computer.     

The order-interval hypergraph of a finite poset and the König property

We study the hypergraph H(P) whose vertices are the points of a finite poset and whose edges are the maximal intervals in P (i.e. sets of the form I = {{v ε P: p ν q}}, p minimal, q maximal). We mention resp. show that the problems of the determination of the independence number , the point covering number τ, the matching number v and the edge covering number p are NP-complete. For interval orders we describe polynomial algorithms and prove the König property (v = τ) and the dual König property (a = p). Finally we show that the (dual) König property is preserved by product.     

Large sets of resolvable MTS and DTS of orders pn + 2

An LRMTS(v) [resp., LRDTS(v)] is a large set consisting of v − 2 [resp., 3(v − 2)] disjoint resolvable Mendelsohn (resp., directed) triple systems of order v. In this article, we give a method to construct LRMTS(pⁿ + 2) and LRDTS(pⁿ + 2), where pⁿ is a prime power and pⁿ ≡ 1 (mod 6). Using the method and a recursive construction v → 3v, some unknown LRMTS(v) and LRDTS(v) are obtained such as for v = 69, 123, 141, 159, and 3^km, where k ≥ 1, m ϵ {7, 13, 37, 55, 57, 61, 65, 67}. © 1996 John Wiley & Sons, Inc.     

On a characterization of analytic compactifications for ℂ* × ℂ*

Let M be a minimal compact surface, let Γ ⊂ M be a compact analytic sub-variety. Assume that X:= M \ Γ is Stein. Then we will show that X admits algebraic compactifications M _i (resp. non algebraic compactifications $ \mathbb{M}_i $ \mathbb{M}_i ) which are not birationally equivalent (resp. not bimeromorphically equivalent) iff X is biholomorphic to      

On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs

A defining set of a t-(v, k, λ) design is a partial design which is contained in a unique t-design with the given parameters. A minimal defining set is a defining set, none of whose proper partial designs is a defining set. This paper proposes a new and more efficient algorithm that finds all non-isomorphic minimal defining sets of a given t-design. The complete list of minimal defining sets of 2-(6, 3, 6) designs, 2-(7, 3, 4) designs, the full 2-(7, 3, 5) design, a 2-(10, 4, 4) design, 2-(10, 5, 4) designs, 2-(13, 3, 1) designs, 2-(15, 3, 1) designs, the 2-(25, 5, 1) design, 3-(8, 4, 2) designs, the 3-(12, 6, 2) design, and 3-(16, 8, 3) designs are given to illustrate the efficiency of the algorithm. Also, corrections to the literature are made for the minimal defining sets of four 2-(7, 3, 3) designs, two 2-(6, 3, 4) designs and the 2-(21, 5, 1) design. Moreover, an infinite class of minimal defining sets for 2-((v) || 3){v\choose3} designs, where v ≥ 5, has been constructed which helped to show that the difference between the sizes of the largest and the smallest minimal defining sets of 2-((v) || 3){v\choose3} designs gets arbitrarily large as v → ∞. Some results in the literature for the smallest defining sets of t-designs have been generalized to all minimal defining sets of these designs. We have also shown that all minimal defining sets of t-(2n, n, λ) designs can be constructed from the minimal defining sets of their restrictions when t is odd and all t-(2n, n, λ) designs are self-complementary. This theorem can be applied to 3-(8, 4, 3) designs, 3-(8, 4, 4) designs and the full 3-(8 || 4)3-{8 \choose 4} design using the previous results on minimal defining sets of their restrictions. Furthermore we proved that when n is even all (n − 1)-(2n, n, λ) designs are self-complementary.     

A Note on Group Choosability of Graphs with Girth at least 4

In this paper we show that the group choice number of a graph without K ₅-minor or K _3,3-minor with girth at least 4 (resp. 6) is at most 4 (resp. 3) and we conclude that these results hold for the group chromatic number, the choice number and the chromatic number.     

On Beauville structures on the groups S n and A n

It is known that the symmetric group S _n , for n ≥ 5, and the alternating group A _n , for large n, admit a Beauville structure. In this paper we prove that A _n admits a Beauville (resp. strongly real Beauville) structure if and only if n ≥ 6 (resp n ≥ 7). We also show that S _n admits a strongly real Beauville structure for n ≥ 5.     

6 j symbols for $U_q (\mathfrak{s}\mathfrak{l}_2 )$U_q (\mathfrak{s}\mathfrak{l}_2 ) and non-Euclidean tetrahedra

We relate the semiclassical asymptotics of the 6j symbols for the quantized enveloping algebra at q a root of unity (resp. q real positive) to the geometry of spherical (resp. hyperbolic) tetrahedra.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Six notes on chains of prime ideals

Summary The following topics are considered: saturated chains of prime ideals in quadratic (resp., simple, local, and level) integral extension domains of a local domain R; the heights of a prime ideal and its contraction in integral extension domains of R; and, the nonexistence of intermediate rings between R and finite integral extension domains of R that are minimal with spect to having certain properties.Research on this paper was supported in part by the National Science Foundation, Grant MCS 8001597.     

The kernel of the Rost invariant, Serre''s Conjecture II and the Hasse principle for quasi-split groups 3,6 D 4 , E 6 , E 7

 We prove that for a simple simply connected quasi-split group of type ^3,6 D ₄ ,E ₆ ,E ₇ defined over a perfect field F of characteristic ≠=2,3 the Rost invariant has trivial kernel. In certain cases we give a formula for the Rost invariant. It follows immediately from the result above that if cd F≤2 (resp. vcd F≤2) then Serre's Conjecture II (resp. the Hasse principle) holds for such a group. For a (C ₂ )-field, in particular ℂ(x,y), we prove the stronger result that Serre's Conjecture II holds for all (not necessary quasi-split) exceptional groups of type ^3,6 D ₄ ,E ₆ ,E ₇ . Received: 27 March 2002 / Published online: 28 March 2003 The author gratefully acknowledge the support of TMR ERB FMRX CT-97-0107 and Forschungsinstitut für Mathematik, ETH in Zürich     

Formal groups and zeta-functions of elliptic curves

The author shows that the isomorphism class of a formal group overZ/pZ (resp. overZ _p ) of finite height (resp. having reduction modp of finite height) is determined by its characteristic polynomial. It is then proved that the formal groups associated to a large class of Dirichlet series with integer coefficients are defined overZ.Finally, these results are used to extend a theorem of Honda (Osaka J. Math.5, 199–213 (1968), Theorem 5) to include the case of supersingular reduction at the primes 2 and 3. LetE be an elliptic curve defined overQ, andF(x, y) be a formal minimal model forE. LetG(x, y) be the formal group associated to the globalL-seriesL(E, s) ofE overQ. Honda's theorem now becomes:G(x, y) is defined over Z and is isomorphic over Z to F(x, y).     

On list‐coloring outerplanar graphs

We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors L (v ) for each vertex v such that (resp., ) can be L‐list‐colored (except when the graph is K₃ with identical 2‐lists). These results are best possible for each condition in the hypotheses and bounds. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 59–74, 2008     

Onl p-complemented copies in Orlicz spaces II

For anyp > 1, the existence is shown of Orlicz spacesL ^F andl ^F with indicesp containingsingular l ^p-complemented copies, extending a result of N. Kalton ([6]). Also the following is proved:Let 1 <α ≦β < ∞and H be an arbitrary closed subset of the interval [α, β].There exist Orlicz sequence spaces l ^F (resp. Orlicz function spaces L^F)with indices α and β containing only singular l ^p-complemented copies and such that the set of values p > 1for which l ^p is complementably embedded into l^F (resp. L ^F)is exactly the set H (resp. H ∪ {2&#x007D;). An explicitly defined class of minimal Orlicz spaces is given. Supported in part by CAICYT grant 0338-84.     

K6‐minors in triangulations and complete quadrangulations

In this paper, we shall prove that a projective‐planar (resp., toroidal) triangulation G has K₆ as a minor if and only if G has no quadrangulation isomorphic to K₄ (resp., K₅ ) as a subgraph. As an application of the theorems, we can prove that Hadwiger's conjecture is true for projective‐planar and toroidal triangulations. © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 302‐312, 2009