Related papers: On the fibbinary numbers and the Wythoffarray
Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…
Let $c$ be the family of irreducible representations of a Weyl group $W$ corresponding to a two-sided cell of $W$. We define a subset $A_c$ of $c$ which contains the special representation of $W$ in $c$ and is in canonical bijection with…
A fractal is in essence a hierarchy with cascade structure, which can be described with a set of exponential functions. From these exponential functions, a set of power laws indicative of scaling can be derived. Hierarchy structure and…
A $B$-tree is a type of search tree where every node (except possibly for the root) contains between $m$ and $2m$ keys for some positive integer $m$, and all leaves have the same distance to the root. We study sequences of $B$-trees that…
The main result of the paper is a description of conormal Lie algebras of Feigin-Odesskii Poisson structures. In order to obtain it we introduce a new variant of a definition of a Feigin-Odesskii Poisson structure: we define it using a…
We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.
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…
We explore new connections between complete non-ambiguous trees (CNATs) and permutations. We give a bijection between tree-like tableaux and a specific subset of CNATs. This map is used to establish and solve a recurrence relation for the…
Every lattice is isomorphic to a lattice whose elements are sets of sets, and whose operations are intersection and an operation extending the union of two sets of sets A and B by the set of all sets in which the intersection of an element…
By exploiting suitably constrained Zorn matrices, we present a new construction of the algebra of sextonions (over the algebraically closed field $\mathbb{C}$). This allows for an explicit construction, in terms of Jordan pairs, of the…
The action of a finite reflection group (type A) on its set of roots is understood as a permutation representation or group action. We show that this representation is an induced representation from a certain kind of parabolic subgroup.…
A direct application of Zorn's Lemma gives that every Lipschitz map $f:X\subset \mathbb{Q}_p^n\to \mathbb{Q}_p^\ell$ has an extension to a Lipschitz map $\widetilde f: \mathbb{Q}_p^n\to \mathbb{Q}_p^\ell$. This is analogous, but more easy,…
In this paper, bicomplex k-Fibonacci quaternions are defined. Also, some algebraic properties of bicomplex k-Fibonacci quaternions which are connected with bicomplex numbers and k-Fibonacci numbers are investigated. Furthermore, the…
In this paper we present a family of identities for recursive sequences arising from a second order recurrence relation, that gives instances of Zeckendorf representation. We prove these results using a special case of an universal property…
In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
Motivated by permutation statistics, we define for any complex reflection group W a family of bivariate generating functions. They are defined either in terms of Hilbert series for W-invariant polynomials when W acts diagonally on two sets…
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…
The concept of derivative coordinate functions proved useful in the formulation of analytic fractal functions to represent smooth symmetric binary fractal trees [1]. In this paper we introduce a new geometry that defines the fractal space…
A fundamental identity in the representation theory of the partition algebra is $n^k = \sum_{\lambda} f^\lambda m_k^\lambda$ for $n \geq 2k$, where $\lambda$ ranges over integer partitions of $n$, $f^\lambda$ is the number of standard Young…