English
Related papers

Related papers: An algorithm to compute the Hilbert depth

200 papers

We develop a new algorithm to compute a basis for $M_k(\Gamma_0(N))$, the space of weight $k$ holomorphic modular forms on $\Gamma_0(N)$, in the case when the graded algebra of modular forms over $\Gamma_0(N)$ is generated at weight two.…

Number Theory · Mathematics 2017-09-25 Michael Lam , Noah McClelland , Matthew Petty , John Webb

We compute the cohomology of modules over the algebra of twisted chiral differential operators over the flag manifold. This is applied to (1) finding the character of $G$-integrable irreducible highest weight modules over the affine Lie…

Algebraic Geometry · Mathematics 2011-12-13 T. Arakawa , F. Malikov

In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…

Algebraic Geometry · Mathematics 2012-02-21 Paolo Lella

In this paper, we construct some maps related to the motivic Galois action on depth-graded motivic multiple zeta values. And from these maps we give some short exact sequences about depth-graded motivic multiple zeta values in depth two and…

Number Theory · Mathematics 2018-08-14 Jiangtao Li

The authors have recently shown how direct limits of Hilbert spaces can be used to construct multi-resolution analyses and wavelets in $L^2(\R)$. Here they investigate similar constructions in the context of Hilbert modules over…

Operator Algebras · Mathematics 2007-05-23 Nadia S. Larsen , Iain Raeburn

We prove some new evaluations for multiple polylogarithms of arbitrary depth. The simplest of our results is a multiple zeta evaluation one order of complexity beyond the well-known Broadhurst-Zagier formula. Other results we provide settle…

Classical Analysis and ODEs · Mathematics 2007-06-13 Douglas Bowman , David M. Bradley

In this note, a general version of Bessel multipliers in Hilbert $C^*$-modules is presented and then, many results obtained for multipliers are extended. Also the conditions for invertibility of generalized multipliers are investigated in…

Operator Algebras · Mathematics 2018-02-07 Gholamreza Abbaspour Tabadkan , Hessam Hossein-nezhad

Let D be a division algebra over a base field k. The homological transcendence degree of D, denoted by Htr D, is defined to be the injective dimension of the enveloping algebra of D. We show that Htr has several useful properties which the…

Rings and Algebras · Mathematics 2007-05-23 Amnon Yekutieli , James J. Zhang

We introduce and analyze a new geometric structure on topological surfaces generalizing the complex structure. To define this so called higher complex structure we use the punctual Hilbert scheme of the plane. The moduli space of higher…

Differential Geometry · Mathematics 2025-07-08 Vladimir V. Fock , Alexander Thomas

We study direct sum decompositions of modules satisfying the descending chain condition on direct summands. We call modules satisfying this condition Krull-Schmidt artinian. We prove that all direct sum decompositions of Krull-Schmidt…

Rings and Algebras · Mathematics 2014-03-21 Juan Orendain

We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…

Number Theory · Mathematics 2008-02-08 Juliana Belding , Reinier Bröker , Andreas Enge , Kristin Lauter

We present a method for calculating any (nested) harmonic sum to arbitrary accuracy for all complex values of the argument. The method utilizes the relation between harmonic sums and (derivatives of) Hurwitz zeta functions, which allows a…

High Energy Physics - Phenomenology · Physics 2010-04-21 S. Albino

Among their competitors, projection depth and its induced estimators are very favorable because they can enjoy very high breakdown point robustness without having to pay the price of low efficiency, meanwhile providing a promising…

Computation · Statistics 2011-12-30 Xiaohui Liu , Yijun Zuo , Zhizhong Wang

A new depth-based clustering procedure for directional data is proposed. Such method is fully non-parametric and has the advantages to be flexible and applicable even in high dimensions when a suitable notion of depth is adopted. The…

Methodology · Statistics 2022-06-22 Giuseppe Pandolfo , Antonio D'ambrosio

The computational complexity of some depths that satisfy the projection property, such as the halfspace depth or the projection depth, is known to be high, especially for data of higher dimensionality. In such scenarios, the exact depth is…

Statistics Theory · Mathematics 2021-05-28 Stanislav Nagy , Rainer Dyckerhoff , Pavlo Mozharovskyi

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…

Computational Geometry · Computer Science 2015-06-17 Vincent Delos , Denis Teissandier

Lie algebras formed via semi-direct sums of the Witt algebra $\text{Der}(\mathbb{C}[t,t^{-1}])$ and its modules have become increasingly prominent in both physics and mathematics in recent years. In this paper, we complete the study of…

Rings and Algebras · Mathematics 2025-11-03 Lucas Buzaglo , Girish S. Vishwa

Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that the character of…

Representation Theory · Mathematics 2018-03-20 Jorgen Rasmussen

We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…

Metric Geometry · Mathematics 2025-07-11 Egor Bakaev , Florestan Brunck , Amir Yehudayoff

Elliptic curves with a known number of points over a given prime field with n elements are often needed for use in cryptography. In the context of primality proving, Atkin and Morain suggested the use of the theory of complex multiplication…

Number Theory · Mathematics 2007-07-16 Amod Agashe , Kristin Lauter , Ramarathnam Venkatesan