Related papers: Relative Combinatorial Asphericity
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…
Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ and $\Psi$ are combinatorially similar if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…
We prove that the acyclic reorientation poset of a directed acyclic graph $D$ is a lattice if and only if the transitive reduction of any induced subgraph of $D$ is a forest. We then show that the acyclic reorientation lattice is always…
A combinatorial characterization of measurable filters on a countable set is found. We apply it to the problem of measurability of the intersection of nonmeasurable filters.
We clarify steps for determining the ${\rm SL}(2,\mathbb{C})$-character variety of any arborescent knot. Interestingly, we show that the `excellent parts' of arborescent knots $K_1,K_2$ are isomorphic if $K_1$ can be related to $K_2$…
Random Forests and related tree-based methods are popular for supervised learning from table based data. Apart from their ease of parallelization, their classification performance is also superior. However, this performance, especially…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
Some of the motivations for quark and lepton compositeness, and some problems associated with present schemes, are noted. One model is discussed in which quarks and leptons are taken as composites of spin-1/2 fermions $F$ with charges $\pm…
We describe in this note a new invariant of rooted trees. We argue that the invariant is interesting on it own, and that it has connections to knot theory and homological algebra. However, the real reason that we propose this invariant to…
The 2(2s+1)-component relativistic basis spinors for the arbitrary spin particles are established in position, momentum and four-dimensional spaces, where s=0,1 / 2,1, 3 / 2, 2, ... . These spinors for integral- and half-integral spins are…
We study the complexity and expressive power of conjunctive queries over unranked labeled trees represented using a variety of structure relations such as ``child'', ``descendant'', and ``following'' as well as unary relations for node…
Meadows are a sort of commutative rings with a multiplicative identity element and a total multiplicative inverse operation. In this paper we study algebraic properties of common meadows, which are meadows that introduce, as the inverse of…
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence;…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
In this semi-expository paper we review the notion of a spherical space. In particular we present some recent results of Wedhorn on the classification of spherical spaces over arbitrary fields. As an application, we introduce and classify…
We show that ribbon rational homology cobordism is a partial order within the class of irreducible 3-manifolds. This makes essential use of the methods recently employed by Ian Agol to show that ribbon knot concordance is a partial order.
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…