Related papers: Binomial Symbols and Prime Moduli

We use a semi-numerical method to find the position and period of periodic orbits in a bisymmetrical potential, made up of a two dimensional harmonic oscillator, with an additional term of a Plummer potential, in a number of resonant cases.…

By a nondegenerate $k$-parameterized family $K$ of periodic solutions we understand the situation when the geometric multiplicity of the multiplier +1 of the linearized on $K$ system equals to $k.$ Bifurcation of asymptotically stable…

The hybrid numbers were introduced by Ozdemir [9] as a new generalization of complex, dual, and hyperbolic numbers. A hybrid number is defined by $k=a+bi+c\epsilon +dh$, where $a,b,c,d$ are real numbers and $% i,\epsilon ,h$ are operators…

We look at classes of languages associated to the fragment of first-order logic B{\Sigma}1 which disallows quantifier alternations. Each class is defined by choosing the set of predicates on positions that may be used. Two key such…

A famous theorem of Nakaoka asserts that the cohomology of the symmetric group stabilizes. The first author generalized this theorem to non-trivial coefficient systems, in the form of $\mathrm{FI}$-modules over a field, though one now…

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…

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…

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized…

Wall published a paper in 1960 on the Fibonacci sequence where he derived many results concerning the period and prime power divisibility modulo m. His periodicity results have been generalized to second order linear recurrences. Here we…

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

In this article, we combine complex-analytic and arithmetic tools to study the preperiodic points of one-dimensional complex dynamical systems. We show that for any fixed complex numbers a and b, and any integer d at least 2, the set of…

This survey article is the outgrowth of two talks given at the Journ\'ees X-UPS "P\'eriodes et transcendance" at \'Ecole polytechnique. Periods are complex numbers whose real and imaginary parts can be written as integrals of rational…

In this paper we investigate the existence and uniqueness of bounded, periodic and almost periodic solutions for second order differential equations involving reflection of the argument.The relationship between frequency modules of forced…

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…

For relatively prime natural numbers $a$ and $b$, we study the two equations $ax+by = (a-1)(b-1)/2$ and $ax+by+1= (a-1)(b-1)/2$, which arise from the study of cyclotomic polynomials. Previous work showed that exactly one equation has a…

The goal of this paper is twofold: (1) extend theory on certain statistics in the Fibonacci and Lucas sequences modulo $m$ to the Lucas sequences $U := \left(U_n(p,q)\right)_{n \geq 0}$ and $V := \left(V_n(p,q)\right)_{n \geq 0}$, and (2)…

Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.

We define the period as a multiplicative characteristic of stably symmetric monoidal $\infty$-categories, develop its basic properties, and study many examples, with a focus on `ordinary' equivariant and motivic homotopy theory. We apply…

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…

The basic tool of classical results by Malkin and Melnikov on bifurcation of periodic solutions from nondegenerate cycles of autonomous systems with periodic perturbations is an implicit function theorem. In this paper the Poincare index is…