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

Recent work of Gowers and Nagle, R\"odl, Schacht, and Skokan has established a hypergraph removal lemma, which in turn implies some results of Szemer\'edi and Furstenberg-Katznelson concerning one-dimensional and multi-dimensional…

Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…

Finite difference schemes are here solved by means of a linear matrix equation. The theoretical study of the related algebraic system is exposed, and enables us to minimize the error due to a finite difference approximation.

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

We study $t$-designs of parameters $(n,k,\lambda)$ over finite fields as group divisible designs and set systems admitting a transitive action of a linear group encoded in an hypergraph $G$ whose vertex set of size $n$ is partitioned into…

A new version of Farkas lemma of alternative linear systems is proposed. One and the same matrix $A$ and vector $b$ have always been used in alternative linear systems. The paper shows a different way of alternative systems involving…

We study the best approximation problem: \[ \displaystyle \min_{\alpha\in \mathbb R^m}\max_{1\leq i\leq n}\left|y_i -\sum_{j=1}^m \alpha_j \Gamma_j ({\bf x}_i) \right|. \] Here: $\Gamma:=\left\{\Gamma_1,...,\Gamma_m\right\}$ is a list of…

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical…

In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…

Building on work of Kuhlmann and Lisinski, we study the theory of the Hahn series field $\mathbb{F}_{q}(\!(\mathbb{Q})\!)$, over a finite field $\mathbb{F}_{q}$, equipped with the $t$-adic valuation, in a language of valued fields. We prove…

We use the "closed point sieve" to prove a variant of a Bertini theorem over finite fields. Specifically, given a smooth quasi-projective subscheme X of P^n of dimension m over F_q, and a closed subscheme Z in P^n such that Z intersect X is…

We present a complete algorithm that computes all hypergeometric solutions of homogeneous linear difference equations and rational solutions of parameterized linear difference equations in the setting of $\Pi\Sigma^*$-fields. More…

A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…

This paper considers the problem of testing whether there exists a non-negative solution to a possibly under-determined system of linear equations with known coefficients. This hypothesis testing problem arises naturally in a number of…

The Cancellation Problem for Affine Spaces is settled affirmatively, that is, it is proved that : Let $ k $ be an algebraically closed field of characteristic zero and let $n, m \in \mathbb{N}$. If $R[Y_1,..., Y_m] \cong_k k[X_1,...,…

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

If an Fq-linear set LU in a projective space is defined by a vector subspace U which is linear over a proper superfield of Fq, then all of its points have weight at least 2. It is known that the converse of this statement holds for linear…

The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…

We consider the linear vector space formed by the elements of the finite fields $\mathbb{F}_q$ with $q=p^r$ over $\mathbb{F}_p$. Let ${a_1,\ldots,a_r}$ be a basis of this space. Then the elements $x$ of $\mathbb{F}_q$ have a unique…

Using a generalization of forward elimination, it is proved that functions $f_1,...,f_n:X\to\mathbb{A}$, where $\mathbb{A}$ is a field, are linearly independent if and only if there exists a nonsingular matrix $[f_i(x_j)]$ of size $n$,…