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.
1
vote
2
answers
475
views
(Lower) homotopy groups from triangulations
Both cohomology and homotopy groups capture global topological information of a manifold $X$. It is interesting to ask if they can be computed from local data. A triangulation $T$ is a natural present …
0
votes
0
answers
221
views
Generating function with essential singularities
I was recently introduced to analytic combinatorics, and found the method of removing poles astonishing. More precisely, I was reading the last chapter of the popular "generatingfunctionology", in whi …
12
votes
2
answers
1k
views
A toy model in 0-d QFT
Questions
For any positive integer $r$, compute $$(\frac{d}{dY})^r e^{(Y^2)}| _{Y=0}.$$ The answer should directly relates to a counting problem about Feynman diagrams.
Is there a tutorial for how F …
3
votes
1
answer
187
views
Analytic approximation of the step function in $L^p$ norm
Motivation: Euler-Maclaurin formula uses calculus to estimate discrete sums. I wonder what one can do by reverse engineering. A concrete problem I ran into is the following.
Question: Let $\chi: \math …
2
votes
1
answer
332
views
Combinatorial meaning of a binomial expansion
Let $F$ be a generating function $F(x) = \sum_{i=0}^\infty f_i x^i$, and
suppose that we can do operations formally without worrying about
convergence issues.
Define the coefficients
\begin{gather*}
a …
5
votes
1
answer
289
views
Combinatorial Skeleton of a Riemannian manifold
In Chung and Yau's paper: "A combinatorial trace formula" (MSN), they proved
a combinatorial version of Selberg's trace formula for lattice graphs.
I learned also in the setup that it makes sense to d …
7
votes
1
answer
471
views
Combinatorial meaning of Kazhdan-Lusztig-Stanley polynomial
This question is motivated by
Why do combinatorial abstractions of geometric objects behave so well?
The algebraic geometry of Kazhdan-Lusztig-Stanley polynomials
Kazhdan-Lusztig-Stanley polynomial …
4
votes
0
answers
382
views
Obstruction of smooth structure
The first 24 lectures of Jacob Lurie on Geometric Topology [1]
gave a concise introduction to the comparison of smooth manifolds
and piecewise-linear manifold. In the first five lectures, it is
shown …
6
votes
0
answers
243
views
What do Macdonald polynomials hint about $\operatorname{Rep}(S_\infty)$?
$\DeclareMathOperator\Rep{Rep}$It is well-known that the Macdonald "$P$" polynomials deform the
Jack "$J$" polynomials [1]. The latter have profound relations with
representation theory. For example, …
0
votes
1
answer
206
views
Local behavior of the Vandermonde convolution
An interesting combinatorial identity is the Vandermonde convolution identity:
$$ \sum_k {n\choose k}{m\choose s-k} = {n+m \choose s},$$
which can be proved by considering the coefficients in $(x+1)^{ …
1
vote
0
answers
165
views
Khovanov $A_\infty$ algebra
Let $L$ be a link in $\mathbb{R}^3$, with $D, D'$ be diagrams in
$\mathbb{R}^2$ representing $L$. Khovanov constructed two graded
chain complexes $$C_{D} = (Ch_{D}, d_{D}) \quad C_{D'}=(Ch_{D'},
d_{D' …