Deformation of chains via a local symmetric group action.
Hersh, Patricia (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hersh, Patricia (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stanley, Richard P. (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Schweig, Jay (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bezrukov, Sergei L., Leck, Uwe (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Adam Korányi, Fulvio Ricci (2010)
Colloquium Mathematicae
Similarity:
A relatively simple algebraic framework is given, in which all the compact symmetric spaces can be described and handled without distinguishing cases. We also give some applications and further results.
McKenna, Geoffrey (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Woodroofe, Russ (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stanley, Richard P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Shareshian, John, Wachs, Michelle L. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Reading, Nathan (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
N. Spanoudakis (1994)
Studia Mathematica
Similarity:
In a previous paper we gave an example of a finite distributive subspace lattice ℒ on a Hilbert space and a rank two operator of Algℒ that cannot be written as a finite sum of rank one operators from Algℒ. The lattice ℒ was a specific realization of the free distributive lattice on three generators. In the present paper, which is a sequel to the aforementioned one, we study Algℒ for the general free distributive lattice with three generators (on a normed space). Necessary and sufficient...
Zhibin Du, Carlos M. da Fonseca (2016)
Open Mathematics
Similarity:
In this work we show that the Bruhat rank of a symmetric (0,1)-matrix of order n with a staircase pattern, total support, and containing In, is at most 2. Several other related questions are also discussed. Some illustrative examples are presented.
Dukes, W.M.B. (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Sivek, Steven (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: