Related papers: Enumeration of strong dichotomy patterns

Based on an explicit formula of the generating series for the $n$-point psi-class intersection numbers (cf. Bertola et. al. [4]), we give a novel proof of a conjecture of Delecroix et. al. [9] regarding the large genus uniform leading…

In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…

We propose a method for characterizing large complex networks by introducing a new matrix structure, unique for a given network, which encodes structural information; provides useful visualization, even for very large networks; and allows…

The usual coherence theorem of MacLane for categories with multiplication assumes that a certain pentagonal diagram commutes in order to conclude that associativity isomorphisms are well defined in a certain practical sense. The practical…

Let $T_{4p}=\langle a,b\mid a^{2p}=1,a^p=b^2, b^{-1}ab=a^{-1}\rangle$ be the dicyclic group of order $4p$. A Cayley digraph over $T_{4p}$ is called a dicirculant digraph. In this paper, we calculate the number of (connected) dicirculant…

In this paper, we investigate the order types of reflection orders on irreducible affine Weyl groups. We show that they are intimately related to the Catalan combinatorics. We explicitly describe all of those order types and show that these…

The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…

In a previous paper I gave a presentation for the Quillen higher algebraic K-groups of an exact category in terms of "acyclic binary multicomplexes". In this paper I take that presentation as a definition of the higher K-groups, generalize…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…

In a previous paper, the author and his collaborators studied the phenomenon of isotropy in the context of single-sorted equational theories, and showed that the isotropy group of the category of models of any such theory encodes a notion…

We show that if $D$ is a tournament of arbitrary size then $D$ has finite strong components after reversing a locally finite sequence of cycles. In turn, we prove that any tournament can be covered by two acyclic sets after reversing a…

We give an explicit subword complex description of the generators of the type cone of the g-vector fan of a finite type cluster algebra with acyclic initial seed. This yields in particular a description of the Newton polytopes of the…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

We generalize the Harnack-Thom theorem to relate the ranks of the Lawson homology groups with $\Z_2$-coefficients of a real quasiprojective variety with the ranks of its reduced real Lawson homology groups. In the case of zero-cycle group,…

Let k be a natural number. We introduce k-threshold graphs. We show that there exists an O(n^3) algorithm for the recognition of k-threshold graphs for each natural number k. k-Threshold graphs are characterized by a finite collection of…

The strong law of large numbers for linear combinations of functions of order statistics ($L$-statistics) based on weakly dependent random variables is proven. We also establish the Glivenko--Cantelli theorem for $\phi$-mixing sequences of…

We propose the notion of a supercategory as an alternative approach to supermathematics. We show that this setting is rich to carry out many of the basic constructions of supermathematics. We also prove generalizations of a number of…

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…