Related papers: A Generalized Digit Map: Periodicity, Prouhet-Tarr…
We consider finite sequences $s\in D^n$ where $D$ is a commutative, unital, integral domain. We prove three sets of identities (possibly with repetitions), each involving $2n$ polynomials associated to $s$. The right-hand side of these…
This paper investigates the dynamical properties of Dickson polynomials over finite fields, focusing on the periodicity and structural behavior of their iterated sequences. We introduce and analyze the sequence $[D_n(x, \alpha) \mod (x^q -…
It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…
In this paper we suggest analytical methods and associated algorithms for determining the sum of the subsets $X_m$ of the set $X_n$ (subset sum problem). Our algorithm has time complexity $T=O(C_{n}^{k})$ ($k=[m/2]$, which significantly…
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…
Consider an infinite minimal free resolution of a module $M$ over a local Noetherian ring $R$. It was shown by Eisenbud that if $R$ is a complete intersection ring, then a minimal resolution is periodic iff it is bounded. Over more general…
In this paper, two approximation algorithms are given. Let N be an odd composite number. The algorithms give new directions regarding primality test of given N. The first algorithm is given using a new method called digital coding method.…
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…
Using Traizet's regeneration method, we prove that for each positive integer n there is a family of embedded, doubly periodic minimal surfaces with parallel ends in Euclidean space of genus 2n-1 and 4 ends in the quotient by the maximal…
Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…
Let ${\rm dim}(G)$ and $D(G)$ respectively denote the metric dimension and the distinguishing number of a graph $G$. It is proved that $D(G) \le {\rm dim}(G)+1$ holds for every connected graph $G$. Among trees, exactly paths and stars…
We record various properties of twisted Becker-Gottlieb transfer maps and study their multiplicative properties analogous to Becker-Gottlieb transfer. We show these twisted transfer maps factorise through Becker-Schultz-Mann-Miller-Miller…
We define an algorithm which begins with an sequence of sequences, and produces a single sequence, with following property: If at least one of the original sequences has a tail that is periodic, then the output sequence has a periodic tail,…
We prove the periodicities of the restricted T and Y-systems associated with the quantum affine algebra of type B_r at any level. We also prove the dilogarithm identities for the Y-systems of type B_r at any level. Our proof is based on the…
The famous Prouhet-Tarry-Escott problem seeks collections of mutually disjoint sets of non-negative integers having equal sums of like powers. In this paper we present a new proof of the solution to this problem by deriving a generalization…
This paper investigates the dynamical behavior of periodic solutions for a class of second-order non-autonomous differential equations. First, based on the Lyapunov-Schmidt reduction method for finite-dimensional functions, the…
This short note deals with the so-called $ Sock \; Matching \; Problem$. We define $B_{n,k}$ as the number of all the finite sequences $a_1, \ldots, a_{2n}$ of nonnegative integers which contain at least one occurrence of $k$ $(1 \leq k…
The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…
For every nonconstant monic polynomial $g \in \mathbb{Z}[X]$, let $\mathfrak{M}(g)$ be the set of positive integers $m$ for which there exist an integer linear recurrence $(s_n)_{n \geq 0}$ having characteristic polynomial $g$ and a…
We prove that $d_k(n)=d_k(n+B)$ infinitely often for any positive integers $k$ and $B$, where $d_k(n)$ denotes the number of divisors of $n$ coprime to $k$.