Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
6
votes
2
answers
276
views
"Minimal" connected matroids
I'm interested in connected matroids $M$ on the ground set $[n]$ for which there is no connected matroid on $[n]$ of the same rank but with a strictly smaller set of bases (by inclusion). Equivalently …
1
vote
Permutohedron and triangulation of cube via Eulerian numbers
One context in which this relationship between the hypercube and the permutahedron appears is as follows. The space of weights of the Lie algebra $\mathfrak{sl}_n$ is naturally identified with $\mathb …
1
vote
Integer decomposition property with a partial order
Just stumbled upon this question, pardon the necropost. There exist broad families of poset polytopes generalizing order and chain polytopes. These are known to have your IDP$\le$ property.
The first …
6
votes
0
answers
181
views
Natural bijection between join- and meet-irreducibles in modular lattices?
A well known property of finite modular lattices is that they have the same number of join-irreducible and meet-irreducible elements. I was wondering if there exists a natural bijection between these …
3
votes
2
answers
809
views
On a positivity property of Hall-Littlewood polynomials
Here's the new, more thought through version.
Consider a sequence of nonnegative integers $\lambda=(\lambda_1,\ldots,\lambda_n)$ with $\lambda_i\ge \lambda_{i+1}+2$ (the weight $\lambda-2\rho$ is dom …
20
votes
4
answers
2k
views
An $n!\times n!$ determinant
Let us consider the matrix $A$ with its rows and columns enumerated by the elements of $S_n$ with $A_{\sigma\tau}=x^{c(\sigma\tau^{-1})}$ where $c()$ is the number of cycles in a permutation's decompo …
2
votes
0
answers
246
views
Ideals with the same Hilbert series
Consider a polynomial ring $\mathbb C[x_1,\ldots,x_n]$ that is $\mathbb Z_{\ge 0}$-graded by degree. Let $I$ and $J$ be two homogeneous ideals therein with the same Hilbert series, i.e. with their hom …
11
votes
0
answers
426
views
Connection between Gelfand-Tsetlin basis and SSYT basis in Schur module
Consider an $n$-dimensional complex vector space $V$ with a chosen basis $e_1,\ldots,e_n$. This basis defines a Cartan decompostion of $GL(V)\cong GL_n$ and for an (integral dominant) highest weight $ …
6
votes
0
answers
254
views
Branching rules for type B/C/D Hall-Littlewood polynomials
For a root system $\Phi$ of rank $n$ with Weyl group $W$ and a dominant integral weight $\lambda$ consider the Hall-Littlewood polynomial $$P_\lambda(x_1,\ldots,x_n;t)=\frac1{W_\lambda(t)}\sum_{w\in W …
7
votes
0
answers
188
views
Reference for an "elementary" combinatorial fact
This is a question I've been meaning to ask for quite some time.
Fact. For $n\in\mathbb N$ consider the set of segments $R=\{[i,j], 1\le i<j\le n\}$. Let a subset $E\subset R$ be nice iff $E$ is clos …
4
votes
1
answer
206
views
Representing a graph's vertices as linear combinations of paths
I have a (directed graded) graph $G=(V,E)$ with two distinguished subsets of $V$: sources and destinations. I am to show that the set of indicator functions of paths starting in a source and ending in …
4
votes
0
answers
158
views
Reference for the notion of polyhedra "degenerations"
Let $P$ be a convex polyhedron and let $P(t)$ be a continuous deformation thereof, such that:
a) $P(0)=P$;
b) for all $t\in[0;1)$ the polyhedron $P(t)$ is strongly combinatorially equivalent to $P$ …
5
votes
0
answers
136
views
Face structures of chain polytopes
For a finite poset $P$ the chain polytope $\mathscr C(P)\subset\mathbb{R}^P$ consists of such $g$ that $g(p)\ge 0$ for all $p\in P$ and $$g(p_1)+\ldots+g(p_n)\le 1$$ for any chain $p_1<\ldots<p_n$.
I …
16
votes
1
answer
694
views
An introduction to Macdonald polynomials other (better?!) than SFHP
Long story short, I personally find Macdonald's celebrated book Symmetric Functions and Hall Polynomials somewhat difficult to read for various reasons. I also know for a fact that I'm not the only on …
3
votes
0
answers
144
views
Looking for a natural definition of certain polynomials associated with skew Young diagrams
Consider a connected skew Young diagram in the English notation and then rotate it counterclockwise by $\pi/4$. This rotation can be avoided by simply replacing "rows" by "diagonals" in the below, but …