Related papers: Enumerating the symplectic Dellac configurations
By algebraic group theory, there is a map from the semisimple conjugacy classes of a finite group of Lie type to the conjugacy classes of the Weyl group. Picking a semisimple class uniformly at random yields a probability measure on…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
Hetyei recently introduced a hyperplane arrangement (called the homogenized Linial arrangement) and used the finite field method of Athanasiadis to show that its number of regions is a median Genocchi number. These numbers count a class of…
We prove results exploring the relationship between the fundamental group and the second Betti number of minimal symplectic fillings of lens spaces. These results unify and generalize several disparate facts appearing in the literature. The…
We characterize the Dirac structures that are parallel with respect to Gualtieri's canonical connection of a generalized Riemannian metric. On the other hand, we discuss Dirac structures that are images of generalized tangent structures.…
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…
Let $\Delta =\{ \delta_1,\delta_2,...,\delta_m \} $ be a finite set of 2-connected patterns, i.e. graphs up to vertex relabelling. We study the generating function $D_{\Delta }(z,u_1,u_2,...,u_m),$ which counts polygon dissections and marks…
Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…
The recent hardware trend towards reduced precision computing has reignited the interest in numerical techniques that can be used to enhance the accuracy of floating point operations beyond what is natively supported for basic arithmetic…
A log symplectic manifold is a Poisson manifold which is generically nondegenerate. We develop two methods for constructing the symplectic groupoids of log symplectic manifolds. The first is a blow-up construction, corresponding to the…
A new type of link between geometry of symplectic group and entanglement-assisted (EA) quantum error-correcting codes (EAQECCs) is presented. Relations of symplectic subspaces and quaternary additive codes concerning parameters of EAQECCs…
We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, $\tau=123$ and $n$ even, is a bijection that associates a Dyck prefix of…
In this paper we prove the connectedness of symplectic ball packings in the complement of a spherical Lagrangian, S^2 or RP^2, in symplectic manifolds that are rational or ruled. Via a symplectic cutting construction this is a natural…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
In this paper we consider a random partition of the plane into cells, the partition being based on the nodes and links of a {\it random planar geometric graph}. The resulting structure generalises the \emph{random \tes}\ hitherto studied in…
In this paper, by using some families of special numbers and polynomials with their generating functions, we give various properties of these numbers and polynomials. These numbers are related to the well-known numbers and polynomials,…
We show the existence of a limiting distribution $\cD_\cC$ of the adequately normalized discrepancy function of a random translation on a torus relative to a strictly convex set $\cC$. Using a correspondence between the small divisors in…
We investigate the line arrangement that results from intersecting d complete flags in C^n. We give a combinatorial description of the matroid T_{n,d} that keeps track of the linear dependence relations among these lines. We prove that the…
A symplectic structure is canonically constructed on any manifold endowed with a topological linear k-system whose fibers carry suitable symplectic data. As a consequence, the classification theory for Lefschetz pencils in the context of…
We provide the combinatorial proofs of the log-convexity for the derangement numbers in the symmetric group $\mathfrak{S}_n$, hyperoctahedral group $\mathfrak{B}_n$, and the demihyperoctahedral group $\mathfrak{D}_n$. We also show that the…