Related papers: Segre-Driven Radicality Testing

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Let I be a homogeneous ideal of a polynomial ring S. We prove that if the initial ideal J of I, w.r.t. a term order on S, is square-free, then the extremal Betti numbers of S/I and of S/J coincide. In particular, depth(S/I)=depth(S/J) and…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

We propose a method called ideal regression for approximating an arbitrary system of polynomial equations by a system of a particular type. Using techniques from approximate computational algebraic geometry, we show how we can solve ideal…

Consider a large social network with possibly severe degree heterogeneity and mixed-memberships. We are interested in testing whether the network has only one community or there are more than one communities. The problem is known to be…

We present the first algorithm for computing class groups and unit groups of arbitrary number fields that provably runs in probabilistic subexponential time, assuming the Extended Riemann Hypothesis (ERH). Previous subexponential algorithms…

We consider random $n\times n$ matrices $X$ with independent and centered entries and a general variance profile. We show that the spectral radius of $X$ converges with very high probability to the square root of the spectral radius of the…

We improve the complex number identity proving method to a fully automated procedure, based on elimination ideals. By using declarative equations or rewriting each real-relational hypothesis $h_i$ to $h_i-r_i$, and the thesis $t$ to $t-r$,…

Model selection is a cornerstone of statistical inference, where information criteria are widely employed to balance model fit and complexity. However, classical likelihood-based criteria are often highly sensitive to contamination,…

Let I be an ideal of height two in R=k[x_0,x_1] generated by forms of the same degree, and let K be the ideal of defining equations of the Rees algebra of I. Suppose that the second largest column degree in the syzygy matrix of I is e. We…

Testing whether a set $\mathbf{f}$ of polynomials has an algebraic dependence is a basic problem with several applications. The polynomials are given as algebraic circuits. Algebraic independence testing question is wide open over finite…

Let $K$ be a field, $S$ a polynomial ring and $E$ an exterior algebra over $K$, both in a finite set of variables. We study rigidity properties of the graded Betti numbers of graded ideals in $S$ and $E$ when passing to their generic…

We present several results on the complexity of various forms of Sperner's Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity…

The ideal of a Segre variety is generated by the 2-minors of a generic hypermatrix of indeterminates. We extend this result to the case of Segre-Veronese varieties. The main tool is the concept of weak generic hypermatrix which allows us to…

Let $K$ be a field and $X$, $Y$ denote matrices such that, the entries of $X$ are either indeterminates over $K$ or $0$ and the entries of $Y$ are indeterminates over $K$ which are different from those appearing in $X$. We consider ideals…

R. Hartshorne conjectured and F. Zak proved that any n-dimensional smooth non-degenerate complex algebraic variety X in a m-dimensional projective space P satisfies Sec(X)=P if m<3n/2+2. In this article, I deal with the limiting case of…

A preferential domain is a collection of sets of preferences which are linear orders over a set of alternatives. These domains have been studied extensively in social choice theory due to both its practical importance and theoretical…

This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly…

In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…

This paper studies the complexity of determining whether a formula in the modal logics characterizing the nested-simulation semantics is characteristic for some process, which is equivalent to determining whether the formula is satisfiable…