Related papers: A poset structure on quasifibonacci partitions
We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…
In generalization of the classical Atiyah-Bott Poisson brackets on the moduli spaces of surfaces we define quasi-Poisson brackets on the moduli spaces of quasi-surfaces.
We investigate the topological properties of Fibonacci quasicrystals using cavity polaritons. Composite structures made of the concatenation of two Fibonacci sequences allow investigating generalized edge states forming in the gaps of the…
The article is devoted to a structure of topological spaces related with topological quasigroups. Regular and complete spaces over topological quasigroups are studied. Separations and embeddings are also investigated for them. Their…
In a recent paper, Goyt and Sagan studied distributions of certain set partition statistics over pattern restricted sets of set partitions that were counted by the Fibonacci numbers. Their study produced a class of $q$-Fibonacci numbers,…
A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…
The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…
We construct an easily described family of partitions of the positive integers into $n$ disjoint sets with essentially the same structure for every $n \geq 2$. In a special case, it interpolates between the Beatty $\frac{1}{\phi} +…
Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…
Positive semidefinite matrices partitioned into a small number of Hermitian blocks have a remarkable property. Such a matrix may be written in a simple way from the sum of its diagonal blocks
The structure of certain types of quasi shift-invariant spaces, which take the form $V(\psi,\mathcal{X}):=\overline{\text{span}}^{L_2}\{\psi(\cdot-x_j):j\in\mathbb{Z}\}$ for a discrete set $\mathcal{X}=(x_j)\subset\mathbb{R}$ is…
The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…
Numerical semigroups are cofinite additive submonoids of the natural numbers. In 2011, Keith and Nath illustrated an injection from numerical semigroups to integer partitions. We explore this connection between partitions and numerical…
We construct and classify all Poisson structures on quasimodular forms that extend the one coming from the first Rankin-Cohen bracket on the modular forms. We use them to build formal deformations on the algebra of quasimodular forms.
The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…
We introduce a partial order structure on the set of interval orders of a given size, and prove that such a structure is in fact a lattice. We also provide a way to compute meet and join inside this lattice. Finally, we show that, if we…
We derive a general recurrence relation for squares of Fibonacci-like numbers. Various properties are developed, including double binomial summation identites.
The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…
This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…
We study various properties of quasimodular forms by using their connections with Jacobi-like forms and pseudodifferential operators. Such connections are made by identifying quasimodular forms for a discrete subgroup $\G$ of $SL(2, \bR)$…