English
Related papers

Related papers: Properties of Multidimensional Vector Zeckendorf R…

200 papers

It is well known that every positive integer N can be written as the sum of non-consecutive powers of the golden ratio. We prove that the non-positive powers, together with the parity of the first positive power, can determine the positive…

Number Theory · Mathematics 2023-08-15 Edward Zhu

Positive maps which are not completely positive are used in quantum information theory as witnesses for convex sets of states, in particular as entanglement witnesses and more generally as witnesses for states having Schmidt number not…

Quantum Physics · Physics 2007-12-17 Kedar S. Ranade , Mazhar Ali

For every multivariable polynomial $p$, with $p(0)=1$, we construct a determinantal representation $$p=\det (I - K Z),$$ where $Z$ is a diagonal matrix with coordinate variables on the diagonal and $K$ is a complex square matrix. Such a…

Functional Analysis · Mathematics 2012-08-14 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Hugo J. Woerdeman

Let $0<k\in\mathbb{Z}$. We zipper-merge integer compositions with sums $k$ and $k+1$, equal number of parts and initial entries equal at least to 1 and 2, respectively. This yields bitstrings with two initial zeros, $k-1$ remaining zeros…

Combinatorics · Mathematics 2022-04-05 Italo J. Dejter

Let $k\ge 2$ be an integer and let $A$ be a set of nonnegative integers. For a $k$-tuple of positive integers $\underline{\lambda} = (\lambda_{1}, \dots{} ,\lambda_{k})$ with $1 \le \lambda_{1} < \lambda_{2} < \dots{} < \lambda_{k}$, we…

Number Theory · Mathematics 2023-03-20 Sándor Z. Kiss , Csaba Sándor

We study Schmidt rank for a vector (i.e., a pure state) and Schmidt number for a mixed state which are entanglement measures. We show that if a subspace of a certain bipartite system contains no vector of Schmidt rank $\leqslant k$, then…

Quantum Physics · Physics 2018-04-13 Priyabrata Bag , Santanu Dey

The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…

Combinatorics · Mathematics 2026-02-25 S. R. Mane

Let $\Lambda \subset \mathbb R^n$ be an algebraic lattice, coming from a projective module over the ring of integers of a number field $K$. Let $\mathcal Z \subset \mathbb R^n$ be the zero locus of a finite collection of polynomials such…

Number Theory · Mathematics 2018-02-01 Lenny Fukshansky , Nikolay Moshchevitin

Motivated by Erd\H{o}s' ternary conjecture and by recent work of Cui--Ma--Jiang [``Geometric progressions meet Cantor sets'', \textit{Chaos Solitons Fractals} \textbf{163} (2022), 112567.] on intersections between geometric progressions and…

Number Theory · Mathematics 2025-12-23 Diego Marques , Pavel Trojovsky

A $k$-attractor is a combinatorial object unifying dictionary-based compression. It allows to compare the repetitiveness measures of different dictionary compressors such as Lempel-Ziv 77, the Burrows-Wheeler transform, straight line…

Computational Complexity · Computer Science 2024-02-08 Janosch Fuchs , Philip Whittington

In this paper we classify the Zeckendorf expansions according to their digit blocks. It turns out that if we consider these digit blocks as labels on the Fibonacci tree, then the numbers ending with a given digit block in their Zeckendorf…

Combinatorics · Mathematics 2020-06-15 Michel Dekking

We prove an upper bound for the number of representations of a positive integer $N$ as the sum of four $k$-th powers of integers of size at most $B$, using a new version of the Determinant method developed by Heath-Brown, along with recent…

Number Theory · Mathematics 2010-12-23 Oscar Marmon

We consider subsets of the (symbolic) sequence space that are invariant under the action of the semigroup of multiplicative integers. A representative example is the collection of all 0-1 sequences $(x_k)$ such that $x_k x_{2k}=0$ for all…

Dynamical Systems · Mathematics 2018-02-08 Richard Kenyon , Yuval Peres , Boris Solomyak

Zeckendorf proved that every integer can be written uniquely as a sum of non-adjacent Fibonacci numbers $\{1,2,3,5,\dots\}$. This has been extended to many other recurrence relations $\{G_n\}$ (with their own notion of a legal…

Number Theory · Mathematics 2016-07-29 Ray Li , Steven J. Miller

A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$. Lekkerkerker proved that the average number of summands for integers in $[F_n,…

Number Theory · Mathematics 2011-10-27 Steven J. Miller , Yinghui Wang

A finite subset of the natural numbers is weak-Schreier if $\min S \ge |S|$, strong-Schreier if $\min S>|S|$, and maximal if $\min S = |S|$. Let $M_n$ be the number of weak-Schreier sets with $n$ being the largest element and $(F_n)_{n\geq…

Number Theory · Mathematics 2020-11-30 Hung Viet Chu

Let $\mathcal{K}_n$ be the so-called wild Kronecker quiver, i.e., a quiver with one source and one sink and $n\geq 3$ arrows from the source to the sink. The following problems will be studied for an arbitrary regular component…

Representation Theory · Mathematics 2012-09-05 Bo Chen

To represent real $m$-dimensional vectors, a positional vector system given by a non-singular matrix $M \in \mathbb{Z}^{m \times m}$ and a digit set $\mathcal{D} \subset \mathbb{Z}^m$ is used. If $m = 1$, the system coincides with the well…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-03-20 Izabella Ingrid Farkas , Edita Pelantová , Milena Svobodová

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

Algebraic Geometry · Mathematics 2010-01-06 Kiumars Kaveh , A. G. Khovanskii

We study $B(n;k)$, the number of ways of writing $n$ as a sum or difference of the first $k$ Fibonacci numbers. We show that $B(0;k)$ satisfies the Tribonacci-like recurrence $B(0;k+1)=B(0;k)+B(0;k-1)+B(0;k-2)$ and that $B(n;k)$ satisfies a…

Number Theory · Mathematics 2026-04-20 Katie Anders , Madeline L. Dawsey , Joseph Vandehey