Related papers: A combinatorial model for the transition matrix be…
We examine the cell modules for the category of type An webs and their natural cellular forms. We modify the bases of these modules, as described by Elias, to obtain an orthogonal basis of each cell module. Hence, we calculate the…
In this working paper, we present a simple theoretical framework based on network theory to study how speciation, the process by which new species appear, shapes spatial patterns of diversity. We show that this framework can be expanded to…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…
This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…
The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…
This thesis deals with three different aspects of the combinatorics of permutations. In the first two papers, two flavours of pattern avoiding permutations are examined; and in the third paper Young tableaux, which are closely related to…
The purpose of this article is to initiate a combinatorial study of the Bruhat-Chevalley ordering on certain sets of permutations obtained by omitting the parentheses from their standard cyclic notation. In particular, we show that these…
Knowledge bases of real-world facts about entities and their relationships are useful resources for a variety of natural language processing tasks. However, because knowledge bases are typically incomplete, it is useful to be able to…
We characterize permutations whose Bruhat graphs can be drawn in the plane and those whose Bruhat graphs can be drawn in the torus. In particular, we show these properties are characterized by avoiding finitely many permutations.
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
The behaviour of electrical networks can be described with many different representations, each with their distinct benefits. In this paper, we consider Z, Y, G, H, ABCD, S and T parameters. Formulas exist to go from one representation to…
The stochastic addition of either vertices or connections in a network leads to the observation of the percolation transition, a structural change with the appearance of a connected component encompassing a finite fraction of the system.…
A recent paper by Zapletal arXiv:2404.10612 discusses permutation models of set theory which arise from dynamical ideals and highlights properties of the dynamical ideal which relate to fragments of choice in the permutation model. In this…
Permutation modules play an important role in the representation theory of the symmetric group. Hartmann and Paget defined permutation modules for non-degenerate Brauer algebras. We generalise their construction to a wider class of…
In type A, Kleshchev-Ram-Mathas realize Specht modules as quotient of Permutation modules, in this paper, we construct a Specht filtration of Permutation modules indexed by hook partition in affine type A; and construct a generalized Specht…
Baxter permutations are a class of permutations which are in bijection with a class of floorplans that arise in chip design called mosaic floorplans. We study a subclass of mosaic floorplans called $HFO_k$ defined from mosaic floorplans by…
We consider probabilistic topic models and more recent word embedding techniques from a perspective of learning hidden semantic representations. Inspired by a striking similarity of the two approaches, we merge them and learn probabilistic…
In this chapter we provide an overview of computational modeling for semantic change using large and semi-large textual corpora. We aim to provide a key for the interpretation of relevant methods and evaluation techniques, and also provide…
We analyze an idealized model for the transmission or flow of particles, or discrete packets of information, in a weight bearing branching hierarchical 2-D networks, and its variants. The capacities add hierarchically down the clusters.…