English
Related papers

Related papers: Excluding affine configurations over a finite fiel…

200 papers

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

Combinatorics · Mathematics 2021-05-17 Lisa Sauermann

Consider a system of $m$ balanced linear equations in $k$ variables with coefficients in $\mathbb{F}_q$. If $k \geq 2m + 1$, then a routine application of the slice rank method shows that there are constants $\beta,\gamma \geq 1$ with…

Combinatorics · Mathematics 2023-09-25 Josse van Dobben de Bruyn , Dion Gijswijt

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Algebraic Geometry · Mathematics 2022-04-26 Stefan Barańczuk

Let $E_1,\ldots,E_k$ be a collection of linear series on an algebraic variety $X$ over $\mathbb{C}$. That is, $E_i\subset H^0(X, \mathcal{L}_i)$ is a finite dimensional subspace of the space of regular sections of line bundles $…

Algebraic Geometry · Mathematics 2020-01-03 Leonid Monin

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Classical Analysis and ODEs · Mathematics 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta

We prove a removal lemma for systems of linear equations over finite fields: let $X_1,...,X_m$ be subsets of the finite field $\F_q$ and let $A$ be a $(k\times m)$ matrix with coefficients in $\F_q$ and rank $k$; if the linear system $Ax=b$…

Combinatorics · Mathematics 2008-09-11 Dan Král' , Oriol Serra , Lluís Vena

We consider linear optimization over a fixed compact convex feasible region that is semi-algebraic (or, more generally, "tame"). Generically, we prove that the optimal solution is unique and lies on a unique manifold, around which the…

Optimization and Control · Mathematics 2009-01-21 J. Bolte , A. Daniilidis , A. S. Lewis

We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…

Optimization and Control · Mathematics 2021-10-05 Alexander Barvinok , Mark Rudelson

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

Algebraic Geometry · Mathematics 2012-11-16 Maria Isabel Herrero , Gabriela Jeronimo , Juan Sabia

Fix non-zero reals $\alpha_1,\ldots,\alpha_n$ with $n\ge 2$ and let $K$ be a non-empty open connected set in a topological vector space such that $\sum_{i\le n}\alpha_iK\subseteq K$ (which holds, in particular, if $K$ is an open convex cone…

Functional Analysis · Mathematics 2019-06-03 Paolo Leonetti , Jens Schwaiger

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

We show that any semi-algebraic sweeping process admits piecewise absolutely continuous solutions, and any such bounded trajectory must have finite length. Analogous results hold more generally for sweeping processes definable in o-minimal…

Optimization and Control · Mathematics 2016-11-29 Aris Daniilidis , Dmitriy Drusvyatskiy

We extend the notion of a tame covering of a pair (X,D) where X is a regular scheme and D is a normal crossing divisor (cf. SGA1), to pairs (X,Y) where X is an arbitrary scheme and Y is a closed subset in X. We show that the abelianized…

Number Theory · Mathematics 2007-05-23 Alexander Schmidt

Let n be an even positive integer and F be the field \GF(2). A word in F^n is called balanced if its Hamming weight is n/2. A subset C \subseteq F^n$ is called a balancing set if for every word y \in F^n there is a word x \in C such that y…

Information Theory · Computer Science 2010-12-17 Arya Mazumdar , Ron M. Roth , Pascal O. Vontobel

The system of tensor equations (TEs) has received much considerable attention in the recent literature. In this paper, we consider a class of generalized tensor equations (GTEs). An important difference between GTEs and TEs is that GTEs can…

Optimization and Control · Mathematics 2018-10-16 Weijie Yan , Chen Ling , Liyun Ling , Hongjin He

We consider systems $\vec{F}(\vec{x})$ of $R$ homogeneous forms of the same degree $d$ in $n$ variables with integral coefficients. If $n\geq d2^dR+R$ and the coefficients of $\vec{F}$ lie in an explicit Zariski open set, we give a…

Number Theory · Mathematics 2017-10-25 Simon L. Rydin Myerson

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

Statistics Theory · Mathematics 2008-04-14 Akimichi Takemura , Ruriko Yoshida

We prove the existence of strongly tame sets in affine algebraic homogenenous spaces of linear algebraic Lie groups. We also show that $(\mathbb{C}^n,A)$ for a discrete tame set enjoy the relative density property, and we provide examples…

Complex Variables · Mathematics 2022-12-21 Rafael B. Andrist , Riccardo Ugolini

A system of linear equations in $\mathbb{F}_p^n$ is \textit{common} if every two-colouring of $\mathbb{F}_p^n$ yields at least as many monochromatic solutions as a random two-colouring, asymptotically as $n \to \infty$. By analogy to the…

Combinatorics · Mathematics 2022-10-31 Daniel Altman

Fix a vector space over a finite field and a system of linear equations. We provide estimates, in terms of the dimension of the vector space, of the maximum of the sizes of subsets of the space that do not admit solutions of the system…

Combinatorics · Mathematics 2019-09-24 Masato Mimura , Norihide Tokushige
‹ Prev 1 2 3 10 Next ›