English
Related papers

Related papers: Almost Affine Invariance Over Prime Fields: Green …

200 papers

In the present paper, we consider an elliptic divergence form operator in $\mathbb{R}^n\setminus\mathbb{R}^d$ with $d<n-1$ and prove that its Green function is almost affine, in the sense that the normalized difference between the Green…

Analysis of PDEs · Mathematics 2021-07-20 Guy David , Linhan Li , Svitlana Mayboroda

In this paper we consider the problem of finding a maximum weight set subject to a $k$-extendible constraint in the data stream model. The only non-trivial algorithm known for this problem to date---to the best of our knowledge---is a…

Data Structures and Algorithms · Computer Science 2019-06-12 Moran Feldman , Ran Haba

An almost PI algebra is a generalisation of a just infinite algebra which does not satisfy a polynomial identity. An almost PI algebra has some nice properties: It is prime, has a countable cofinal subset of ideals and when satisfying…

Rings and Algebras · Mathematics 2011-02-08 Vered Moskowicz

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

We establish the following quantitative form of the Green--Tao theorem: if a set $\mathcal{A}$ of relative density $\delta$ within the primes up to $N$ contains no nontrivial arithmetic progressions of length $k\geq 4$, then $\delta\ll…

Number Theory · Mathematics 2026-03-11 Joni Teräväinen , Mengdi Wang

Optimization problems under affine constraints appear in various areas of machine learning. We consider the task of minimizing a smooth strongly convex function F(x) under the affine constraint Kx=b, with an oracle providing evaluations of…

Optimization and Control · Mathematics 2022-04-12 Adil Salim , Laurent Condat , Dmitry Kovalev , Peter Richtárik

Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…

Numerical Analysis · Mathematics 2016-05-25 Olivier Verdier

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Formal Languages and Automata Theory · Computer Science 2017-03-16 Lukas Fleischer , Manfred Kufleitner

In this work, we introduce a natural notion concerning finite vector spaces. A family of $k$-dimensional subspaces of $\mathbb{F}_q^n$, which forms a partial spread, is called almost affinely disjoint if any $(k+1)$-dimensional subspace…

Combinatorics · Mathematics 2021-06-29 Hedongliang Liu , Nikita Polyanskii , Ilya Vorobyev , Antonia Wachter-Zeh

While obtaining optimal algorithms for the most important problems in the LOCAL model has been one of the central goals in the area of distributed algorithms since its infancy, tight complexity bounds are elusive for many problems even when…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-05-06 Sebastian Brandt , Ananth Narayanan

For a large class of quickly mixing dynamical systems, we prove that the error in the almost sure approximation with a Brownian motion is of order O((log n)^a) with a $\ge$ 2. Specifically, we consider nonuniformly expanding maps with…

Probability · Mathematics 2018-11-26 C Cuny , J Dedecker , A Korepanov , Florence Merlevède

$\newcommand{\F}{\mathbb{F}}$We study the Boolean function parameters sensitivity ($s$), block sensitivity ($bs$), and alternation ($alt$) under specially designed affine transforms. For a function $f:\F_2^n\to \{0,1\}$, and $A=Mx+b$ for $M…

Computational Complexity · Computer Science 2020-09-15 Krishnamoorthy Dinesh , Jayalal Sarma

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…

Number Theory · Mathematics 2012-05-22 James Maynard

Let k be a global field and \pp any nonarchimedean prime of k. We give a new and uniform proof of the well known fact that the set of all elements of k which are integral at \pp is diophantine over k. Let k^{perf} be the perfect closure of…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger

Consider a translation-invariant system of linear equations $V x = 0$ of complexity one, where $V$ is an integer $r \times t$ matrix. We show that if $A$ is a subset of the primes up to $N$ of density at least $C(\log\log N)^{-1/25t}$,…

Number Theory · Mathematics 2014-05-19 Kevin Henriot

For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime…

Computational Geometry · Computer Science 2024-05-21 Dror Chawin , Ishay Haviv

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

Let $\pi_1(C)$ be the fundamental group of a smooth irreducible affine curve $C$ over an algebraically closed field of positive characteristic. It is shown that given an embedding problem for $\pi_1(C)$ there exist an open index $p$ normal…

Algebraic Geometry · Mathematics 2010-01-06 Manish Kumar

Consider the geometric range space $(X, \mathcal{H}_d)$ where $X \subset \mathbb{R}^d$ and $\mathcal{H}_d$ is the set of ranges defined by $d$-dimensional halfspaces. In this setting we consider that $X$ is the disjoint union of a red and…

Computational Geometry · Computer Science 2021-06-29 Michael Matheny , Jeff M. Phillips

The problem we are considering is the following. A colorblind player is given a set $B = \{b_1,b_2,...,b_N\}$ of $N$ colored balls. He knows that each ball is colored either red or green, and that there are less green balls (this will be…