Related papers: An algorithm for the HK function for disjoint-term…

Let $R$ be the face ring of a simplicial complex of dimension $d-1$ and ${\mathcal R}(\mathfrak{n})$ be the Rees algebra of the maximal homogeneous ideal $\mathfrak{n}$ of $R.$ We show that the generalized Hilbert-Kunz function…

For a toric pair $(X, D)$, where $X$ is a projective toric variety of dimension $d-1\geq 1$ and $D$ is a very ample $T$-Cartier divisor, we show that the Hilbert-Kunz density function $HKd(X, D)(\lambda)$ is the $d-1$ dimensional volume of…

We will extend the Fourier restriction inequality for quadratic hypersurfaces obtained by Strichartz. We will consider the case where the hypersurface is a graph of a certain real polynomial which is a sum of one-dimensional monomials. It…

Several expansions of the solutions of the double-confluent Heun equation in terms of the Kummer confluent hypergeometric functions are presented. Three different sets of these functions are examined. Discussing the expansions without a…

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…

The simplest and most natural examples of completely nonunitary contractions on separable complex Hilbert spaces which have polynomial characteristic functions are the nilpotent operators. The main purpose of this paper is to prove the…

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…

We enumerate complex algebraic hypersurfaces in $P^n$, of a given (high) degree with one singular point of a given singularity type. Our approach is to compute the (co)homology classes of the corresponding equi-singular strata in the…

A high-order quadrature algorithm is presented for computing integrals over curved surfaces and volumes whose geometry is implicitly defined by the level sets of (one or more) multivariate polynomials. The algorithm recasts the implicitly…

An affine algebraic variety $X$ is rigid if the algebra of regular functions ${\mathbb K}[X]$ admits no nonzero locally nilpotent derivation. We prove that a factorial trinomial hypersurface is rigid if and only if every exponent in the…

For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K. This paper studies the geometry of its boundary. When K=R^n and d is even, we show that its boundary lies on the…

Suppose B=F[x,y,z]/h is the homogeneous coordinate ring of a characteristic p degree 3 irreducible plane curve C with a node. Let J be a homogeneous (x,y,z)-primary ideal and n -> e_n be the Hilbert-Kunz function of B with respect to J. Let…

Let $k[X] = k[x_{i,j}: i = 1,..., m; j = 1,..., n]$ be the polynomial ring in $m n$ variables $x_{i,j}$ over a field $k$ of arbitrary characteristic. Denote by $I_2(X)$ the ideal generated by the $2 \times 2$ minors of the generic $m \times…

The Hilbert-Kunz multiplicity and $F$-signature are important invariants for researchers in commutative algebra and algebraic geometry. We provide software, and describe the automation of a calculation, for the two invariants in the case of…

Reduced modeling in high-dimensional reproducing kernel Hilbert spaces offers the opportunity to approximate efficiently non-linear dynamics. In this work, we devise an algorithm based on low rank constraint optimization and kernel-based…

This paper presents a high-order accurate numerical quadrature algorithm for evaluating integrals over curved surfaces and regions defined implicitly via a level set of a given function restricted to a hyperrectangle. The domain is divided…

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3-colorable, hamiltonian, etc.) if and only…

A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…

We give an algorithm to compute the periods of smooth projective hypersurfaces of any dimension. This is an improvement over existing algorithms which could only compute the periods of plane curves. Our algorithm reduces the evaluation of…

For many fundamental problems in computational topology, such as unknot recognition and $3$-sphere recognition, the existence of a polynomial-time solution remains unknown. A major algorithmic tool behind some of the best known algorithms…