English
Related papers

Related papers: Shattered Sets and the Hilbert Function

200 papers

Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by…

Symbolic Computation · Computer Science 2012-05-03 Paolo Lella

The Hilbert function of standard graded algebras are well understood by Macaulay's theorem and very little is known in the local case, even if we assume that the local ring is a complete intersection. An extension to the power series ring…

Commutative Algebra · Mathematics 2012-05-25 J. Elias , M. E. Rossi , G. Valla

In this paper, we study the structure of set-multilinear arithmetic circuits and set-multilinear branching programs with the aim of showing lower bound results. We define some natural restrictions of these models for which we are able to…

Computational Complexity · Computer Science 2015-11-10 V. Arvind , S. Raja

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

Data Structures and Algorithms · Computer Science 2020-11-25 Roman Galay , Daniil Kalistratov

We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…

Logic · Mathematics 2025-05-06 Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

Classical approach of solvability problem has shed much light on what we can solve and what we cannot solve mathematically. Starting with quadratic equation, we know that we can solve it by the quadratic formula which uses square root.…

Geophysics · Physics 2012-12-07 August Lau , Chuan Yin

In this article we consider a consistent convex feasibility problem in a real Hilbert space defined by a finite family of sets $C_i$. We are interested, in particular, in the case where for each $i$, $C_i=Fix (U_i)=\{z\in \mathcal H\mid…

Optimization and Control · Mathematics 2017-03-29 Victor I. Kolobov , Simeon Reich , Rafał Zalas

Many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy, which leads to the first meaningful stopping criterion for two way spectral partitioning. More…

Numerical Analysis · Computer Science 2016-02-03 James P. Fairbanks , Geoffrey D. Sanders , David A. Bader

Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…

Representation Theory · Mathematics 2015-12-23 Henning Krause

We answer in the negative Siegel's problem for $G$-functions, as formulated by Fischler and Rivoal. Roughly, we prove that there are $G$-functions that cannot be written as polynomial expressions in algebraic pullbacks of hypergeometric…

Number Theory · Mathematics 2025-02-05 Javier Fresán , Yeuk Hay Joshua Lam , Yichen Qin

Let X be a scheme that does not satisfy the valuative criterion of separatedness. We show that the Hilbert functor parametrizing closed families of X that are flat, finite and of rank one is not represented by a scheme or an algebraic…

Algebraic Geometry · Mathematics 2007-05-23 Christian Lundkvist , Roy Skjelnes

Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…

Combinatorics · Mathematics 2025-12-02 Hannah Sheats , Caroline Terry

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…

Optimization and Control · Mathematics 2017-08-01 Jiawang Nie , Jinling Zhao

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

Combinatorics · Mathematics 2014-02-26 Saugata Basu

${ NP}$-complete problem "Hamiltonian cycle"\ for graph $G=(V,E)$ is extended to the "Hamiltonian Complement of the Graph"\ problem of finding the minimal cardinality set $H$ containing additional edges so that graph $G=(V,E\cup H)$ is…

Computational Complexity · Computer Science 2018-08-27 Anatoly Panyukov

We study embeddings and norm estimates for tensor products of weighted reproducing kernel Hilbert spaces. These results lead to a transfer principle that is directly applicable to tractability studies of multivariate problems as integration…

Numerical Analysis · Mathematics 2021-09-21 Michael Gnewuch , Mario Hefter , Aicke Hinrichs , Klaus Ritter

A refined notion of curvature for a linear system of Hermitian vector spaces, in the sense of Grothendieck, leads to the unitary classification of a large class of analytic Hilbert modules. Specifically, we study Hilbert sub-modules, for…

Spectral Theory · Mathematics 2009-09-11 Shibananda Biswas , Gadadhar Misra , Mihai Putinar

Let $V$ be a finite-dimensional representation of the complex circle $\mathbb{C}^\times$ determined by a weight vector $\mathbf{a}\in\mathbb{Z}^n$. We study the Hilbert series $\operatorname{Hilb}_{\mathbf{a}}(t)$ of the graded algebra…

Rings and Algebras · Mathematics 2018-08-28 L. Emily Cowie , Hans-Christian Herbig , Daniel Herden , Christopher Seaton

Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The Hilbert metric is a generalization of…

Computational Geometry · Computer Science 2026-01-21 Aditya Acharya , Auguste H. Gezalyan , David M. Mount

Let $\mathbb{R}$ be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in $\mathbb{R}^n$ given as the vanishing set of a polynomial system. This problem plays an important role…

Computational Geometry · Computer Science 2020-08-27 Huu Phuoc Le , Mohab Safey El Din , Timo de Wolff