Related papers: Computing growth functions of braid monoids and co…

For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…

Party-Hecke algebras are introduced as a two-parameter deformation of party algebras, where one parameter deforms the party generators and the other deforms the elementary transpositions. We construct a basis for this algebra and show that…

Counting short cycles in bipartite graphs is a fundamental problem of interest in many fields including the analysis and design of low-density parity-check (LDPC) codes. There are two computational approaches to count short cycles (with…

We count the n-strand braids whose normal decomposition has length at most two in the dual braid monoid B_n+* by reducing the question to a computation of free cumulants for a product of independent variables, for which we establish a…

We investigate the function d_A(n), which gives the size of a least size generating set for A^n.

We consider the problem of counting motifs in bipartite affiliation networks, such as author-paper, user-product, and actor-movie relations. We focus on counting the number of occurrences of a "butterfly", a complete $2 \times 2$ biclique,…

I report the recent advances in applying (graded) Hopf algebras with braided tensor product in two scenarios: i) paraparticles beyond bosons and fermions living in any space dimensions and transforming under the permutation group; ii)…

Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…

We compute the $p$-central and exponent-$p$ series of all right angled Artin groups, and compute the dimensions of their subquotients. We also describe their associated Lie algebras, and relate them to the cohomology ring of the group as…

We present families of combinatorial classes described as trees with nodes that can carry one of two types of "flowers": integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of…

Braid groups and mapping class groups have many features in common. Similarly to the notion of inverse braid monoid inverse mapping class monoid is defined. It concerns surfaces with punctures, but among given $n$ punctures several can be…

We prove that an Artin-Tits group of type $\tilde C$ is the group of fractions of a Garside monoid, analogous to the known dual monoids associated with Artin-Tits groups of spherical type and obtained by the "generated group" method. This…

We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…

The bigraded Betti numbers b^{-i,2j}(P) of a simple polytope P are the dimensions of the bigraded components of the Tor groups of the face ring k[P]. The numbers b^{-i,2j}(P) reflect the combinatorial structure of P as well as the topology…

In arXiv:0910.1727 we find certain finite homomorphic images of Artin braid group into appropriate symmetric groups, which a posteriori are extensions of the symmetric group on n letters by an abelian group. The main theorem of this paper…

We study asymptotic behaviour of the correlation functions of bipartite sparse random $N\times N$ matrices. We assume that the graphs have $N$ vertices, the ratio of parts is $\displaystyle\frac{\alpha}{1-\alpha}$ and the average number of…

In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…

A set of vertices in a graph is called independent if no two vertices of the set are connected by an edge. In this paper we use the state matrix recursion algorithm, developed by Oh, to enumerate independent vertex sets in a grid graph and…

We study the class of functions on the set of (generalized) Young diagrams arising as the number of embeddings of bipartite graphs. We give a criterion for checking when such a function is a polynomial function on Young diagrams (in the…

This paper demonstrates how to explicitly construct a bidiagonal factorization of the banded recurrence matrix that appears in mixed multiple orthogonality on the step-line in terms of the coeffcients of the mixed multiple orthogonal…