scholarly journals Triangle-Free Triangulations, Hyperplane Arrangements and Shifted Tableaux

10.37236/2610 ◽  
2012 ◽  
Vol 19 (3) ◽  
Author(s):  
Ron Adin ◽  
Yuval Roichman

Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are deduced. In particular, it is shown that: (1) every diagonal is flipped exactly once in a geodesic between a pair of distinguished antipodes; (2) the number of geodesics between these antipodes is equal to twice the number of standard Young tableaux of a truncated shifted staircase shape.

2021 ◽  
Vol 344 (7) ◽  
pp. 112395
Author(s):  
Rosena R.X. Du ◽  
Jingni Yu

2020 ◽  
Vol 29 (03) ◽  
pp. 2050004
Author(s):  
Hery Randriamaro

The Tutte polynomial is originally a bivariate polynomial which enumerates the colorings of a graph and of its dual graph. Ardila extended in 2007 the definition of the Tutte polynomial on the real hyperplane arrangements. He particularly computed the Tutte polynomials of the hyperplane arrangements associated to the classical Weyl groups. Those associated to the exceptional Weyl groups were computed by De Concini and Procesi one year later. This paper has two objectives: On the one side, we extend the Tutte polynomial computing to the complex hyperplane arrangements. On the other side, we introduce a wider class of hyperplane arrangements which is that of the symmetric hyperplane arrangements. Computing the Tutte polynomial of a symmetric hyperplane arrangement permits us to deduce the Tutte polynomials of some hyperplane arrangements, particularly of those associated to the imprimitive reflection groups.


1997 ◽  
Vol Vol. 1 ◽  
Author(s):  
Jean-Christophe Novelli ◽  
Igor Pak ◽  
Alexander V. Stoyanovskii

International audience This paper presents a new proof of the hook-length formula, which computes the number of standard Young tableaux of a given shape. After recalling the basic definitions, we present two inverse algorithms giving the desired bijection. The next part of the paper presents the proof of the bijectivity of our construction. The paper concludes with some examples.


10.37236/6466 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Ping Sun

Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and $g_{n,5}$ respectively. Specifically, $g_{n,4}$ is the $(2n-1)$-st Pell number.


10.37236/3890 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Ping Sun

In this paper the number of standard Young tableaux (SYT) is evaluated by the methods of multiple integrals and combinatorial summations. We obtain the product formulas of the numbers of skew SYT of certain truncated shapes, including the skew SYT $((n+k)^{r+1},n^{m-1}) / (n-1)^r $ truncated by a rectangle or nearly a rectangle, the skew SYT of truncated shape $((n+1)^3,n^{m-2}) / (n-2) \backslash \; (2^2)$, and the SYT of truncated shape $((n+1)^2,n^{m-2}) \backslash \; (2)$.


2014 ◽  
Vol 57 (4) ◽  
pp. 697-707 ◽  
Author(s):  
Pauline Bailet

AbstractWe describe a general setting where the monodromy action on the first cohomology group of the Milnor fiber of a hyperplane arrangement is the identity.


2012 ◽  
Vol 206 ◽  
pp. 75-97 ◽  
Author(s):  
Alexandru Dimca

AbstractThe order of the Milnor fiber monodromy operator of a central hyperplane arrangement is shown to be combinatorially determined. In particular, a necessary and sufficient condition for the triviality of this monodromy operator is given.It is known that the complement of a complex hyperplane arrangement is cohomologically Tate and, if the arrangement is defined over ℚ, has polynomial count. We show that these properties hold for the corresponding Milnor fibers if the monodromy is trivial.We construct a hyperplane arrangement defined over ℚ, whose Milnor fiber has a nontrivial monodromy operator, is cohomologically Tate, and has no polynomial count. Such examples are shown not to exist in low dimensions.


2017 ◽  
Vol 27 (08) ◽  
pp. 1001-1025
Author(s):  
Marianne Johnson ◽  
Mark Kambites

We study the combinatorics of tropical hyperplane arrangements, and their relationship to (classical) hyperplane face monoids. We show that the refinement operation on the faces of a tropical hyperplane arrangement, introduced by Ardila and Develin in their definition of a tropical oriented matroid, induces an action of the hyperplane face monoid of the classical braid arrangement on the arrangement, and hence on a number of interesting related structures. Along the way, we introduce a new characterization of the types (in the sense of Develin and Sturmfels) of points with respect to a tropical hyperplane arrangement, in terms of partial bijections which attain permanents of submatrices of a matrix which naturally encodes the arrangement.


Sign in / Sign up

Export Citation Format

Share Document