English
Related papers

Related papers: Testing Low Complexity Affine-Invariant Properties

200 papers

We consider properties of edge-colored vertex-ordered graphs, i.e., graphs with a totally ordered vertex set and a finite set of possible edge colors. We show that any hereditary property of such graphs is strongly testable, i.e., testable…

Data Structures and Algorithms · Computer Science 2017-04-11 Noga Alon , Omri Ben-Eliezer , Eldar Fischer

An affine invariant point on the class of convex bodies in R^n, endowed with the Hausdorff metric, is a continuous map p which is invariant under one-to-one affine transformations A on R^n, that is, p(A(K))=A(p(K)). We define here the new…

Functional Analysis · Mathematics 2013-10-02 Mathieu Meyer , Carsten Schuett , Elisabeth M. Werner

In this paper, two structural results concerning low degree polynomials over finite fields are given. The first states that over any finite field $\mathbb{F}$, for any polynomial $f$ on $n$ variables with degree $d \le \log(n)/10$, there…

Computational Complexity · Computer Science 2014-04-03 Gil Cohen , Avishay Tal

We consider the following multiplication-based tests to check if a given function $f: \mathbb{F}_q^n\to \mathbb{F}_q$ is a codeword of the Reed-Muller code of dimension $n$ and order $d$ over the finite field $\mathbb{F}_q$ for prime $q$…

Computational Complexity · Computer Science 2020-01-01 Prahladh Harsha , Srikanth Srinivasan

The complexity of continuous piecewise affine (CPA) functions can be measured by the number of pieces $p$ or the number of distinct affine functions $n$. For CPA functions on $\mathbb{R}^d$, this paper shows an upper bound of $p=O(n^{d+1})$…

Combinatorics · Mathematics 2025-03-17 Leo Zanotti

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

Logic in Computer Science · Computer Science 2018-05-03 Ehud Hrushovski , Joël Ouaknine , Amaury Pouly , James Worrell

Lifted Reed-Solomon codes, a subclass of lifted affine-invariant codes, have been shown to be of high rate while preserving locality properties similar to generalized Reed-Muller codes, which they contain as subcodes. This work introduces a…

Information Theory · Computer Science 2021-04-22 Lukas Holzbaur , Nikita Polyanskii

Let K be an algebraically closed field endowed with a complete non-archimedean norm. Let f:Y -> X be a map of K-affinoid varieties. We prove that for each point x in X, either f is flat at x, or there exists, at least locally around x, a…

Rings and Algebras · Mathematics 2009-09-25 Hans Schoutens

In this paper, we shall prove that the irreducibility in the sense of fine topology implies the uniqueness of invariant probability measures. It is also proven that this irreducibility is strictly weaker than the strong Feller property plus…

Probability · Mathematics 2009-02-20 Ping He , Jiangang Ying

We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by…

Logic in Computer Science · Computer Science 2007-05-23 U. Dal Lago , M. Hofmann

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

Information Theory · Computer Science 2013-04-09 Stéphane Ballet , Robert Rolland

It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…

Dynamical Systems · Mathematics 2014-01-09 Antoine Julien

The well-known DeMillo-Lipton-Schwartz-Zippel lemma says that $n$-variate polynomials of total degree at most $d$ over grids, i.e. sets of the form $A_1 \times A_2 \times \cdots \times A_n$, form error-correcting codes (of distance at least…

Computational Complexity · Computer Science 2018-12-17 Mitali Bafna , Srikanth Srinivasan , Madhu Sudan

This paper deals with affine connections on real manifolds. We give a new characterization of flat affine connections on real manifolds by means of certain affine representations of the Lie group of automorphisms preserving the connection.…

Differential Geometry · Mathematics 2018-08-31 Alberto Medina , Omar Saldarriaga , Andres Villabón

Invariant affine reflection algebras are the last and the most general known extension of affine Kac-Moody Lie algebras, introduced in recent years. We develop a method known as "affinization" to the class of invariant affine reflection…

Quantum Algebra · Mathematics 2011-09-01 Saeid Azam , S. Reza Hosseini , Malihe Yousofzadeh

It was recently proven that the total multiplicity in the decomposition into irreducibles of the tensor product lambda x mu of two irreducible representations of a simple Lie algebra is invariant under conjugation of one of them; at a given…

Mathematical Physics · Physics 2014-11-11 Robert Coquereaux , Jean-Bernard Zuber

Let $A\subset \mathbb{F}_p$ with density 1/2. We call a set $A$ almost affine invariant under an affine transformation $\phi(x)=ax+b$ if \[|A \triangle \phi(A)| =o(p).\] We determine that, the threshold value of $K$ such that $A$ is almost…

Combinatorics · Mathematics 2026-05-14 Jie Ma , Quanyu Tang , Max Wenqiang Xu

In the last decades affine algebraic varieties and Stein manifolds with big (infinite-dimensional) automorphism groups have been intensively studied. Several notions expressing that the automorphisms group is big have been proposed. All of…

Complex Variables · Mathematics 2013-10-10 Frank Kutzschebauch

It is known that if $p$ is a sufficiently large prime then for every function $f:\mathbb{Z}_p\to [0,1]$ there exists a continuous function on the circle $f':\mathbb{T}\to [0,1]$ such that the averages of $f$ and $f'$ across any prescribed…

Combinatorics · Mathematics 2016-09-13 Pablo Candela , Balázs Szegedy

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

Information Theory · Computer Science 2011-02-24 Davide Schipani , Michele Elia , Joachim Rosenthal