相关论文: A Combinatorial interpretation of Hofstadter's G-s…
We define geodesic normal forms for the general series of complex reflection groups G(de,e,n). This requires the elaboration of a combinatorial technique in order to determine minimal word representatives and to compute the length of the…
Using the lattice paths in $\mathbb{N}\times\mathbb{N}$, we derive a general formula for sequences $\big(T(n,k)\big)$ satisfying the recurrence relation of the form: \begin{equation*} T((n,k)=a_{n,k}T(n-1,k)+b_{n,k}T(n-1,k-1).…
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
There are two possible computational interpretations of second-order arithmetic: Girard's system F or Spector's bar recursion and its variants. While the logic is the same, the programs obtained from these two interpretations have a…
We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…
We give examples of pairs (G1,G2) where G1 is a Grothendieck category and G2 a full Grothendieck subcategory of G1, the inclusion G2 --> G1 being denoted i, for which R^+i : D^+G2 --> D^+G1 (or even Ri : DG2 --> DG1) is a full embedding.…
By rewriting the famous hook-content formula it easily follows that there are $\prod\limits_{1 \le i < j \le n} \frac{k_j - k_i + j -i}{j-i}$ semistandard tableaux of shape $(k_n,k_{n-1},...,k_1)$ with entries in $\{1,2,...,n\}$ or,…
Fibonacci sequence, generated by summing the preceding two terms, is a classical sequence renowned for its elegant properties. In this paper, leveraging properties of generalized Fibonacci sequences and formulas for consecutive sums of…
We prove that E_n-homology of non-unital commutative algebras can be described as functor homology when one considers functors from a certain category of planar trees with n levels. For different n these homology theories are connected by…
One of the central open problems in both algebraic combinatorics and representation theory is to find a positive combinatorial rule for Kronecker coefficients $ g_{\lambda \, \mu \, \nu}$. A notable advance in this direction is due to…
Assume that for some $\alpha<1$ and for all nutural $n$ a set $F_n$ of at most $2^{\alpha n}$ "forbidden" binary strings of length $n$ is fixed. Then there exists an infinite binary sequence $\omega$ that does not have (long) forbidden…
We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo. We provide an alternative description in terms of a certain class of trees,…
Roughly ten years ago, the following "Gorenstein Interval Conjecture" (GIC) was proposed: Whenever $(1,h_1,\dots,h_i,\dots,h_{e-i},\dots,h_{e-1},1)$ and $(1,h_1,\dots,h_i+\alpha,\dots,h_{e-i}+\alpha,\dots,h_{e-1},1)$ are both Gorenstein…
In this article, we present a short, non-exhaustive study of an important and well-known property of combinatorial sequences - unimodality. We shall have a look at a sample of classical results on unimodality and related properties, and…
Furstenberg has associated to every topological group $G$ a universal boundary $\partial(G)$. If we consider in addition a subgroup $H<G$, the relative notion of $(G,H)$-boundaries admits again a maximal object $\partial(G,H)$. In the case…
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,...,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In 2005, Noe and Post conjectured…
The study describes a class of integer labelings of the Fibonacci tree, the tree of descent introduced by Fibonacci. In these labelings, Fibonacci sequences appear along ascending branches of the tree, and it is shown that the labels at any…
In recent work of Wildberger and Rubine, it is shown that the formal power series $\mathbf{S}$ in the variables $t_1,t_2,\dots$ satisfying $\mathbf{S}=1+\sum_{n\geq 1} t_n\mathbf{S}^n$ has a factorisation…
Following the ideas of Bossinger and Fang, Fourier, and Littelman, we study iterated sequences for the Grassmannian $\operatorname{Gr} (3, n)$ as a special class of birational sequences. For each iterated sequence $S$, there is a weighting…
We discuss an equivalence relation on the set of square binary matrices with the same number of 1's in each row and each column. Each binary matrix is represented using ordered n-tuples of natural numbers. We give a few starting values of…