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

We prove that if a linear equation, whose coefficients are continuous rational functions on a nonsingular real algebraic surface, has a continuous solution, then it also has a continuous rational solution. This is known to fail in higher…

We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number…

We consider the formal reduction of a system of linear differential equations and show that, if the system can be block-diagonalised through transformation with a ramified Shearing-transformation and following application of the Splitting…

In this paper, we first show the existence of solutions to the following system of nonlinear equations \begin{eqnarray*}\left\{\begin{array}{l} a_{11}x_1+a_{12}x_2+a_{13}x_3+\cdots+a_{1n}x_{n} =…

Szemer\'edi's regularity lemma is a powerful tool in graph theory. It states that for every large enough graph, there exists a partition of the edge set with bounded size such that most induced subgraphs are quasirandom. When the graph is a…

This paper deals with reduction of non-homogeneous linear systems of first order operator equations with constant coefficients. An equivalent reduced system, consisting of higher order linear operator equations having only one variable and…

The line graph of a graph $G$ is the graph $L(G)$ whose vertex set is the edge set of $G$ and there is an edge between $e,f\in E(G)$ if $e$ and $f$ share an endpoint in $G$. A graph is called line graph if it is a line graph of some graph.…

We study the problem of strongly refuting semirandom $k$-LIN$(\mathbb{F})$ instances: systems of $k$-sparse inhomogeneous linear equations over a finite field $\mathbb{F}$. For the case of $\mathbb{F} = \mathbb{F}_2$, this is the…

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Given a family $\mathcal{F}$ of graphs, a graph is \emph{$\mathcal{F}$-subgraph-free} if it has no subgraph isomorphic to a member of $\mathcal{F}$. We present a fixed-parameter linear-time algorithm that decides whether a planar graph can…

Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…

We show any matrix of rank $r$ over $\mathbb{F}_q$ can have $\leq \binom{r}{k}(q-1)^k$ distinct columns of weight $k$ if $ k \leq O_q(\sqrt{\log r})$ (up to divisibility issues), and $\leq \binom{r}{k}(q-1)^{r-k}$ distinct columns of…

For quantum systems described by finite matrices, linear and affine maps of matrices are shown to provide equivalent descriptions of evolution of density matrices for a subsystem caused by unitary Hamiltonian evolution in a larger system;…

Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…

We derive completeness criteria for sequences of functions of the form $% f(x\lambda_{n})$, where $\lambda_{n}$ is the $nth$ zero of a suitably chosen entire function. Using these criteria, we construct systems of nonorthogonal…

We prove a new `runner removal theorem' for $q$-decomposition numbers of the level 1 Fock space of type $A^{(1)}_{e-1}$, generalising earlier theorems of James--Mathas and the author. By combining this with another theorem relating to the…

We give a Pfaffian system of differential equations annihilating Lauricella's hypergeometric series $F_A(a,b,c;x)$ of $m$-variables. This system is integrable of rank $2^m$. To express the connection form of this system, we make use of the…

The (matricial) solution set of a Linear Matrix Inequality (LMI) is a convex basic non-commutative semi-algebraic set. The main theorem of this paper is a converse, a result which has implications for both semidefinite programming and…