相关论文: Tournament Sequences and Meeussen Sequences
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…
A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\meg 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. A vector homogeneous tree $\mathbf{T}$…
In this paper 101 new integer sequences, sub-sequences, and sequences of sequences, together with related unsolved problems and conjectures, are presented. Also, definitions, examples, solved or open questions, and references for each…
A strictly increasing sequence (n_k) of positive integers is said to be a Hilbertian Jamison sequence if for any bounded operator T on a separable Hilbert space such that the supremum over k of the norms ||T^{n_k}|| is finite, the set of…
As shown by Bousquet-M\'elou--Claesson--Dukes--Kitaev (2010), ascent sequences can be used to encode $({\bf2+2})$-free posets. It is known that ascent sequences are enumerated by the Fishburn numbers, which appear as the coefficients of the…
We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…
A tree $T$ is said to be homogeneous if it is uniquely rooted and there exists an integer $b\geq 2$, called the branching number of $T$, such that every $t\in T$ has exactly $b$ immediate successors. We study the behavior of measurable…
This paper explores multi-entry strategies for betting pools related to single-elimination tournaments. In such betting pools, participants select winners of games, and their respective score is a weighted sum of the number of correct…
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.
A Mendelsohn triple system of order $v$ (or MTS$(v)$) is a decomposition of the complete graph into directed 3-cyles. We denote the directed 3-cycle with edges $(x,y)$, $(y,z)$ and $(z,x)$ by $(x,y,z)$, $(y,z,x)$ or $(z,x,y)$. An…
For any integer s >= 0, we derive a combinatorial interpretation for the family of sequences generated by the recursion (parameterized by s) h_s(n) = h_s(n - s - h_s(n - 1)) + h_s(n - 2 - s - h_s(n - 3)), n > s + 3, with the initial…
We give a combinatorial interpretation in terms of bicolored ordered trees for the sequence (a_n)_{n>=1}=(1, 1, 1, 2, 3, 6, 10, 20, 36, 73,... ), A345973 in OEIS, whose generating function satisfies the defining identity Sum_{n>=1}a_n x^n =…
Ascent sequences and their modified version play a central role in the bijective framework relating several combinatorial structures counted by the Fishburn numbers. Ascent sequences are positive integer sequences defined by imposing a…
We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…
A central objective in Ramsey theory is determining whether restricted families of discrete structures necessarily contain substantially larger homogeneous substructures, compared to the unrestricted structures. In the setting of…
Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number.…
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
A tournament is called locally transitive if the outneighbourhood and the inneighbourhood of every vertex are transitive. Equivalently, a tournament is locally transitive if it avoids the tournaments $W_4$ and $L_4$, which are the only…
Given a tournament T=(V,A), a subset X of V is an interval of T provided that for any a, b\in X and x\in V-X, (a,x) \in A if and only if (b,x)\in A. For example, \emptyset, \{x\} (x\in V) and V are intervals of T, called trivial intervals.…
It is well-known that every tournament contains a Hamilton path, and every strongly connected tournament contains a Hamilton cycle. This paper establishes transversal generalizations of these classical results. For a collection…