相关论文: Residues modulo powers of two in the Young-Fibonac…

In this paper we investigate the geometry of a discrete Bayesian network whose graph is a tree all of whose variables are binary and the only observed variables are those labeling its leaves. We provide the full geometric description of…

In this paper we elaborate on the structure of the semigroup tree and the regularities on the number of descendants of each node observed earlier. These regularites admit two different types of behavior and in this work we investigate which…

In this paper, we connect two well established theories, the Fibonacci numbers and the Jordan algebras. We give a series of matrices, from literature, used to obtain recurrence relations of second-order and polynomial sequences. We also…

A residuated poset is a structure $\langle A,\le,\cdot,\backslash,/,1 \rangle$ where $\langle A,\le \rangle$ is a poset and $\langle A,\cdot,1 \rangle$ is a monoid such that the residuation law $x\cdot y\le z\iff x\le z/y\iff y\le…

We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…

We prime-encode the natural numbers via recursive factorisation, iterated to the exponents, generating a corpus of planar rooted trees equivalently represented as Dyck words. This forms a deterministic text endowed with internal rules.…

The odd reflections are an effective tool in the Lie superalgebra representation theory, as they relate non-conjugate Borel subalgebras. We introduce analogues of the odd reflections for the Yangian ${\rm Y}({\frak gl}_{m|n})$ and use them…

We describe bialgebras of lower-indexed algebraic Steenrod operations over the field with p elements, p an odd prime. These go beyond the operations that can act nontrivially in topology, and their duals are closely related to algebras of…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

In this paper, we consider several combinatorial problems whose enumeration leads to the odd-indexed Fibonacci numbers, including certain types of Dyck paths, block fountains, directed column-convex polyominoes, and set partitions with no…

The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…

For a graph G, let f_{ij} be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the f_{ij}'s can be expressed as the products of Fibonacci numbers; for a cycle,…

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…

Tree-child networks are an important class of phylogenetic network used to model reticulate evolutionary processes. These networks have attracted increasing attention from researchers with interests in both combinatorics and algorithms. A…

We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

We consider families of exponential sums indexed by a subgroup of invertible classes modulo some prime power $q$. For fixed $d$, we restrict to moduli $q$ so that there is a unique subgroup of invertible classes modulo $q$ of order $d$. We…

A graph $G$ is {\it weakly semiregular} if there are two numbers $a,b$, such that the degree of every vertex is $a$ or $b$. The {\it weakly semiregular number} of a graph $G$, denoted by $wr(G)$, is the minimum number of subsets into which…

The distribution of values of the full ranks of marked Durfee symbols is examined in prime and nonprime arithmetic progressions. The relative populations of different residues for the same modulus are determined: the primary result is that…