相关论文: A Removal Lemma for Systems of Linear Equations ov…

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$…

Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…

We propose a method of removal of design points that cannot support any E-optimal experimental design of a linear regression model with uncorrelated observations. The proposed method can be used to reduce the size of some large E-optimal…

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…

We present necessary and sufficient conditions for the termination of linear homogeneous programs. We also develop a complete method to check termination for this class of programs. Our complete characterization of termination for such…

We present a complexity reduction algorithm for a family of parameter-dependent linear systems when the system parameters belong to a compact semi-algebraic set. This algorithm potentially describes the underlying dynamical system with…

Let ${\bf M}_n(\mathbb{F})$ be the algebra of $n\times n$ matrices over an arbitrary field $\mathbb{F}$. We consider linear maps $\Phi: {\bf M}_n(\mathbb{F}) \rightarrow {\bf M}_r(\mathbb{F})$ preserving matrices annihilated by a fixed…

We prove an analogue of James-Donkin row removal theorems for arbitrary diagrammatic Cherednik algebras. This is one of the first results concerning the (graded) decomposition numbers of these algebras over fields of arbitrary…

Our goal in this note is to show that cohomology classes with coefficients in finite flat group schemes can be killed by finite covers of the base scheme, and similarly for abelian schemes with "finite covers" replaced by "proper covers."…

Let $\mathbb{F}_q$ be a finite field, let $\mathbb{X}$ be a subset of a projective space ${\mathbb P}^{s-1}$, over the field $\mathbb{F}_q$, parameterized by rational functions, and let $I(\mathbb{X})$ be the vanishing ideal of…

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Over an algebraically closed field, we describe the affine varieties of solutions to the linear equations $a(xb)=c$ and $a(bx)=c$ over the split-octonions. We also determine the dimensions of the solution sets of arbitrary linear monomial…

We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of…

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…

In this paper, following [6], we continue to develop the perturbing method of constructing logarithmic series solutions to a regular A-hypergeometric system. Fixing a fake exponent of an A-hypergeometric system, we consider some spaces of…

The classical sharp threshold theorem of Friedgut and Kalai (1996) asserts that any symmetric monotone function $f:\{0,1\}^{n}\to\{0,1\}$ exhibits a sharp threshold phenomenon. This means that the expectation of $f$ with respect to the…

The celebrated Zariski Cancellation Problem asks as to when the existence of an isomorphism $X\times\mathbb{A}^n\cong X'\times\mathbb{A}^n$ for (affine) algebraic varieties $X$ and $X'$ implies that $X\cong X'$. In this paper we provide a…

Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quantum cryptography. Solving polynomial systems is also one of…

The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…