Related papers: $p$-Linear schemes for sequences modulo $p^r$

Several important families of computational and statistical results in machine learning and randomized algorithms rely on uniform bounds on quadratic forms of random vectors or matrices. Such results include the Johnson-Lindenstrauss (J-L)…

Using an adelic approach we simultaneously consider real and p-adic aspects of dynamical systems whose states are mapped by linear fractional transformations isomorphic to some subgroups of GL (2, Q), SL (2, Q) and SL (2, Z) groups. In…

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

Suppose that $p$ is an odd prime and $\genfrac{(}{)}{}{}{\cdot}{p}$ denotes the Legendre symbol modulo $p$. If $p$ is has the form $p= n^2+1$ then one easily verifies that $\genfrac{(}{)}{}{}{a}{p} = \genfrac{(}{)}{}{}{-a}{p}$ for all $a\in…

We present numerous interesting, mostly new, results involving the $n$-step Fibonacci numbers and $n$-step Lucas numbers and a generalization. Properties considered include recurrence relations, summation identities, including binomial and…

We compute the operator $p$-norm of some $n\times n$ complex matrices, which can be seen as bounded linear operators on the $n$ dimensional Banach space $\ell^p(n)$. The notion of logarithmic affine matrices is defined, and for such a…

We propose a combinatorial method of proving non-specialty of a linear system of curves with multiple points in general positions. As an application we obtain a classification of special linear systems on P1xP1 for which the multiplicities…

In this paper, for any prime $p$, we propose the notion of a $p$-transitive association scheme. This notion aims to generalize the fact that the regular module of a group algebra of a finite group has a unique trivial submodule to the case…

Lucas' theorem describes how to reduce a binomial coefficient $\binom{a}{b}$ modulo $p$ by breaking off the least significant digits of $a$ and $b$ in base $p$. We characterize the pairs of these digits for which Lucas' theorem holds modulo…

At the magnetic saturation field, certain frustrated lattices have a class of states known as "localized multi-magnon states" as exact ground states. The number of these states scales exponentially with the number $N$ of spins and hence…

Let r : G_Q -> GL_n Q_l be a motivic l-adic Galois representation. For fixed m > 1 we initiate an investigation of the density of the set of primes p such that the trace of the image of an arithmetic Frobenius at p under r is an m^th power…

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…

Empirical processes for stationary, causal sequences are considered. We establish empirical central limit theorems for classes of indicators of left half lines, absolutely continuous functions and piecewise differentiable functions. Sample…

We study the supersingular curves on Picard modular surfaces modulo a prime $p$ which is inert in the underlying quadratic imaginary field. We analyze the automorphic vector bundles in characteristic $p$, and as an application derive a…

This paper studies the complexity of languages of finite words using automata theory. To go beyond the class of regular languages, we consider infinite automata and the notion of state complexity defined by Karp. Motivated by the seminal…

Let $\mathcal{F}$ be a family of subsets of $[n]$ and $L$ be a subset of $[n]$. We say $\mathcal{F}$ is an $L$-differencing Sperner system if $|A\setminus B|\in L$ for any distinct $A,B\in\mathcal{F}$. Let $p$ be a prime and $q$ be a power…

In this paper, we consider arithmetic progressions contained in Lucas sequences of first and second kind. We prove that for almost all sequences, there are only finitely many and their number can be effectively bounded. We also show that…

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

We present logically based methods for constructing XP and FPT graph algorithms, parametrized by tree-width or clique-width. We will use fly-automata introduced in a previous article. They make possible to check properties that are not…

Linear differential equations with polynomial coefficients over a field $K$ of positive characteristic $p$ with local exponents in the prime field have a basis of solutions in the differential extension $\mathcal{R}_p=K(z_1, z_2,…