Related papers: Segre-Driven Radicality Testing

We study a general stochastic probing problem defined on a universe V, where each element e in V is "active" independently with probability p_e. Elements have weights {w_e} and the goal is to maximize the weight of a chosen subset S of…

Let $R=k[x_1, ..., x_n]/(x_1^d + ... + x_n^d)$, where $k$ is a field of characteristic $p$, $p$ does not divide $d$ and $n \geq 3$. We describe a method for computing the test ideal for these diagonal hypersurface rings. This method…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "typical" sequence of polynomials. We consider various types of "nice" varieties: set-theoretic and ideal-theoretic complete intersections,…

Let $G$ be a complex reductive group and $\mathcal{X}_{r}G$ denote the $G$-character variety of the free group of rank $r$. Using geometric methods, we prove that $E(\mathcal{X}_{r}SL_{n})=E(\mathcal{X}_{r}PGL_{n})$, for any…

We study multivariate Gaussian models that are described by linear conditions on the concentration matrix. We compute the maximum likelihood (ML) degrees of these models. That is, we count the critical points of the likelihood function over…

We study syzygies of the Segre embedding of P(V_1) x ... x P(V_n), and prove two finiteness results. First, for fixed p but varying n and V_i, there is a finite list of "master p-syzygies" from which all other p-syzygies can be derived by…

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

Let $X$ be an uncountable Polish space and let $\mathcal{I}$ be an ideal on $\omega$. A point $\eta \in X$ is an $\mathcal{I}$-limit point of a sequence $(x_n)$ taking values in $X$ if there exists a subsequence $(x_{k_n})$ convergent to…

We investigate the joint distribution of the vertex degrees in three models of random bipartite graphs. Namely, we can choose each edge with a specified probability, choose a specified number of edges, or specify the vertex degrees in one…

Let $R$ be a finite ring and let $M, N$ be two finite left $R$-modules. We present two distinct deterministic algorithms that decide in polynomial time whether or not $M$ and $N$ are isomorphic, and if they are, exhibit an isomorphism. As…

Let $R=k[x,y,z]$ be a standard graded $3$-variable polynomial ring, where $k$ denotes any field. We study grade $3$ homogeneous ideals $I \subseteq R$ defining compressed rings with socle $k(-s) \oplus k(-2s+1)$, where $s \geq3$ is some…

Testing whether a probability distribution is compatible with a given Bayesian network is a fundamental task in the field of causal inference, where Bayesian networks model causal relations. Here we consider the class of causal structures…

We engineer a new probabilistic Monte-Carlo algorithm for isomorphism testing. Most notably, as opposed to all other solvers, it implicitly exploits the presence of symmetries without explicitly computing them. We provide extensive…

Large-scale simultaneous hypothesis testing appears in many areas such as microarray studies, genome-wide association studies, brain imaging, disease mapping and astronomical surveys. A well-known inference method is to control the false…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

We present a method to compute the degrees of the Segre classes of a subscheme of complex projective space. The method is based on generic residuation and intersection theory. It has been implemented using the software system Macaulay2.

The elements of a finite partial order $P$ can be identified with the maximal indecomposable two-sided ideals of its incidence algebra $\A$, and then for two such ideals, $I\prec J \iff IJ \not=0$. This offers one way to recover a poset…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

The Strong Exponential Time Hypothesis (SETH) is a standard assumption in (fine-grained) parameterized complexity and many tight lower bounds are based on it. We consider a number of reasonable weakenings of the SETH, with sources from (i)…

Let $f_1,...,f_s \in \mathbb{K}[x_1,...,x_m]$ be a system of polynomials generating a zero-dimensional ideal $\I$, where $\mathbb{K}$ is an arbitrary algebraically closed field. Assume that the factor algebra $\A=\mathbb{K}[x_1,...,x_m]/\I$…