中文
相关论文

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

200 篇论文

The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of…

组合数学 · 数学 2017-11-28 Christian J. J. Despres

In this article, we present what we believe to be a simple way to motivate the use of Hilbert spaces in quantum mechanics. To achieve this, we study the way the notion of dimension can, at a very primitive level, be defined as the…

量子物理 · 物理学 2014-03-27 Olivier Brunet

Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…

For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground…

组合数学 · 数学 2017-01-06 Ron Aharoni , Eli Berger , Dani Kotlar , Ran Ziv

We introduce matrix algebra of subsets in metric spaces and we apply it to improve results of Yamauchi and Davila regarding Asymptotic Property C. Here is a representative result: Suppose $X$ is an $\infty$-pseudo-metric space and $n\ge 0$…

度量几何 · 数学 2017-12-19 Jerzy Dydak

Here we prove that the homological dimension of the category of sheaves on a topological space satisfying some suitable conditions is finite. In particular, we find conditions to bound the homological dimension of o-minimal and subanalytic…

代数几何 · 数学 2010-10-07 Luca Prelli

As a direct application of Dilworth truncations of polymatroids, we give short proofs of two theorems: Bernstein's characterisation of algebraic matroids coming from the Hadamard product of two linear spaces, and a formula for the dimension…

组合数学 · 数学 2025-08-08 Dario Antolini , Sean Dewar , Shin-ichi Tanigawa

In a seminal work, Micciancio & Voulgaris (2013) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus…

数据结构与算法 · 计算机科学 2020-01-08 Christoph Hunkenschröder , Gina Reuland , Matthias Schymura

Let $\mathbb{F}$ be a field, and $n \geq p \geq r>0$ be integers. In a recent article, Rubei has determined, when $\mathbb{F}$ is the field of real numbers, the greatest possible dimension for an affine subspace of $n$--by--$p$ matrices…

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

The coamoeba of any complex algebraic plane curve $V$ is its image in the real torus under the argument map. The area counted with multiplicity of the coamoeba of any algebraic curve in $(\mathbb{C}^*)^2$ is bounded in terms of the degree…

代数几何 · 数学 2008-10-27 Mounir Nisse

Let $\mathbb{F}$ be a field, and $n \geq r>0$ be integers, with $r$ even. Denote by $\mathrm{A}_n(\mathbb{F})$ the space of all $n$-by-$n$ alternating matrices with entries in $\mathbb{F}$. We consider the problem of determining the…

环与代数 · 数学 2023-07-21 Clément de Seguins Pazzis

We prove that the global dimension of the complex algebra of the monoid of all partial functions on an n-set is $n-1$ for all $n\geq 1$. This is also the global dimension of the complex algebra of the category of all epimorphisms between…

表示论 · 数学 2018-10-23 Itamar Stein

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

符号计算 · 计算机科学 2021-06-15 Piere Lairez , Mohab Safey El Din

Let $M$ to be a matroid defined on a finite set $E$ and $L\subset E$. $L$ is locked in $M$ if $M|L$ and $M^*|(E\backslash L)$ are 2-connected, and $min\{r(L), r^*(E\backslash L)\} \geq 2$. In this paper, we prove that the nontrivial facets…

计算复杂性 · 计算机科学 2017-02-24 Brahim Chaourar

In this note, we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover any vector space V over any field. If V is a finite set, this is related to the problem of…

交换代数 · 数学 2015-02-02 Apoorva Khare

Let q be a power of a prime and let V be a vector space of finite dimension n over the field of order q. Let Bil(V) denote the set of all bilinear forms defined on V x V, let Symm(V) denote the subspace of Bil(V) consisting of symmetric…

环与代数 · 数学 2017-03-22 Rod Gow

For a finite vector space $V$ and a non-negative integer $r\le\dim V$ we estimate the smallest possible size of a subset of $V$, containing a translate of every $r$-dimensional subspace. In particular, we show that if $K\subset V$ is the…

数论 · 数学 2010-03-22 Swastik Kopparty , Vsevolod F. Lev , Shubhangi Saraf , Madhu Sudan

We introduce the n-th Heron variety as the realization space of the (squared) volumes of faces of an n-simplex. Our primary goal is to understand the extent to which Heron's formula, which expresses the area of a triangle as a function of…

代数几何 · 数学 2024-04-30 Seth K. Asante , Taylor Brysiewicz , Michelle Hatzel

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

组合数学 · 数学 2021-08-19 Shalom Eliahou , Cédric Lecouvey

Attribute reduction is a basic issue in knowledge representation and data mining. Rough sets provide a theoretical foundation for the issue. Matroids generalized from matrices have been widely used in many fields, particularly greedy…

人工智能 · 计算机科学 2015-03-06 Aiping Huang , William Zhu