English
Related papers

Related papers: Modular binomials with an application to periodic …

200 papers

In this paper we obtain some sophisticated combinatorial congruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the periodicity of the sequence…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

Number Theory · Mathematics 2016-12-30 Tommy Hofmann , Claus Fieker

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

Number Theory · Mathematics 2016-02-09 Tim Beyne , Gerold Brändli

In this paper we use the framework of automatic sequences to study combinatorial sequences modulo prime powers. Given a sequence whose generating function is the diagonal of a rational power series, we provide a method, based on work of…

Number Theory · Mathematics 2016-04-12 Eric Rowland , Reem Yassawi

We develop an approach to establish $1/\pi$-series from bimodular forms. Utilizing this approach, we obtain new families of $2$-variable $1/\pi$-series associated to Zagier's sporadic Apery-like sequences.

Number Theory · Mathematics 2020-05-19 Liuquan Wang , Yifan Yang

We give a short appreciation of Mumford's work on the moduli of varieties by putting it into historical context. By reviewing earlier works we highlight the innovations introduced by Mumford. Then we discuss recent developments whose…

Algebraic Geometry · Mathematics 2018-10-01 János Kollár

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…

Combinatorics · Mathematics 2015-10-01 Soumyabrata Pal , Shankar M. Venkatesan

We study structures of derivation modules of Coxeter multiarrangements with quasi-constant multiplicities by using the primitive derivation. As an application, we show that the characteristic polynomial of a Coxeter multiarrangement with…

Combinatorics · Mathematics 2007-08-24 Takuro Abe , Masahiko Yoshinaga

We study the behaviour of ordinary parts of the homology modules of modular curves, associated to a decreasing sequence of congruence subgroups ${\Gamma}_1(N2^r)$ for $r \geq 2$, and prove a control theorem for these homology modules.

Number Theory · Mathematics 2015-04-06 Narasimha Kumar

We study the average distribution of primes of size $x$ in arithmetic progressions to moduli larger than $x^{\frac{1}{2}}$. Using arithmetic information from the works of many authors together with different variants of the original…

Number Theory · Mathematics 2026-05-28 Runbo Li

Let $p$ be a prime and let $\pi^n(X;\mathbb{Z}/p^r)=[X,M_n(\mathbb{Z}/p^r)]$ be the set of homotopy classes of based maps from CW-complexes $X$ into the mod $p^r$ Moore spaces $M_n(\mathbb{Z}/p^r)$ of degree $n$, where $\mathbb{Z}/p^r$…

Algebraic Topology · Mathematics 2022-07-22 Pengcheng Li , Jianzhong Pan , Jie Wu

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…

Number Theory · Mathematics 2024-06-11 Mihai Prunescu

We prove that a certain family of sums of products of three binomials has alternating behavior modulo a prime $p$. To accomplish this we rewrite these sums as signed sums of products of three binomials, the better to handle $p$, and we give…

Combinatorics · Mathematics 2022-03-03 Michael J. J. Barry

We try to improve a problem asked in an Indian Math Olympiad. We give a brief overview of the work done in Saikia and Vogrinc (2011) and Saikia and Vogrinc where the authors have found a periodic sequence and the length of its period, all…

Number Theory · Mathematics 2012-09-20 Manjil P. Saikia , Jure Vogrinc

In this paper we present a mathematical way of defining musical modes, we derive a formula for the total number of modes and define the musicality of a mode as the total number of harmonic chords whithin the mode. We also give an algorithm…

Combinatorics · Mathematics 2011-03-04 Mihail Cocos , Shawn Fowers

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

We give a modern introduction to the moduli of sheaves. After reviewing the classical theory, we give a catalogue of results from the last decade. We then consider a more "symmetric" formulation of the theory by working with gerbes from the…

Algebraic Geometry · Mathematics 2017-08-03 Max Lieblich

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

Given a number $r$, we consider the dynamical system generated by repeated exponentiations modulo $r$, that is, by the map $u \mapsto f_g(u)$, where $f_g(u) \equiv g^u \pmod r$ and $0 \le f_g(u) \le r-1$. The number of cycles of the defined…

Number Theory · Mathematics 2010-06-15 Lev Glebsky

First, a new proof of Berman and Charpin's characterization of the Reed-Muller codes over the binary field or over an arbitrary prime field is presented. These codes are considered as the powers of the radical of a modular algebra.…

Information Theory · Computer Science 2016-01-29 Harinaivo Andriatahiny