Related papers: Sequences defined by h-vectors
A Heffter array $H(n;k)$ is an $n\times n$ matrix such that each row and column contains $k$ filled cells, each row and column sum is divisible by $2nk+1$ and either $x$ or $-x$ appears in the array for each integer $1\leq x\leq nk$.…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
Let $D^+$ be the first octant of the Euclidean space and consider the integral cube grid $G$ in $D^+$. The intersections of each line with $G$ form an infinite sequence of three letters which can be considered as an extension of well-known…
For a finite set $A \subseteq \mathbb{R}^n$, consider a function $u \in \mathrm{BV}_{\mathrm{loc}}^2(\mathbb{R}^n)$ such that $\nabla u \in A$ almost everywhere. If $A$ is convex independent, then it follows that $u$ is piecewise affine…
Number sequences defined by a linear recursion relation are studied by means of generating functions. Indices of the terms in the recursion relation have arbitrary differenses. In addition to formulas for the nth term an algorithm is…
We study elements of second order linear recurrence sequences $(G_n)_{n= 0}^{\infty}$ of polynomials in $\mathbb{C}[x]$ which are decomposable, i.e. representable as $G_n=g\circ h$ for some $g, h\in \mathbb{C}[x]$ satisfying…
Classical homological algebra considers chain complexes, resolutions, and derived functors in additive categories. We describe "track algebras in dimension n", which generalize additive categories, and we define higher order chain…
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…
In the present paper, we are interested in classifying of Collatz sequences on based to the different behavior of these sequences when their lengths tend to infinity. A Collatz infinite sequence can be defined as an infinite ordered set of…
The n-th derivative of a tensor valued function of a tensor is defined by a finite number of coefficients each with closed form expression.
The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…
A \Def{composition} of a positive integer $n$ is a $k$-tuple $(\l_1, \l_2, \dots, \l_k) \in \Z_{> 0}^k$ such that $n = \l_1 + \l_2 + \dots + \l_k$. Our goal is to enumerate those compositions whose parts $\l_1, \l_2, \dots, \l_k$ avoid a…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
Determinants and symmetric functions of the eigenvalues of matrices characterizing stochastic processes with indepedent increments. Relationships with Fibonacci numbers are derived.
Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all…
We study the extended Frobenius problem for sequences of the form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is the Fibonacci sequence and $f_a$ is a Fibonacci number. As a consequence, we show that the family of…
In this note we supply an elementary proof of the following well-known theorem of R. Stanley: the $h$-vectors of Gorenstein algebras of codimension 3 are SI-sequences, i.e. are symmetric and the first difference of their first half is an…
The NP-hard Distinct Vectors problem asks to delete as many columns as possible from a matrix such that all rows in the resulting matrix are still pairwise distinct. Our main result is that, for binary matrices, there is a complexity…
We have constructed a Heisenberg-type algebra generated by the Hamiltonian, the step operators and an auxiliar operator. This algebra describes quantum systems having eigenvalues of the Hamiltonian depending on the eigenvalues of the two…
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…