Related papers: A proof of Pieri's formula using the generalized S…

Ricci curvature was proposed by Ollivier in a general framework of metric measure spaces, and it has been studied extensively in the context of graphs in recent years. In this paper we prove upper bounds for Ollivier's Ricci curvature for…

We develop a new method for enumerating independent sets of a fixed size in general graphs, and we use this method to show that a conjecture of Engbers and Galvin holds for all but finitely many graphs. We also use our method to prove…

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show…

We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.

Szemer\'edi's regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemer\'edi's theorem on arithmetic progressions . In this note we revisit this lemma from…

We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…

We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…

Graphical models use graphs to compactly capture stochastic dependencies amongst a collection of random variables. Inference over graphical models corresponds to finding marginal probability distributions given joint probability…

A wide class of machine learning algorithms can be reduced to variable elimination on factor graphs. While factor graphs provide a unifying notation for these algorithms, they do not provide a compact way to express repeated structure when…

We study combinatorial aspects of the Schubert calculus of the affine Grassmannian Gr associated with SL(n,C). Our main results are: 1) Pieri rules for the Schubert bases of H^*(Gr) and H_*(Gr), which expresses the product of a special…

We generalize an equation introduced by Benamou and Brenier, characterizing Wasserstein W_p-geodesics for p > 1, from the continuous setting of probability distributions on a Riemannian manifold to the discrete setting of probability…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

Rubei et. al., established results for the distance matrix of positive weighted Petersen graphs. Focusing on the properties of the distance matrix, we generalized positive weighted Petersen graphs results to Kneser graphs. We analyzed…

We give an elementary proof of the Pieri-type formula in the cohomology of a Grassmannian of maximal isotropic subspaces of an odd orthogonal or symplectic vector space. This proof proceeds by explicitly computing a triple intersection of…

We introduce a new method for decomposing the edge set of a graph, and use it to replace the Regularity lemma of Szemer\'edi in some graph embedding problems. An algorithmic version is also given.

The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…

We present several equinumerous results between generalized oscillating tableaux and semistandard tableaux and give a representation-theoretical proof to them. As one of the key ingredients of the proof, we provide Pieri rules for the…

In a seminal paper Richard Stanley derived Pieri rules for the Jack symmetric function basis. These rules were extended by Macdonald to his now famous symmetric function basis. The original form of these rules had a forbidding complexity…

We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…

For a graph G, the graph R(G) of a graph G is the graph obtained by adding a new vertex for each edge of G and joining each new vertex to both end vertices of the correspond- ing edge. Let I(G) be the set of newly added vertices. In this…