English
Related papers

Related papers: Testing Low Complexity Affine-Invariant Properties

200 papers

For a property $P$ and a sub-property $P'$, we say that $P$ is $P'$-partially testable with $q$ queries if there exists an algorithm that distinguishes, with high probability, inputs in $P'$ from inputs $\epsilon$-far from $P$ by using $q$…

Computational Complexity · Computer Science 2013-06-07 Eldar Fischer , Yonatan Goldhirsh , Oded Lachish

We develop criteria for affine varieties to admit uniruled subvarieties of certain dimensions. The measurements are from long exact sequences of versions of symplectic cohomology, which is a Hamiltonian Floer theory for some open symplectic…

Symplectic Geometry · Mathematics 2022-01-27 Dahye Cho

In this article, we prove that if $R$ is an affine algebra of dimension $d\geq 4$ over $\overline{\mathbb{F}}_{p}$ and $1/(d-1)! \in R,$ then any unimodular row over $R$ of length $d$ can be mapped to a factorial row by elementary…

Rings and Algebras · Mathematics 2026-04-06 Sampat Sharma

We prove two structure theorems for simple, locally finite dimensional Lie algebras over an algebraically closed field of characteristic $p$ which give sufficient conditions for the algebras to be of the form $[R^{(-)}, R^{(-)}] / (Z(R)…

Rings and Algebras · Mathematics 2013-11-22 Johanna Hennig

We present a complexity measure for any finite time series. This measure has invariance under any monotonic transformation of the time series, has a degree of robustness against noise, and has the adaptability of satisfying almost all the…

Chaotic Dynamics · Physics 2008-11-25 Da-Guan Ke , Qin-Ye Tong

The characterization of permutations over finite fields is an important topic in number theory with a long-standing history. This paper presents a systematic investigation of low-degree bivariate polynomial systems $F=(f_1(x,y),f_2(x,y))$…

Number Theory · Mathematics 2025-08-05 Xuan Pang , Yangcheng Li , Pingzhi Yuan , Yuanpeng Zeng

These are notes of a talk based on the work arXiv:1212.3630 joint with A. Aizenbud. Let V be a finite-dimensional vector space over a local field F of characteristic 0. Let f be a function on V of the form $f(x)= \psi (P(x))$, where P is a…

Algebraic Geometry · Mathematics 2014-09-22 Vladimir Drinfeld

Let $f:\mathbb{K}^n\rightarrow\mathbb{K}^m$ be a generically finite polynomial map of degree $d$ between affine spaces. In arXiv:1411.5011 we proved that if $\mathbb{K}$ is the field of complex or real numbers, then the set $S_f$ of points…

Algebraic Geometry · Mathematics 2021-04-06 Zbigniew Jelonek , Michał Lasoń

Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…

Rings and Algebras · Mathematics 2024-05-07 Clément de Seguins Pazzis

We give several new criteria for a quasi-projective variety to be affine. In particular, we prove that an algebraic manifold $Y$ with dimension $n$ is affine if and only if $H^i(Y, \Omega^j_Y)=0$ for all $j\geq 0$, $i>0$ and $\kappa(D,…

Algebraic Geometry · Mathematics 2007-05-23 Jing Zhang

In this paper we generalize the well-known notions of affine arclength and affine hypersurface measure to submanifolds of any dimension $d$ in $\mathbb R^n$ , $1 \leq d \leq n-1$. We show that a canonical affine invariant measure exists and…

Classical Analysis and ODEs · Mathematics 2019-09-18 Philip T. Gressman

We consider the problem of $L_p$-testing of class of bounded derivative properties over hypergrid domain with points distributed according to some product distribution. This class includes monotonicity, the Lipschitz property,…

Data Structures and Algorithms · Computer Science 2014-05-02 Kashyap Dixit

Property testing algorithms are highly efficient algorithms, that come with probabilistic accuracy guarantees. For a property P, the goal is to distinguish inputs that have P from those that are far from having P with high probability…

Logic in Computer Science · Computer Science 2020-09-17 Isolde Adler , Polly Fahey

Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also give applications and connections to polynomial identity…

Computational Complexity · Computer Science 2009-07-24 V. Arvind , Pushkar S. Joglekar , Srikanth Srinivasan

In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is decidable in polynomial time.

Programming Languages · Computer Science 2007-05-23 Fred Mesnard , Alexander Serebrenik

In this work we explore error-correcting codes derived from the "lifting" of "affine-invariant" codes. Affine-invariant codes are simply linear codes whose coordinates are a vector space over a field and which are invariant under…

Information Theory · Computer Science 2012-11-09 Alan Guo , Swastik Kopparty , Madhu Sudan

An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions…

Optimization and Control · Mathematics 2012-09-05 Corentin Briat , Alexandre Seuret

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

A conjecture of Kalai asserts that for $d\geq 4$, the affine type of a prime simplicial $d$-polytope $P$ can be reconstructed from the space of affine $2$-stresses of $P$. We prove this conjecture for all $d\geq 5$. We also prove the…

Combinatorics · Mathematics 2023-11-21 Satoshi Murai , Isabella Novik , Hailun Zheng

Let $p$ be a prime, let $S$ be a non-empty subset of $\mathbb{F}_p$ and let $0<\epsilon\leq 1$. We show that there exists a constant $C=C(p, \epsilon)$ such that for every positive integer $k$, whenever $\phi_1, \dots, \phi_k:…

Combinatorics · Mathematics 2023-06-02 W. T. Gowers , Thomas Karam
‹ Prev 1 4 5 6 7 8 10 Next ›