Related papers: Enumerating orders in number fields

This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…

Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…

We obtain an exact formula for the average order of elements of a wreath product of two finite groups. Then focussing our attention on $p$-groups for primes $p$, we give an estimate for the average order of a wreath product $A\wr B$ in…

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases,…

Pairwise ordered tree alignment are combinatorial objects that appear in RNA secondary structure comparison. However, the usual representation of tree alignments as supertrees is ambiguous, i.e. two distinct supertrees may induce identical…

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…

This paper investigates some properties of the number of subtrees of a tree with given degree sequence. These results are used to characterize trees with the given degree sequence that have the largest number of subtrees, which generalizes…

In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…

We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…

We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in…

One defines a new tree-indexed series, with coefficients that are polynomials in x over the ring Q(q). Several special evaluations of this series are obtained, in particular when x is replaced by a q-integer. By taking a limit value when x…

In Tensor Field Theory (TFT), observables are defined through tensor field contractions that produce unitary invariants for complex-valued tensor fields. Traditionally, these observables are constructed using tensor fields of a fixed order…

We study order units in the real group ring and the augmentation ideal, as well as in matrix algebras. We identify an infinite family of order units in the powers of the augmentation ideal, that includes the Laplacian, and show that these…

The notion of transducer integer sequences is considered through a series of examples. By definition, transducer integer sequences are integer sequences produced, under a suitable interpretation, by finite automata encoding tree morphisms…

We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…