Related papers: Fibonacci Designs
We study the structure of inverse limit space of so-called Fibonacci-like tent maps. The combinatorial constraints implied by the Fibonacci-like assumption allow us to introduce certain chains that enable a more detailed analysis of…
Among the classical models for interconnection networks are hypercubes and Fibonacci cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the vertex set to those binary strings which do not contain consecutive…
We introduce a natural generalization of Maya diagrams -- the space of infinite Fibonacci configurations, which are specified functions on $\mathbb{Z}$ with values $1$ and $0$. Infinite Fibonacci configurations are particularly interesting…
The aim of this note is to provide a conceptually simple demonstration of the fact that repetitive model sets are characterized as the repetitive Meyer sets with an almost automorphic associated dynamical system.
In this paper we study convex subcomplexes of spherical buildings. We pay special attention to fixed point sets of type-preserving isometries of spherical buildings. This sets are also convex subcomplexes of the natural polyhedral structure…
Let X be a k-dimensional simplicial complex such that the (k-j-2)-dimensional homology of the links of all j-dimensional simplices in X vanishes. An upper bound is given on the (k-1)-th Betti number of X. Examples based on sum complexes…
Recently, chains of increasing symmetric ideals have attracted considerable attention. In this note, we summarize some results and open problems concerning the asymptotic behavior of several algebraic and homological invariants along such…
We show that the system of vacuum Einstein equations (i.e., Ricci-flat metrics) with two hypersurface-orthogonal, commuting Killing vector fields in $d \ge 5$ dimensions is invariant under the action of a one-parameter Lie group, and the…
A semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities having real coefficients and is a union of finitely many maximally connected components. We consider the problem of deciding whether two…
Iterative methods play an important role in science and engineering applications, with uses ranging from linear system solvers in finite element methods to optimization solvers in model predictive control. Recently, a new computational…
There are many examples for point sets in finite geometry, which behave "almost regularly" in some (well-defined) sense, for instance they have "almost regular" line-intersection numbers. In this paper we investigate point sets of a…
The spectrum of possible parameters of symmetric configurations is investigated. We both survey known constructions and results, and propose some new construction methods. Many new parameters are obtained, in particular for cyclic symmetric…
We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…
The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…
This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…
In this paper we study a new metric for comparing Betti numbers functions in bidimensional persistent homology, based on coherent matchings, i.e. families of matchings that vary in a continuous way. We prove some new results about this…
We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square $\{\pm 1\}$-matrices of size congruent to $2$ modulo $4$. Quasi-orthogonal cocycles are analogous to the orthogonal…
Linear matrix Inequalities (LMIs) have had a major impact on control but formulating a problem as an LMI is an art. Recently there is the beginnings of a theory of which problems are in fact expressible as LMIs. For optimization purposes it…
Given a non-negative, decreasing sequence $a$ with sum $1$, we consider all the closed subsets of $[0,1]$ such that the lengths of their complementary open intervals are given by the terms of $a$, the so-called complementary sets. In this…
A repdigit is a positive integer that has only one distinct digit in its decimal expansion, i.e., a number has the form $d(10^m-1)/9$ for some $m\geq 1$ and $1 \leq d \leq 9$. Let $\left(T_n\right)_{n\ge0}$ be the sequence of Tribonacci.…