English
Related papers

Related papers: Testing Low Complexity Affine-Invariant Properties

200 papers

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

Information Theory · Computer Science 2010-06-22 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…

Computational Complexity · Computer Science 2016-05-20 Radu Iosif , Arnaud Sangnier

A cluster algebra is a commutative algebra whose structure is decided by a skew-symmetrizable matrix or a quiver. When a skew-symmetrizable matrix is invariant under an action of a finite group and this action is admissible, the folded…

Combinatorics · Mathematics 2022-08-31 Byung Hee An , Eunjeong Lee

A basic problem in the study of algebraic morphisms is to determine which sets can be realised as the image of an endomorphism of affine space. This paper extends the results previously obtained by the first author on the question of…

Algebraic Geometry · Mathematics 2023-11-15 Viktor Balch Barth , Tuyen Trung Truong

Understanding the local behaviour of structured multi-dimensional data is a fundamental problem in various areas of computer science. As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically…

Data Structures and Algorithms · Computer Science 2017-03-28 Omri Ben-Eliezer , Simon Korman , Daniel Reichman

Given a polynomial endomorphism F of the n-dimensional affine space over a field K, we define a sequence of polynomial endomorphisms of the affine space associated to F. We call F nice if there exists an integer m such that the m-th term of…

Algebraic Geometry · Mathematics 2016-01-07 Elzbieta Adamus , Pawel Bogdan , Teresa Crespo , Zbigniew Hajto

Let F be a non-Archimedean locally compact field with residual characteristic p, let G be an inner form of GL(n,F) for a positive integer n and let R be an algebraically closed field of characteristic different from p. When R has…

Representation Theory · Mathematics 2015-03-23 Alberto Mínguez , Vincent Sécherre

Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…

Information Theory · Computer Science 2024-12-03 S. Venkitesh

In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…

Rings and Algebras · Mathematics 2019-08-20 Umberto Martínez-Peñas

In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of…

Information Theory · Computer Science 2023-02-13 José Joaquín Bernal , Juan Jacobo Simón

In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an…

Computational Complexity · Computer Science 2018-05-11 Aleksandrs Belovs

Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of…

Information Theory · Computer Science 2011-08-23 Xuebin Wu , Zhiyuan Yan

Let $p$ be a prime. Given a polynomial in $\F_{p^m}[x]$ of degree $d$ over the finite field $\F_{p^m}$, one can view it as a map from $\F_{p^m}$ to $\F_{p^m}$, and examine the image of this map, also known as the value set. In this paper,…

Number Theory · Mathematics 2011-11-07 Qi Cheng , Joshua E. Hill , Daqing Wan

Continuing ideas of a recent preprint of Schwede arXiv:0906.4313 we study test ideals by viewing them as minimal objects in a certain class of $F$-pure modules over algebras of p^{-e}-linear operators. This shift in the viewpoint leads to a…

Commutative Algebra · Mathematics 2013-08-26 Manuel Blickle

We obtain computational hardness results for f-vectors of polytopes by exhibiting reductions of the problems DIVISOR and SEMI-PRIME TESTABILITY to problems on f-vectors of polytopes. Further, we show that the corresponding problems for…

Combinatorics · Mathematics 2021-09-20 Eran Nevo

The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…

Number Theory · Mathematics 2023-08-02 Juan Hernandez-Toro

We introduce a notion of quasi-lisse vertex algebras, which generalizes admissible affine vertex algebras. We show that the normalized character of an ordinary module over a quasi-lisse vertex operator algebra has a modular invariance…

Quantum Algebra · Mathematics 2017-07-24 Tomoyuki Arakawa , Kazuya Kawasetsu

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

Rings and Algebras · Mathematics 2022-03-08 Jason P. Bell , Peter V. Danchev

We give an algebraic characterization of the affine $3$-space over an algebraically closed field of arbitrary characteristic. We use this characterization to reformulate the following question. Let $$A=k[X, Y, Z, T]/(XY+Z^{p^e}+T+T^{sp})$$…

Commutative Algebra · Mathematics 2024-05-07 P. M. S. Sai Krishna

We study the question of local testability of low (constant) degree functions from a product domain $S_1 \times \dots \times {S}_n$ to a field $\mathbb{F}$, where ${S_i} \subseteq \mathbb{F}$ can be arbitrary constant sized sets. We show…

Computational Complexity · Computer Science 2024-11-12 Prashanth Amireddy , Srikanth Srinivasan , Madhu Sudan