English
Related papers

Related papers: On the distribution of sparse sequences in prime f…

200 papers

In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.

Number Theory · Mathematics 2007-05-23 Zarko Mijajlovic , Milos Milosevic , Aleksandar Perovic

Let $p>2$ be prime and $g$ a primitive root modulo $p$. We present an argument for the fact that discrete logarithms of the numbers in any arithmetic progression are uniformly distributed in $[1,p]$ and raise some questions on the subject.

Number Theory · Mathematics 2008-11-27 Cristian Cobeli

We prove a number of limiting distributions for statistics for unimodal sequences of positive integers by adapting a probabilistic framework for integer partitions introduced by Fristedt. The difficulty in applying the direct analogue of…

Number Theory · Mathematics 2022-01-20 Walter Bridges , Kathrin Bringmann

This paper presents Sparse Partitioning, a Bayesian method for identifying predictors that either individually or in combination with others affect a response variable. The method is designed for regression problems involving binary or…

Quantitative Methods · Quantitative Biology 2011-08-31 Doug Speed , Simon Tavaré

Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…

Number Theory · Mathematics 2007-05-23 Zeev Rudnick , Alexandru Zaharescu

Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…

Information Theory · Computer Science 2013-06-25 Elisa Gorla , Alberto Ravagnani

We prove two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

Probability · Mathematics 2016-12-23 Mark Rudelson , Roman Vershynin

We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we…

Number Theory · Mathematics 2025-08-13 William Banks , Kevin Ford , Terence Tao

Motivated by the need to better understand the properties of sparse cutting-planes used in mixed integer programming solvers, the paper [2] studied the idealized problem of how well a polytope is approximated by the use of sparse valid…

Optimization and Control · Mathematics 2014-12-12 Santanu S. Dey , Andres Iroume , Marco Molinaro

We assume the direct sum <A> o <B> for the signal subspace. As a result of post- measurement, a number of operational contexts presuppose the a priori knowledge of the LB -dimensional "interfering" subspace <B> and the goal is to estimate…

Applications · Statistics 2017-04-17 Guillaume Bouleux , Rémy Boyer

The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…

Number Theory · Mathematics 2016-03-22 Dinesh S. Thakur

The potential of location-shift models to find adequate models between the proportional odds model and the non-proportional odds model is investigated. It is demonstrated that these models are very useful in ordinal modeling. While…

Methodology · Statistics 2020-06-09 Gerhard Tutz , Moritz Berger

We consider the distribution of the polygonal paths joining partial sums of classical Kloosterman sums, as their parameter varies modulo a prime tending to infinity. Using independence of Kloosterman sheaves, we prove convergence in the…

Number Theory · Mathematics 2019-02-20 Emmanuel Kowalski , William F. Sawin

We revisit the probabilistic construction of sparse random matrices where each column has a fixed number of nonzeros whose row indices are drawn uniformly at random with replacement. These matrices have a one-to-one correspondence with the…

Information Theory · Computer Science 2013-07-16 Bubacarr Bah , Jared Tanner

I present a new property of prime numbers that leads to a generalization of Cramer's conjecture. The study of the gap between consecutive primes is treated as a special case of the gap between consecutive terms of sequences having a certain…

Number Theory · Mathematics 2010-10-12 Nilotpal Kanti Sinha

This note studies local integral gradient bounds for distributional solutions of a large class of partial differential inequalities with diffusion in divergence form and power-like first-order terms. The applications of these estimates are…

Analysis of PDEs · Mathematics 2022-03-25 Alessandro Goffi

The first focus of this paper is the characterization of the spectrum and the singular values of the coefficient matrix stemming from the discretization with space-time grid for a parabolic diffusion problem and from the approximation of…

Numerical Analysis · Mathematics 2023-02-17 Matthias Bolten , Sven-Erik Ekström , Isabella Furci , Stefano Serra-Capizzano

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

Number Theory · Mathematics 2022-01-06 Piotr Miska , János T. Tóth , Błażej Żmija

We establish a sparsity in terms of $\ell_p$-summability and weighted $\ell_2$-summability for the coefficients of the Laguerre generalized piecewise-polynomial chaos expansion of solutions to parametric elliptic PDEs with log-Laplace…

Numerical Analysis · Mathematics 2026-03-24 Dinh Dũng

There has been recently a lot of research on sparse variants of random projections, faster adaptations of the state-of-the-art dimensionality reduction technique originally due to Johsnon and Lindenstrauss. Although the construction is very…

Data Structures and Algorithms · Computer Science 2024-07-23 Maciej Skórski