Báo cáo toán học: "Stable Equivalence over Symmetric Functions" doc
Báo cáo toán học: "Stable Equivalence over Symmetric Functions" doc
... equivalent to each other over symmetric functions. As a consequence, the
Jacobi-Trudi matrix and the transpose of the dual Jacobi-Trudi matrix are stably equiva-
lent over symmetric functions. This ... Stable Equivalence over Symmetric Functions
William Y. C. Chen
1
and Arthur L. B. Yang
2
Center for Combinatorics, ... stable equivalence of matrices over a ring, under
which...
Báo cáo toán học: "Partitions, rooks, and symmetric functions in noncommuting variables" pdf
... B. E. A chro matic symmetric function in noncom-
muting variables. J. Algebraic Combin. 13, 3 (2001), 227–255.
[6] Riordan, J. An introduction to combinatorial analysis. Dover Publica t io ns, ... Rosas, M. H., and Sagan, B. E. Symmetric functions in noncommuting variables.
Trans. Amer. Math. Soc. 358, 1 (2006), 215–232 (electronic).
[8] Stanley, R. P. A symmetric function generalizatio...
Báo cáo toán học: " Local equivalence of transversals in matroids" pptx
... cycles of size 3, subspaces of
an n-dimensional vector space over GF(2).
A partial case of Theorem 2 for M a linear vector space over the field GF (2),
and V
i
one- or two-dimensional subspaces ... the electronic journal of combinatorics 3 (1996), #R24 2
1 Sufficient conditions of local equivalence
Here we shall prove two sufficient conditions for all transversals of a set system to ... part...
Báo cáo toán học: "On sums over partially ordered sets" ppsx
... Z
g(y)=
Z⊆Y
0
,Z=∅
(−1)
|Z|−1
f(sup Z) .
By the preceding lemma, any z ∈ Z is k-open and hence, sup Z is k-open. Since
moreover sup Z>x
0
, the requirements give f(sup Z) = 0, whence the result.
Dualizing Theorem 2.1 ... also note that 3.1 ⇒ 3.2 ⇒ 3.3.)
the electronic journal of combinatorics 6 (1999), #R34 2
2. Sums over partially ordered sets
We assume that the reader is familiar wi...
Báo cáo toán học: "Linear Codes over Finite Chain Rings" doc
... correspondence between
equivalence classes of so-called fat left linear codes over a chain ring and equivalence
classes of multisets of points in right projective Hjelmslev geometries over the same
ring. ... codes over finite fields
as multisets of points in classical projective geometries PG(k,q) [10]. However, there
are some differences between linear codes over finite fields and lin...
Báo cáo toán học: "Venn Diagrams and Symmetric Chain Decompositions in the Boolean Lattice" ppt
... the chain cover property: the
monotone case for all n is covered in Section 2.1, and the symmetric case for n prime is
covered in Section 2.2. Section 3 describes the Greene-Kleitman symmetric ... by
R
n
has a symmetric chain decomposition with a certain cover property. Furthermore,
from the SCD in this necklace-representative poset, we can construct a symmetric Venn
diagram.
1.6 Over...
Từ khóa: