Sciweavers

Share
COMBINATORICS
2004
79views more  COMBINATORICS 2004»
9 years 3 months ago
Bottom Schur Functions
We give a basis for the space spanned by the sum ^s of the lowest degree terms in the expansion of the Schur symmetric functions s in terms of the power sum
Peter Clifford, Richard P. Stanley
COMBINATORICS
2004
75views more  COMBINATORICS 2004»
9 years 3 months ago
Nonexistence Results for Hadamard-like Matrices
The class of square (0, 1, -1)-matrices whose rows are nonzero and mutually orthogonal is studied. This class generalizes the classes of Hadamard and Weighing matrices. We prove t...
Justin D. Christian, Bryan L. Shader
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
9 years 3 months ago
Geometrically Constructed Bases for Homology of Partition Lattices
Abstract. We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "sp...
Anders Björner, Michelle L. Wachs
COMBINATORICS
2004
64views more  COMBINATORICS 2004»
9 years 3 months ago
Weights of Partitions and Character Zeros
Motivated by a question on the zeros of irreducible characters of the symmetric and alternating groups, we classify partitions which are of maximal p-weight for all odd primes p.
Christine Bessenrodt, Jørn B. Olsson
COMBINATORICS
2004
94views more  COMBINATORICS 2004»
9 years 3 months ago
Even Astral Configurations
A configuration (pq, nk) is a collection of p points and n straight lines in the Euclidean plane so that every point has q straight lines passing through it and every line has k p...
Leah Wrenn Berman
COMBINATORICS
2004
76views more  COMBINATORICS 2004»
9 years 3 months ago
Weighted Aztec Diamond Graphs and the Weyl Character Formula
Georgia Benkart, Oliver Eng
COMBINATORICS
2004
48views more  COMBINATORICS 2004»
9 years 3 months ago
Partition Identities I: Sandwich Theorems and Logical 0-1 Laws
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
Jason P. Bell, Stanley Burris
COMBINATORICS
2004
110views more  COMBINATORICS 2004»
9 years 3 months ago
Flag Vectors of Multiplicial Polytopes
Bisztriczky introduced the multiplex as a generalization of the simplex. A polytope is multiplicial if all its faces are multiplexes. In this paper it is proved that the flag vect...
Margaret M. Bayer
COMBINATORICS
2004
61views more  COMBINATORICS 2004»
9 years 3 months ago
Improved Bounds on the Length of Maximal Abelian Square-free Words
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
Evan M. Bullock
books