scholarly journals On the Sperner property and Gorenstein Algebras Associated to Matroids

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Toshiaki Maeno ◽  
Yasuhide Numata
Keyword(s):  
Vector Space ◽  
Boolean Lattice ◽  
Sperner Property ◽  
Space Lattice ◽  
Gorenstein Algebras ◽  
Special Cases ◽  
International Audience ◽  
Lefschetz Property

International audience We introduce a certain class of algebras associated to matroids. We prove the Lefschetz property of the algebras for some special cases. Our result implies the Sperner property for the Boolean lattice and the vector space lattice. Nous présentons une classe d'algèbres associées aux matroïdes. Nous démontrons que dans quelques cas spécifiques, ces algèbres vérifient la propriété de Lefschetz. Notre résultat implique la propriété de Sperner pour l'algèbre de Boole et pour le poset d'espace vectoriel.

scholarly journals Operations on partially ordered sets and rational identities of type A

2013 ◽  
Vol Vol. 15 no. 2 (Combinatorics) ◽  
Author(s):  
Adrien Boussicault
Keyword(s):  
Partially Ordered Sets ◽  
Rational Functions ◽  
Hasse Diagram ◽  
Linear Extensions ◽  
Ordered Sets ◽  
Closed Expression ◽  
Schubert Polynomials ◽  
Special Cases ◽  
The Family ◽  
International Audience

Combinatorics International audience We consider the family of rational functions ψw= ∏( xwi - xwi+1 )-1 indexed by words with no repetition. We study the combinatorics of the sums ΨP of the functions ψw when w describes the linear extensions of a given poset P. In particular, we point out the connexions between some transformations on posets and elementary operations on the fraction ΨP. We prove that the denominator of ΨP has a closed expression in terms of the Hasse diagram of P, and we compute its numerator in some special cases. We show that the computation of ΨP can be reduced to the case of bipartite posets. Finally, we compute the numerators associated to some special bipartite graphs as Schubert polynomials.

scholarly journals On the 2-adic order of Stirling numbers of the second kind and their differences

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel
Keyword(s):  
Positive Integer ◽  
Stirling Numbers ◽  
Bell Polynomials ◽  
Binary Representation ◽  
Exact Order ◽  
Special Cases ◽  
International Audience ◽  
The Difference ◽  
Divisibility Properties ◽  
Positive Integers

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.

On Some Invariants of a Bilinear Form

1961 ◽  
Vol 4 (3) ◽  
pp. 261-264
Author(s):  
Jonathan Wild
Keyword(s):  
Vector Space ◽  
Bilinear Form ◽  
Arbitrary Field ◽  
Dimensional Vector ◽  
Dimensional Vector Space ◽  
Finite Dimensional Vector Space ◽  
Finite Dimensional ◽  
Special Cases ◽  
Orthogonal Subspace

Let E be a finite dimensional vector space over an arbitrary field. In E a bilinear form is given. It associates with every sub s pa ce V its right orthogonal sub space V* and its left orthogonal subspace *V. In general we cannot expect that dim V* = dim *V. However this relation will hold in some interesting special cases.

scholarly journals Constructions of L∞ Algebras and Their Field Theory Realizations

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Olaf Hohm ◽  
Vladislav Kupriyanov ◽  
Dieter Lüst ◽  
Matthias Traube
Keyword(s):  
Field Theory ◽  
Initial Data ◽  
Vector Space ◽  
Jacobi Identity ◽  
General Theorem ◽  
Commutator Algebra ◽  
Courant Algebroid ◽  
Linear Map ◽  
General Initial Data ◽  
Special Cases

We construct L∞ algebras for general “initial data” given by a vector space equipped with an antisymmetric bracket not necessarily satisfying the Jacobi identity. We prove that any such bracket can be extended to a 2-term L∞ algebra on a graded vector space of twice the dimension, with the 3-bracket being related to the Jacobiator. While these L∞ algebras always exist, they generally do not realize a nontrivial symmetry in a field theory. In order to define L∞ algebras with genuine field theory realizations, we prove the significantly more general theorem that if the Jacobiator takes values in the image of any linear map that defines an ideal there is a 3-term L∞ algebra with a generally nontrivial 4-bracket. We discuss special cases such as the commutator algebra of octonions, its contraction to the “R-flux algebra,” and the Courant algebroid.

scholarly journals Equivariant Giambelli formula for the symplectic Grassmannians — Pfaffian Sum Formula

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Takeshi Ikeda ◽  
Tomoo Matsumura
Keyword(s):  
Vector Space ◽  
Closed Formula ◽  
International Audience ◽  
Sum Formula ◽  
Isotropic Subspaces ◽  
Espace Vectoriel ◽  
Symplectic Vector Space ◽  
Symplectic Grassmannians ◽  
Schubert Class

International audience We prove an explicit closed formula, written as a sum of Pfaffians, which describes each equivariant Schubert class for the Grassmannian of isotropic subspaces in a symplectic vector space On démontre une formule close explicite, écrite comme une somme de Pfaffiens, qui décrit toute classe de Schubert équivariante pour la Grassmannienne des sous-espaces isotropes dans un espace vectoriel symplectique.

scholarly journals Pattern avoidance in alternating permutations and tableaux (extended abstract)

2010 ◽  
Vol DMTCS Proceedings vol. AN,... (Proceedings) ◽  
Author(s):  
Joel Brewster Lewis
Keyword(s):  
Pattern Avoidance ◽  
Catalan Numbers ◽  
Young Tableaux ◽  
Alternating Permutations ◽  
Special Cases ◽  
Nous Montrons ◽  
Insertion Algorithm ◽  
Generating Trees ◽  
International Audience ◽  
Standard Young Tableaux

International audience We give bijective proofs of pattern-avoidance results for a class of permutations generalizing alternating permutations. The bijections employed include a modified form of the RSK insertion algorithm and recursive bijections based on generating trees. As special cases, we show that the sets $A_{2n}(1234)$ and $A_{2n}(2143)$ are in bijection with standard Young tableaux of shape $\langle 3^n \rangle$. Alternating permutations may be viewed as the reading words of standard Young tableaux of a certain skew shape. In the last section of the paper, we study pattern avoidance in the reading words of standard Young tableaux of any skew shape. We show bijectively that the number of standard Young tableaux of shape $\lambda / \mu$ whose reading words avoid $213$ is a natural $\mu$-analogue of the Catalan numbers. Similar results for the patterns $132$, $231$ and $312$. Nous présentons des preuves bijectives de résultats pour une classe de permutations à motifs exclus qui généralisent les permutations alternantes. Les bijections utilisées reposent sur une modification de l'algorithme d'insertion "RSK" et des bijections récursives basées sur des arbres de génération. Comme cas particuliers, nous montrons que les ensembles $A_{2n}(1234)$ et $A_{2n}(2143)$ sont en bijection avec les tableaux standards de Young de la forme $\langle 3^n \rangle$. Une permutation alternante peut être considérée comme le mot de lecture de certain skew tableau. Dans la dernière section de l'article, nous étudions l'évitement des motifs dans les mots de lecture de skew tableaux généraux. Nous montrons bijectivement que le nombre de tableaux standards de forme $\lambda / \mu$ dont les mots de lecture évitent $213$ est un $\mu$-analogue naturel des nombres de Catalan. Des résultats analogues sont valables pour les motifs $132$, $231$ et $312$.

scholarly journals On substitution tilings of the plane with n-fold rotational symmetry

2015 ◽  
Vol Vol. 17 no. 1 (Discrete Algorithms) ◽  
Author(s):  
Gregory R. Maloney
Keyword(s):  
Rotational Symmetry ◽  
Substitution Tiling ◽  
Computer Assistance ◽  
Discrete Algorithms ◽  
Special Cases ◽  
International Audience ◽  
Substitution Tilings

Discrete Algorithms International audience A method is described for constructing, with computer assistance, planar substitution tilings that have n-fold rotational symmetry. This method uses as prototiles the set of rhombs with angles that are integer multiples of pi/n, and includes various special cases that have already been constructed by hand for low values of n. An example constructed by this method for n = 11 is exhibited; this is the first substitution tiling with elevenfold symmetry appearing in the literature.

scholarly journals On $k$-simplexes in $(2k-1)$-dimensional vector spaces over finite fields

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Le Anh Vinh
Keyword(s):  
Finite Field ◽  
Vector Space ◽  
Finite Fields ◽  
Vector Spaces ◽  
Dimensional Vector ◽  
Dimensional Vector Space ◽  
Nous Montrons ◽  
International Audience

International audience We show that if the cardinality of a subset of the $(2k-1)$-dimensional vector space over a finite field with $q$ elements is $\gg q^{2k-1-\frac{1}{ 2k}}$, then it contains a positive proportional of all $k$-simplexes up to congruence. Nous montrons que si la cardinalité d'un sous-ensemble de l'espace vectoriel à $(2k-1)$ dimensions sur un corps fini à $q$ éléments est $\gg q^{2k-1-\frac{1}{ 2k}}$, alors il contient une proportion non-nulle de tous les $k$-simplexes de congruence.

scholarly journals Symmetric Chain Decompositions and the Strong Sperner Property for Noncrossing Partition Lattices

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Henri Mühle
Keyword(s):  
Coxeter Groups ◽  
Reflection Group ◽  
Sperner Property ◽  
Complex Reflection ◽  
Complex Reflection Groups ◽  
Complex Reflection Group ◽  
Noncrossing Partition ◽  
International Audience ◽  
Partition Lattices ◽  
Special Case

International audience We prove that the noncrossing partition lattices associated with the complex reflection groups G(d, d, n) for d, n ≥ 2 admit a decomposition into saturated chains that are symmetric about the middle ranks. A consequence of this result is that these lattices have the strong Sperner property, which asserts that the cardinality of the union of the k largest antichains does not exceed the sum of the k largest ranks for all k ≤ n. Subsequently, we use a computer to complete the proof that any noncrossing partition lattice associated with a well-generated complex reflection group is strongly Sperner, thus affirmatively answering a special case of a question of D. Armstrong. This was previously established only for the Coxeter groups of type A and B.

Sign in / Sign up

Export Citation Format

Share Document