相关论文: The amoeba dimension of a linear space

Let V be a vector space of dimension n over the finite field F_q, where q is odd, and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. We investigate constant rank r subspaces of Symm(V) in this paper. We have…

The main aim of this paper is to generalize the concept of vector space by the hyperstructure. We generalize some definitions such as hypersubspaces, linear combination, Hamel basis, linearly dependence and linearly independence. A few…

Given $E \subset {\Bbb R}^d$, define the \emph{volume set} of $E$, ${\mathcal V}(E)= \{det(x^1, x^2, ... x^d): x^j \in E\}$. In $\R^3$, we prove that ${\mathcal V}(E)$ has positive Lebesgue measure if either the Hausdorff dimension of…

To any algebraic curve A in a complex 2-torus $(\C^*)^2$ one may associate a closed infinite region in a real plane called the amoeba of A. The amoebas of different curves of the same degree come in different shapes and sizes. All amoebas…

Seymour's decomposition theorem for regular matroids is a fundamental result with a number of combinatorial and algorithmic applications. In this work we demonstrate how this theorem can be used in the design of parameterized algorithms on…

We develop a theory of BV and Sobolev Spaces via integration by parts formula in abstract metric spaces; the role of vector fields is played by Weaver's metric derivations. The definition hereby given is shown to be equivalent to many…

In this work, we find base and dimension of a subspace appeared in works by V. A. Sharafutdinov. The same problem, but expressed in terms of polynomials from matrix minors, was initially solved by W. Hodge. The new result of this paper is…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

The {\em Dressian} of a matroid $M$ is the set of all valuations of $M$. This Dressian is the support of a polyhedral complex $\mathcal{Dr}(M)$ whose open cells correspond 1-1 with matroid subdivisions of the matroid polytope of $M$. We…

We study amoebas of exponential sums as functions of the support set $A$. To any amoeba, we associate a set of approximating sections of amoebas, which we call caissons. We show that a bounded modular lattice of subspaces of a certain…

The standard definition of the dimension of a vector space or rank of a module states that dimension or rank is equal to the cardinality of any basis, which requires an understanding of the concepts of basis, generating set, and linear…

We consider the vector space of globally differentiable piecewise polynomial functions defined on a three-dimensional polyhedral domain partitioned into tetrahedra. We prove new lower and upper bounds on the dimension of this space by…

In this Note we show that the notion of a basis of a finite-dimensional vector space could be introduced by an argument much weaker than Gauss' reduction method. Our aim is to give a short proof of a simply formulated lemma, which in fact…

Let $A$ and $B$ two $F_q$-subspaces of a finite field, of the same size, and let $A^{-1}$ denote the set of inverses of the nonzero elements of $A$. Mattarei proved that $A^{-1}$ can only be contained in $A$ if either $A$ is a subfield, or…

The paper addresses matrix spaces, whose properties and dynamics are determined by Dirac matrices in Riemannian spaces of different dimension and signature. Among all Dirac matrix systems there are such ones, which nontrivial scalar, vector…

We explore a combinatorial theory of linear dependency in complex space, "complex matroids", with foundations analogous to those for oriented matroids. We give multiple equivalent axiomatizations of complex matroids, showing that this…

The VC-dimension is a well-studied and fundamental complexity measure of a set system (or hypergraph) that is central to many areas of machine learning. We establish several new results on the complexity of computing the VC-dimension. In…

We introduce a new width parameter for matroids called decomposition width and prove that every matroid property expressible in the monadic second order logic can be computed in linear time for matroids with bounded decomposition width if…

Let $\mathbb V$ be an arbitrary linear space and $f:\mathbb V \times \ldots \times \mathbb V \to \mathbb V$ an $n$-linear map. It is proved that, for each choice of a basis ${\mathcal B}$ of $\mathbb V$, the $n$-linear map $f$ induces a…

Let ${\mathbb V}$ be an $n$-dimensional linear space over an algebraically closed base field. We provide a classification, up to equivalence, of all of the bilinear maps $f:{\mathbb V} \times {\mathbb V} \to {\mathbb V}$ such that…