English
Related papers

Related papers: An algorithm for computing the multigraded Hilbert…

200 papers

In this article we show how to compute a matrix representation and the implicit equation by means of the method developed in [Botbol: arXiv:1007.3437], using the computer algebra system Macaulay2 \cite{M2}. As it is probably the most…

Algebraic Geometry · Mathematics 2010-07-22 Nicolas Botbol

We study the Stanley depth and the Hilbert depth for $I$ and $S/I$, where $I\subset S=K[x_1,\ldots,x_N]$ is the intersection of monomial prime ideals with disjoint sets of variables. As an application, we obtain bounds for the Stanley depth…

Commutative Algebra · Mathematics 2024-07-10 Silviu Balanescu , Mircea Cimpoeas

Hamiltonian Monte Carlo is a widely used algorithm for sampling from posterior distributions of complex Bayesian models. It can efficiently explore high-dimensional parameter spaces guided by simulated Hamiltonian flows. However, the…

Computation · Statistics 2019-04-29 Lingge Li , Andrew Holbrook , Babak Shahbaba , Pierre Baldi

We exhibit algorithms to compute systems of Hecke eigenvalues for spaces of Hilbert modular forms over a totally real field. We provide many explicit examples as well as applications to modularity and Galois representations.

Number Theory · Mathematics 2011-04-18 Lassina Dembele , John Voight

One standard approach to compute the Hilbert function of any graded module over a field is to come up with a free-resolution for the graded module and another is via a Hilbert power series which serves as a generating function. The proposed…

Rings and Algebras · Mathematics 2018-12-06 Maria Barouti

Let $h:\mathbb Z \to \mathbb Z_{\geq 0}$ be a nonzero function with $h(k)=0$ for $k\ll 0$. We define the Hilbert depth of $h$ by $\operatorname{hdepth}(h)=\max\{d\;:\; \sum_{j\leq k} (-1)^{k-j}\binom{d-j}{k-j}h(j)\geq 0\text{ for all }k\leq…

Number Theory · Mathematics 2024-02-20 Silviu Balanescu , Mircea Cimpoeas

Given an approximation to a multiple isolated solution of a polynomial system of equations, we have provided a symbolic-numeric deflation algorithm to restore the quadratic convergence of Newton's method. Using first-order derivatives of…

Numerical Analysis · Mathematics 2007-05-23 Anton Leykin , Jan Verschelde , Ailing Zhao

An efficient hybrid numerical method for multiple scattering calculations is proposed. We use the well established doubling--adding method to find the reflection function of the lowermost homogeneous slab comprising the atmosphere of our…

Instrumentation and Methods for Astrophysics · Physics 2016-11-04 Kiyoshi Kawabata

Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows…

Optimization and Control · Mathematics 2025-06-06 N. V. Pletnev

Scientific studies often require the precise calculation of derivatives. In many cases an analytical calculation is not feasible and one resorts to evaluating derivatives numerically. These are error-prone, especially for higher-order…

High Energy Physics - Phenomenology · Physics 2010-05-28 Mathias Wagner , Andrea Walther , Bernd-Jochen Schaefer

Hierarchical decision making problems, such as bilevel programs and Stackelberg games, are attracting increasing interest in both the engineering and machine learning communities. Yet, existing solution methods lack either convergence…

Optimization and Control · Mathematics 2024-03-29 Panagiotis D. Grontas , Giuseppe Belgioioso , Carlo Cenedese , Marta Fochesato , John Lygeros , Florian Dörfler

$\newcommand{\floor}[1]{\left\lfloor {#1} \right\rfloor} \renewcommand{\Re}{\mathbb{R}}$ Tverberg's theorem states that a set of $n$ points in $\Re^d$ can be partitioned into $\floor{n/(d+1)}$ sets with a common intersection. A point in…

Computational Geometry · Computer Science 2023-05-03 Sariel Har-Peled , Timothy Zhou

A notion of curvature is introduced in multivariable operator theory and an analogue of the Gauss-Bonnet-Chern theorem is established for graded (contractive) Hilbert modules over the complex polynomial algebra in d variables, d=1,2,3,....…

Operator Algebras · Mathematics 2007-05-23 William Arveson

It is shown that the methods and algorithms, developed in (A. Capani et al., Computing minimal finite free resolutions, {\it Journal of Pure and Applied Algebra}, (117& 118)(1997), 105 -- 117; M. Kreuzer and L. Robbiano, {\it Computational…

Rings and Algebras · Mathematics 2015-06-22 Huishi Li

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

Commutative Algebra · Mathematics 2007-05-23 Winfried Bruns , Bogdan Ichim

One approach to multivariate operator theory involves concepts and techniques from algebraic and complex geometry and is formulated in terms of Hilbert modules. In these notes we provide an introduction to this approach including many…

Functional Analysis · Mathematics 2007-11-28 Ronald G. Douglas

Halfspace (or Tukey) depth is a fundamental and robust measure of centrality of data points in multivariate datasets. Computing the depth of a point with respect to the uniform distribution on an open convex body in $\mathbb{R}^d$ is a…

Computational Geometry · Computer Science 2025-07-17 Purvi Gupta , Anant Narayanan

This paper is a survey on major results on Hilbert functions of multigraded algebras and mixed multiplicities of ideals, including their applications to the computation of Milnor numbers of complex analytic hypersurfaces with isolated…

Commutative Algebra · Mathematics 2008-02-19 N. V. Trung , J. K. Verma

In this work, we propose a multi-stage training strategy for the development of deep learning algorithms applied to problems with multiscale features. Each stage of the pro-posed strategy shares an (almost) identical network structure and…

Numerical Analysis · Mathematics 2020-09-25 Eric Chung , Wing Tat Leung , Sai-Mang Pun , Zecheng Zhang

We present a quantum algorithm for multiplying two $n$-bit integers with overall circuit depth and $T$-depth both bounded by $O(\log^{2} n)$, while using $O(n^{2})$ gates and ancillary qubits. Our construction generates partial products via…

Quantum Physics · Physics 2026-04-14 Fred Sun , Anton Borissov
‹ Prev 1 4 5 6 7 8 10 Next ›