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 |
Results tagged with co.combinatorics
Search options not deleted
user 10881
Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.
2
votes
Grobner fan linked to associahedra?
The Grassmannian Gr(2,n) is closely related to the associahedra, by the mean of Fomin and Zelevinsky's theory of cluster algebras. The natural cluster algebra structure on the space of homogeneous fun …
10
votes
rational function identity
This property ( or rather the generalized version by Darij using (a,b)-shuffles ) means that f is what is called a "symmetral mould" in the context of Ecalle's theory of moulds. There is a related not …
15
votes
0
answers
588
views
On some special spanning trees of grid graphs
I would like to know if there are existing results on the following objects:
spanning trees of a grid graph, with no corridor
where a corridor is a vertex having exactly two neighbors, on opposi …
2
votes
Accepted
Birkhoff Lattice of a forest
This set of lattices is the closure of the set {poset with one element} under two allowed operations: adding a top element or taking a Cartesian product. This implies that the Möbius numbers are in $\ …
7
votes
2
answers
258
views
About the sum of rectangular power sums
Let $n \geq 1$ be an integer and consider the symmetric function
$$D_n = \sum_{d|n} p_d^{n/d},$$
where $p_{d}$ are the power-sum symmetric functions.
It can be checked up to $n=35$ that the symmetric …
3
votes
0
answers
120
views
About finite posets without intervals of size 3
Let $P$ be a finite poset (partially ordered set).
I am wondering whether the following condition on $P$ has been studied somewhere:
(#) No interval $[a,b]$ in $P$ has $3$ elements.
Note that interv …
4
votes
Combinatorial interpretation of composition of power series?
When rephrased (using the positive generating series $g=-f$) as the identity $g(-g(-t))=t$, this suggests that there may exist a quadratic nonsymmetric operad with this generating series, which is Kos …
2
votes
Kahler differentials on cluster varieties
There is not much known in general, as far as I know.
There is a nice 2-form (called the Weil-Petersson 2-form) defined using the cluster algebra structure.
This can be found in article "The Weil-Pe …
9
votes
Accepted
Software for recognizing algebraic or D-finite formal power series
Fricas is good at that. It can be accessed via sage, once installed.
sage: L=[catalan_number(i) for i in range(20)]
sage: fricas.guessHolo(L) …
7
votes
Symmetric powers of Schur polynomials
this could be done in sage:
sage: B3 = WeylCharacterRing("B3", style="coroots")
sage: spin = B3(0,0,1)
sage: spin.symmetric_power(6)
B3(0,0,0) + B3(0,0,2) + B3(0,0,4) + B3(0,0,6)
sage: A3 = WeylChar …
3
votes
Grassmannian cluster algebra of infinite type has no trees in its mutation class
Regarding question Q2, one can go a little bit further and describe simple diagrams with few edges for some more cases.
Let us talk about $Gr(p, p+q)$, so that there is a symmetry between $p$ and $q$. …
6
votes
0
answers
276
views
universality for large deviations?
This is a question about universality in probability theory, with combinatorics in mind.
Consider a sequence of polynomials $P_n$ in one variable, with positive coefficients. Combinatorics is a large …
5
votes
Accepted
an algebra generated by some known series
This has been considered by Dimitri Zvonkine, see his article "An algebra of power series arising in the
intersection theory of moduli spaces of curves
and in the enumeration of ramified coverings
of …
2
votes
Number of trees with the same matching number
This can be done using the canonical coloring of vertices of trees into 3 colors that can be found in
J. Zito, "The structure and maximum number of maximum independent sets in trees"
S. Coulomb and …
1
vote
Flow of an integer
As a service to the community, here are these digraphs in sage:
def divisor_graph(n):
"""
Mathoverflow 159319
"""
vert = divisors(n)
return DiGraph([(a, b, b / a) for b in vert
…