Related papers: On Hook Formulas for Cylindric Skew Diagrams

The ``Flux conjecture'' for symplectic manifolds states that the group of Hamiltonian diffeomorphisms is C^1-closed in the group of all symplectic diffeomorphisms. We prove the conjecture for spherically rational manifolds and for those…

Set-valued tableaux, introduced by Buch to express the tableaux-sum formula for stable Grothendieck polynomials, generalize semistandard tableaux. We provide a new recursive proof that the number of set-valued tableaux of a given shape is…

Recently Blasiak gave a combinatorial rule for the Kronecker coefficient $g_{\lambda \mu \nu}$ when $\mu$ is a hook shape by defining a set of colored Yamanouchi tableaux with cardinality $g_{\lambda\mu\nu}$ in terms of a process called…

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and…

We prove a conjecture of Okada giving an exact formula for a certain statistic for hook-lengths of partitions: \frac{1}{n!} \sum_{\lambda \vdash n} f_{\lambda}^2 \sum_{u \in \lambda} \prod_{i=1}^{r}(h_u^2 - i^2) = \frac{1}{2(r+1)^2}…

Many conjectures and open problems in graph theory can either be reduced to cubic graphs or are directly stated for cubic graphs. Furthermore, it is known that for a lot of problems, a counterexample must be a snark, i.e. a bridgeless cubic…

A standard barely set-valued tableau of shape $\lambda$ is a filling of the Young diagram $\lambda$ with integers $1,2,\dots,|\lambda|+1$ such that the integers are increasing in each row and column, and every cell contains one integer…

In the article, the main ideas of the induction construction arXiv:1204.0194, arXiv:1110.4737, arXiv:1202.0941, arXiv:1208.4466 are considered in the form of sketches. The article establishes a link between Clifford algebras and…

Using equivariant cohomology theory, Naruse obtained a hook length formula for the number of standard Young tableaux of skew shape $\lambda/\mu$. Morales, Pak and Panova found two $q$-analogues of Naruse's formula respectively by counting…

We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.

We present a simple combinatorial proof of Postnikov's hook length formula for binary trees.

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…

We consider the notion of mosaic diagrams for surface-links using marked graph diagrams. We establish bounds, in some cases tight, on the mosaic numbers for the surface-links with ch-index up to 10. As an application, we use mosaic diagrams…

A telegraphic survey of some of the standard results and conjectures about the set $C({\bf Q})$ of rational points on a smooth projective absolutely connected curve $C$ over ${\bf Q}$.

We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicings. It allows us to prove a uniform exponential character…

The aim of this paper is to generalize the notion of conformal blocks to the situation in which the Lie algebra they are attached to is not defined over a field, but depends on covering data of curves. The result will be a sheaf of…

In this paper we consider all possible generalizations of the B-type Hecke algebras, namely the cyclotomic and what we call 'generalized', and we construct Markov traces on each of them, so as to obtain all possible different levels of…

We compute the regularity of powers and symbolic powers of edge ideals of all cubic circulant graphs. In particular, we establish Conjecture of Minh for cubic circulant graphs.

The main purpose of this paper is to report on the state of the art of computing integer hulls and their facets as well as counting lattice points in convex polytopes. Using the polymake system we explore various algorithms and…

We give explicit formulas for the number of distinct elliptic curves over a finite field, up to isomorphism, in the families of Legendre, Jacobi, Hessian and generalized Hessian curves.