相关论文: A Combinatorial interpretation of Hofstadter's G-s…

The Hofstadter Q-sequence is a prominent example of nested recurrence. Despite decades of study, it is not even known whether Q(n) is defined for all n. Mantovanelli introduced a parity-perturbed variant $\widetilde{Q}$, obtained by adding…

Combinatorial interpretation of the fibonomial coefficients as a number of choices of specific finite subsets of an infinite partially ordered set of not binomial type is proposed. This partially ordered set is here defined via…

By considering the tiling of an $N$-board (a linear array of $N$ square cells of unit width) with new types of tile that we refer to as combs, we give a combinatorial interpretation of the product of two consecutive generalized Fibonacci…

We present a general abstract framework for combinatorial Dyson-Schwinger equations, in which combinatorial identities are lifted to explicit bijections of sets, and more generally equivalences of groupoids. Key features of combinatorial…

We investigate the conditions on an integer sequence f(n), n 2 N, with f(1) = 0, such that the sequence q(n), computed recursively via q(n) = q(n - q(n - 1)) + f(n), with q(1) = 1, exists. We prove that f(n + 1) - f(n) in {0,1}, n > 0, is a…

Furstenberg and Glasner proved that for an arbitrary k in N, any piecewise syndetic set contains k term arithmetic progression and such collection is also piecewise syndetic in Z. They used algebraic structure of beta N. The above result…

If G is a GGS-group defined over a p-adic tree, where p is an odd prime, we calculate the order of the congruence quotients $G_n=G/\Stab_G(n)$ for every n. If G is defined by the vector $e=(e_1,...,e_{p-1})\in\F_p^{p-1}$, the determination…

For $G$ a finite abelian group, we study the properties of general equivalence relations on $G_n=G^n\rtimes \SG_n$, the wreath product of $G$ with the symmetric group $\SG_n$, also known as the $G$-coloured symmetric group. We show that…

A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…

Given a sequence ${\bf g}: g_0,\ldots, g_{m}$, in a finite group $G$ with $g_0=1_G$, let ${\bf \bar g}: \bar g_0,\ldots, \bar g_{m}$, be the sequence defined by $\bar g_0=1_G$ and $\bar g_i=g_{i-1}^{-1}g_i$ for $1\leq i \leq m$. We say that…

The Fibonacci sequence is a sequence of numbers that has been studied for hundreds of years. In this paper, we introduce the new sequence S_{k,n} with initial conditions S_{k,0} = 2b and S_{k,1} = bk + a, which is generated by the…

The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…

We consider functions of natural numbers which allow a combinatorial interpretation as density functions (speed) of classes of relational structures, s uch as Fibonacci numbers, Bell numbers, Catalan numbers and the like. Many of these…

The famous series of Fibonacci numbers is defined by a recursive equation saying that each number is the sum of its two predecessors, with the initial condition that the first two numbers are equal to unity. Here, we show that the numbers…

The Fibonacci numbers satisfy the famous recurrence $F_n = F_{n - 1} + F_{n - 2}$. The theory of C-finite sequences ensures that the Fibonacci numbers whose indices are divisible by $m$, namely $F_{mn}$, satisfy a similar recurrence for…

Given a category C of a combinatorial nature, we study the following fundamental question: how does the combinatorial behavior of C affect the algebraic behavior of representations of C? We prove two general results. The first gives a…

The following thesis contains results on the combinatorial representation theory of the finite Hecke algebra $H_n(q)$. In Chapter 2 simple combinatorial descriptions are given which determine when a Specht module corresponding to a…

A simple graph $G=(V,E)$ admits an $H$-covering if every edge in $E$ is contained in a subgraph $H'=(V',E')$ of $G$ which is isomorphic to $H$. In this case we say that $G$ is $H$-supermagic if there is a bijection $f:V\cup…

We consider a finite abelian group $M$ of odd exponent $n$ with a symplectic form $\omega: M\times M\to \mu_n$ and the Heisenberg extension $1\to \mu_n\to H\to M\to 1$ with the commutator $\omega$. According to the Stone - von Neumann…

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…