中文
相关论文

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

200 篇论文

This paper has been withdrawn by the author

一般拓扑 · 数学 2015-06-10 Mikołaj Krupski

We consider the functor C that to a unital C*-algebra A assigns the partial order set C(A) of its commutative C*-subalgebras ordered by inclusion. We investigate how some C*-algebraic properties translate under the action of C to…

算子代数 · 数学 2016-10-07 Bert Lindenhovius

We extend the notion of amoeba to holomorphic almost periodic functions in tube domains. In this setting, the order of a function in a connected component of the complement to its amoeba is just the mean motion of this function. We also…

复变函数 · 数学 2007-05-23 S. Favorov

Given a vector space $V$ of homogeneous polynomials of the same degree over an infinite field, consider a generic subspace $W$ of $V$. The main result of this paper is a lower-bound (in general sharp) for the dimensions of the spaces…

交换代数 · 数学 2007-05-23 Fabrizio Zanello

Let $A$ be a simple algebra over a field $F$. Under a mild cardinality assumption on $F$, we determine the greatest possible dimension for an $F$-affine subspace of $A$ that is included in the group of units $A^\times$, and we describe the…

环与代数 · 数学 2026-05-07 Clément de Seguins Pazzis

We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against…

计算复杂性 · 计算机科学 2013-02-15 Mrinal Kumar , Gaurav Maheshwari , Jayalal Sarma M. N

Let $b$ be a symmetric or alternating bilinear form on a finite-dimensional vector space $V$. When the characteristic of the underlying field is not $2$, we determine the greatest dimension for a linear subspace of nilpotent $b$-symmetric…

环与代数 · 数学 2018-04-24 Clément de Seguins Pazzis

We prove in this article that given a linearly concave domain $D$ in the projective space $\Bbb{CP}^{n}$, a 1-dimensional comlex analytic set $V$ in $D$, and a meromorphic 1-form $\phi$ on $V$, $V$ is a subset of an algebraic variety of…

微分几何 · 数学 2010-10-05 Stephane Collion

A step 2 branching decomposition of spaces of homogeneous Hermitian monogenic polynomials in C^n is established with explicit embedding factors in terms of the generalized Jacobi polynomials, which allows for an inductive construction of an…

复变函数 · 数学 2013-05-17 F. Brackx , H. De Schepper , R. Lavicka , V. Soucek

In this sequel to "Foundations of matroids - Part 1", we establish several presentations of the foundation of a matroid in terms of small building blocks. For example, we show that the foundation of a matroid M is the colimit of the…

组合数学 · 数学 2024-07-31 Matthew Baker , Oliver Lorscheid , Tianyi Zhang

We prove that the expected area of the amoeba of a complex plane curve of degree $d$ is less than $\displaystyle{3\ln(d)^2/2+9\ln(d)+9}$ and once rescaled by $\ln(d)^2$, is asymptotically bounded from below by $3/4$. In order to get this…

代数几何 · 数学 2024-03-04 Ali Ulaş Özgür Kişisel , Jean-Yves Welschinger

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

度量几何 · 数学 2015-03-24 Alexander Koldobsky

Let $G$ be a matrix and $M(G)$ be the matroid defined by linear dependence on the set $E$ of column vectors of $G.$ Roughly speaking, a parcel is a subset of pairs $(f,g)$ of functions defined on $E$ to an Abelian group $A$ satisfying a…

组合数学 · 数学 2011-12-06 Joseph P. S. Kung

We provide a formula and a generating function for the dimension of the vector space of relative symmetric polynomials of D_n for all its irreducible one-dimensional and two-dimensional representations which were defined originally by M.…

交换代数 · 数学 2017-12-14 S. Radha , P. Vanchinathan

We investigate an approach to matroid complexity that involves describing a matroid via a list of independent sets, bases, circuits, or some other family of subsets of the ground set. The computational complexity of algorithmic problems…

组合数学 · 数学 2007-09-10 Dillon Mayhew

The simple cubic lattice defines a set of points at regular distances. The volume of the Voronoi cells around each point may serve as a weight for integration over the entire space. We add interstitial points to this grid according to the…

度量几何 · 数学 2013-09-17 Richard J. Mathar

K be a field and let m and n be positive integers, where m does not exceed n. We say that a non-zero subspace of m x n matrices over K is a constant rank r subspace if each non-zero element of the subspace has rank r, where r is a positive…

环与代数 · 数学 2015-01-13 Rod Gow

A flat cover is a collection of flats identifying the non-bases of a matroid. We introduce the notion of cover complexity, the minimal size of such a flat cover, as a measure for the complexity of a matroid, and present bounds on the number…

组合数学 · 数学 2013-03-01 R. A. Pendavingh , J. G. van der Pol

We show that Bowen's equation, which characterises the Hausdorff dimension of certain sets in terms of the topological pressure of an expanding conformal map, applies in greater generality than has been heretofore established. In…

动力系统 · 数学 2011-07-15 Vaughn Climenhaga

The Cantor-Bendixson rank of a topological space X is a measure of the complexity of the topology of X. The Cantor-Bendixson rank is most interesting when the space is profinite: Hausdorff, compact and totally disconnected. We will see that…

代数拓扑 · 数学 2018-06-28 Danny Sugrue