Searcharxiv⌕ Search

arXiv subjects

Christiaan E. van de Woestijne

Publications and source records attributed to Christiaan E. van de Woestijne.

4 recordsLinked to original sources

The Cartesian product of graphs with loops

We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in O(m) time, where m is the number of edges of the given graph.

math.CO↗

Number systems and the Chinese Remainder Theorem

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite expansions for all residue classes modulo $f(x)$, using a suitably chosen digit set. We give precise conditions under which direct or fibred products of two such polynomial number systems are again of the same form. The main tool is a general form of the Chinese Remainder Theorem. We give applications to simultaneous number systems in the integers.

math.NT↗

Factors of disconnected graphs and polynomials with nonnegative integer coefficients

We investigate the uniqueness of factorisation of possibly disconnected finite graphs with respect to the Cartesian, the strong and the direct product. It is proved that if a graph has $n$ connected components, where $n$ is prime, or $n=1,4,8,9$, and satisfies some additional conditions, it factors uniquely under the given products. If, on the contrary, $n=6$ or 10, all cases of nonunique factorisation are described precisely.

math.CO↗

Digit systems over commutative rings

Let $\E$ be a commutative ring with identity and $P\in\E[x]$ be a polynomial. In the present paper we consider digit representations in the residue class ring $\E[x]/(P)$. In particular, we are interested in the question whether each $A\in\E[x]/(P)$ can be represented modulo $P$ in the form $e_0+e_1 X + \cdots + e_h X^h$, where the $e_i\in\E[x]/(P)$ are taken from a fixed finite set of digits. This general concept generalises both canonical number systems and digit systems over finite fields. Due to the fact that we do not assume that $0$ is an element of the digit set and that $P$ need not be monic, several new phenomena occur in this context.

math.NT↗