English
Related papers

Related papers: A new sieve for restricted multiset counting

200 papers

We construct a symmetric monoidal category $LIE^{MC}$ whose objects are shifted L-infinity algebras equipped with a complete descending filtration. Morphisms of this category are "enhanced" infinity morphisms between shifted L-infinity…

Category Theory · Mathematics 2016-01-11 Vasily A. Dolgushev , Christopher L. Rogers

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

Number Theory · Mathematics 2019-12-19 Miguel N. Walsh

Let $\tau$ denote the divisor function, and $f$ be any multiplicative function that satisfies some mild hypotheses. We establish the asymptotic formula or non-trivial upper bound for the shifted convolution sum $\sum_{n \leq…

Number Theory · Mathematics 2022-04-19 Yujiao Jiang , Guangshi Lü

This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…

Optimization and Control · Mathematics 2018-06-18 Evgeni Nurminski , Stan Uryasev

Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…

Logic in Computer Science · Computer Science 2025-08-13 Mudathir Mohamed , Nick Feng , Andrew Reynolds , Cesare Tinelli , Clark Barrett , Marsha Chechik

Starting with an infinite set of non linear Equations for the Li-Keiper coefficients, we first specify a lower bound emerging from the infinite set and give a characterization of it. Then, we propose a possible new upper and lower bound for…

General Mathematics · Mathematics 2020-12-16 Merlini Danilo , Sala Massimo , Sala Nicoletta

We derive, for all prime moduli p except those in a very thin set, an upper bound for the least prime primitive root (mod p) of order of magnitude a constant power of log p. The improvement over previous results, where the upper bound was…

Number Theory · Mathematics 2007-05-23 Greg Martin

A prime sieve is an algorithm that finds the primes up to a bound $n$. We say that a prime sieve is incremental, if it can quickly determine if $n+1$ is prime after having found all primes up to $n$. We say a sieve is compact if it uses…

Data Structures and Algorithms · Computer Science 2019-02-20 Jonathan P. Sorenson

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

Rings and Algebras · Mathematics 2023-09-12 Alexander Levin

The aim of this note is to analyse the structure of the $L^0$-normed $L^0$-modules over a metric measure space. These are a tool that has been introduced by N. Gigli to develop a differential calculus on spaces verifying the Riemannian…

Differential Geometry · Mathematics 2018-03-09 Danka Lučić , Enrico Pasqualetto

We provide a new construction for a set of boxes approximating axis-parallel boxes of fixed volume in $[0, 1]^d$. This improves upper bounds for the minimal dispersion of a point set in the unit cube and its inverse in both the periodic and…

Metric Geometry · Mathematics 2022-01-24 Alexander E. Litvak , Galyna V. Livshyts

Let $X$ be a finite collection of sets. We count the number of ways a disjoint union of $n-1$ subsets in $X$ is a set in $X$, and estimate this number from above by $|X|^{c(n)}$ where $$ c(n)=\left(1-\frac{(n-1)\ln (n-1)}{n\ln n}…

Analysis of PDEs · Mathematics 2017-07-03 Paata Ivanisvili

Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c…

Number Theory · Mathematics 2019-10-22 Kevin Ford

A binomial coefficient identity due to Zhi-Wei Sun is the subject of half a dozen recent papers that prove it by various analytic techniques and establish a generalization. Here we give a simple proof that uses weight-reversing involutions…

Combinatorics · Mathematics 2007-05-23 David Callan

Haisheng Li showed that given a module (W,Y_W(\cdot,x)) for a vertex algebra (V,Y(\cdot,x)), one can obtain a new V-module W^{\Delta} = (W,Y_W(\Delta(x)\cdot,x)) if \Delta(x) satisfies certain natural conditions. Li presented a collection…

Quantum Algebra · Mathematics 2009-02-02 William J. Cook , Christopher Sadowski

We prove that the set of large values of the trigonometric polynomial over a subset of density of the primes has some additive structure, similarly to what happens for subsets of densities in $\mathbb{Z}/{N}\mathbb{Z}$ but in a weaker form.…

Number Theory · Mathematics 2025-01-10 Olivier Ramaré

We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…

Combinatorics · Mathematics 2017-10-19 Zhicheng Gao , Andrew MacFie , Qiang Wang

Using shift vector method we obtain a large class of self-dual lattices of dimension $(l,l)$, which has a one to one correspondence with modular invariants of free bosonic theory compactified on co-root lattice of a rank $l$ Lie group. Then…

High Energy Physics - Theory · Physics 2009-10-22 H. Arfaei , A. Shirzad

In this paper we continue the study of group representations which are counterexamples to the Ize conjecture. As in the previous papers by Lauterbach [14] and Lauterbach & Matthews [15] we find new infinite series of finite groups leading…

Dynamical Systems · Mathematics 2021-01-29 Reiner Lauterbach , Sören Schwenker

We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…

Combinatorics · Mathematics 2009-11-10 Alexander Fish