Related papers: F-pure thresholds of binomial hypersurfaces

We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…

We initiate a classification of complex polynomials f of degree d having the top Betti number of the general fibre close to the maximum. We find a range in which the polynomial must have isolated singularities and another range where it may…

For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

Let X be a smooth hypersurface in projective space. We discuss in this paper when X can be defined by an equation det M = 0 (resp. pf M = 0), where M is a matrix (resp. a skew-symmetric matrix) with homogeneous entries. Standard homological…

In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…

We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that…

We study automorphisms of quasi-smooth hypersurfaces in weighted projective spaces, extending classical results for smooth hypersurfaces in projective space to the weighted setting. We establish effective criteria for when a power of a…

In this paper, we introduce the partial-dual polynomial for hypermaps, extending the concept from ribbon graphs. We discuss the basic properties of this polynomial and characterize it for hypermaps with exactly one hypervertex containing a…

We consider polynomials on the intersection of the closed positive orthant with the height-$1$ level hypersurface of certain polynomials with positive coefficients. We show that any polynomial strictly positive on such a semi-algebraic set…

In this paper we propose and prove an explicit formula for computing the degree of Fano schemes of linear subspaces on general hypersurfaces. The method used here is based on the localization theorem and Bott's residue formula in…

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements, where $q$ is a power of prime $p$. A polynomial over $\mathbb{F}_{q}$ is square-free if all its monomials are square-free. In this note, we determine an upper bound on the number of…

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…

We determine the basepoint-freeness threshold of a very general polarized abelian surface over the field of complex numbers. We also give the first example of a polarized abelian surface whose basepoint-freeness threshold is irrational.

Linear error-correcting codes can be used for constructing secret sharing schemes; however finding in general the access structures of these secret sharing schemes and, in particular, determining efficient access structures is difficult.…

In this note, we shall provide several properties of hypergeometric Bernoulli numbers and polynomials, including sums of products identity, differential equations and recurrence formulas.

We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…

For an embedding of sufficiently high degree of a smooth projective variety X into projective space, we use residues to define a filtered holonomic D-module (M, F) on the dual projective space. This gives a concrete description of the…

A metric probability space $M$ admits thresholds if the random geometric graph on $M$ has a threshold for every monotone graph property. We connect the existence of thresholds to the uniform expansion of $M$ and prove that all standard…