Related papers: Fibonacci numbers and positive braids

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

We have studied several generalizations of Fibonacci sequences as the sequences with arbitrary initial values, the addition of two and more Fibonacci subsequences and Fibonacci polynomials with arbitrary bases. For Fibonacci numbers with…

Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…

This expository paper starts with a brief survey on the relation between partitions and surjections of sets, and then gives a quick introduction to the theories of incidence algebras, Segal groupoids and combinatorial species. The aim is to…

In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…

We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…

In this paper, we study the structure of braid graphs in simply-laced Coxeter systems. We prove that every reduced expression has a unique factorization as a product of so-called links, which in turn induces a decomposition of the braid…

Fibonacci anyons provide the simplest possible model of non-Abelian fusion rules: [1] x [1] = [0] + [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle…

We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…

In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…

We introduce the $k$-bonacci polyominoes, a new family of polyominoes associated with the binary words avoiding $k$ consecutive $1$'s, also called generalized $k$-bonacci words. The polyominoes are very entrancing objects, considered in…

Several articles deal with tilings with various shapes, and also a very frequent type of combinatorics is to examine the walks on graphs or on grids. We combine these two things and give the numbers of the shortest walks crossing the tiled…

This is an introductory paper about our recent merge of a noncommutative de Finetti type result with representations of the infinite braid and symmetric group which allows to derive factorization properties from symmetries. We explain some…

We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…

We consider two division problems on narrow strips of square and hexagonal lattices. In both cases we compute the bivariate enumerating sequences and the corresponding generating functions, which allowed us to determine the asymptotic…

We show several geometric and algebraic aspects of a necklace: a link composed with a core circle and a series of circles linked to this core. We first prove that the fundamental group of the configuration space of necklaces (that we will…

As a vital link between group theory and graph theory, Cayley graphs provide a geometric framework for encoding algebraic structures. This study explores the properties of Cayley graphs derived from cyclic groups whose order is the square…

We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…

We give a direct and intuitive proof (via sliding some columns up and down) of the following interesting fact: if we write out the Chebyshev polynomials in a chart and take the sums of coefficients along certain diagonals, we obtain the…

This work explores new arithmetic and combinatorial structures arising from the interplay between Farey-type graphs, Fibonacci expansions, and operadic constructions. We introduce Fibonadic numbers, defined as an inverse limit under the…