English
Related papers

Related papers: Number systems over orders

200 papers

A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…

Dynamical Systems · Mathematics 2007-05-23 Teturo Kamae

A generalization of numeration system in which the set N of the natural numbers is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P belonging to Q[x]…

Computational Complexity · Computer Science 2007-05-23 Michel Rigo

Using Stickelberger's theorem on Gauss sums, we show that if $F$ is a planar function on a finite field $\mathbb{F}_q$, then for all non-zero functions $G : \mathbb{F}_q \to \mathbb{F}_q$, we have \begin{equation*} d_{\mathsf{alg}}(G \circ…

Combinatorics · Mathematics 2025-10-30 Christof Beierle , Tim Beyne

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…

Number Theory · Mathematics 2010-04-22 Klaus Scheicher , Paul Surer , Jörg M. Thuswaldner , Christiaan E. van de Woestijne

We propose an equivalent formula for the higher-order derivatives used in the study of Generalized Almost Perfect Nonlinear functions over an arbitrary finite field of characteristic $p$. The result is obtained by counting the number of…

Number Theory · Mathematics 2025-07-11 Valentin Suder

Let $G$ be a simple graph with vertex set $V$ and edge set $E$, and let $S \subseteq V$. The \emph{open neighborhood} of $v \in V$, $N(v)$, is the set of vertices adjacent to $v$; the \emph{closed neighborhood} is given by $N[v] = N(v) \cup…

Combinatorics · Mathematics 2019-09-06 Abraham Glasser , Bonnie Jacob , Emily Lederman , Stanisław Radziszowski

Let $G=(V,E)$ be a simple graph. A dominating set of $G$ is a subset $S\subseteq V$ such that every vertex not in $S$ is adjacent to at least one vertex in $S$. The cardinality of a smallest dominating set of $G$, denoted by $\gamma(G)$, is…

Combinatorics · Mathematics 2022-11-15 Saieed Akbari , Nima Ghanbari , Michael A. Henning

Denote the set of algebraic numbers as $\overline{\mathbb{Q}}$ and the set of algebraic integers as $\overline{\mathbb{Z}}$. For $\gamma\in\overline{\mathbb{Q}}$, consider its irreducible polynomial in $\mathbb{Z}[x]$,…

Number Theory · Mathematics 2022-12-16 Deepesh Singhal , Yuxin Lin

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Group Theory · Mathematics 2022-02-11 Dominik Bernhardt , Tim Boykett , Alice Devillers , Johannes Flake , S. P. Glasby

Let $G$ be a finite group and $K$ a number field. We construct a $G$-extension $E/F$, with $F$ of transcendence degree $2$ over $K$, that specializes to all $G$-extensions of $K_\mathfrak{p}$, where $\mathfrak{p}$ runs over all but finitely…

Number Theory · Mathematics 2021-12-30 Joachim König , Danny Neftin

Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some real…

Computational Complexity · Computer Science 2017-02-03 Davood Bakhshesh , Mohammad Farshi , Mahdieh Hasheminezhad

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

Combinatorics · Mathematics 2019-06-04 Benjamin M. Case , Todd Fenstermacher , Soumendra Ganguly , Renu C. Laskar

We provide both a general framework for discretizing de Rham sequences of differential forms of high regularity, and some examples of finite element spaces that fit in the framework. The general framework is an extension of the previously…

Numerical Analysis · Mathematics 2018-01-24 Snorre Harald Christiansen , Kaibo Hu

Positional numeration systems are a large family of numeration systems used to represent natural numbers. Whether the set of all representations forms a regular language or not is one of the most important questions that can be asked of…

Number Theory · Mathematics 2025-12-16 Émilie Charlier , Savinien Kreczman

We prove that the genus of a finite-dimensional division algebra is finite whenever the center is a finitely generated field of any characteristic. We also discuss potential applications of our method to other problems, including the…

Rings and Algebras · Mathematics 2019-02-05 Vladimir I. Chernousov , Andrei S. Rapinchuk , Igor A. Rapinchuk

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

Group Theory · Mathematics 2007-05-23 Kai-Uwe Bux , Kevin Wortman

The prime graph of a finite group $G$, which is denoted by ${\rm GK}(G)$, is a simple graph whose vertex set is comprised of the prime divisors of $|G|$ and two distinct prime divisors $p$ and $q$ are joined by an edge if and only if there…

Group Theory · Mathematics 2015-02-19 B Akbari , A. R. Moghaddamfar

Let $G$ be a simple and finite graph without isolated vertices. In this paper we introduce and study a new degree sequence derived invariant called the \emph{sub-total domination number}, denoted $\sub_t(G)$. In particular, we show that…

Combinatorics · Mathematics 2017-01-30 Randy Davila

For any prime p we consider the density of elements in the multiplicative group of the finite field F_p having order, respectively index, congruent to a(mod d). We compute these densities on average, where the average is taken over all…

Number Theory · Mathematics 2007-05-23 Pieter Moree

Let F be a nonarchimedean locally compact field with residue characteristic p and G(F) the group of F-rational points of a connected reductive group. Following Schneider and Stuhler, one can realize, in a functorial way, any smooth complex…

Representation Theory · Mathematics 2014-08-19 Rachel Ollivier