Related papers: Partial elimination ideals and secant cones

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

We prove a triangulation theorem for semi-algebraic sets over a p-adically closed field, quite similar to its real counterpart. We derive from it several applications like the existence of flexible retractions and splitting for…

We first study Clarke's tangent cones at infinity to unbounded subsets of $\mathbb{R}^n.$ We prove that these cones are closed convex and show a characterization of their interiors. We then study subgradients at infinity for extended real…

In this paper we shall consider the Lie algebra of column-finite infinite matrices indexed by positive integers $\mathbb{N}$, describe the lattice of its ideals for arbitrary field $K$ and study its derivations over any commutative, unital…

In this article we introduce generalized projective spaces (Definitions $[2.1, 2.5]$) and prove three main theorems in two different contexts. In the first context we prove, in main Theorem $A$, the surjectivity of the Chinese remainder…

The paper addresses the $k$-tangle enumeration problem. We introduce a notion of cascade diagram for $k$-tangle projections. An effective enumeration algorithm for projections is proposed based on cascade representation. Tangles projections…

We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. POCKA enables reasoning about programs that can access…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

Let X be a smooth hypersurface of degree d in P^n over an algebraically closed field of characteristic p. We show that X must be separably rationally connected and must contain a free line if either p is at least d or if p is at least d-1…

We study the problem of finding neck-like features on a surface. Applications for such cuts include robotics, mesh segmentation, and algorithmic applications. We provide a new definition for a surface bottleneck -- informally, it is the…

A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…

Cohen Macaulay property of fiber cones of ideals is characterized in terms of its Hilbert series. Hilbert series of fiber cones of ideals with minimal mixed multiplicity is calculated. It is proved that the fiber cone of an m-primary ideal…

We examine two natural operations to create numerical semigroups. We say that a numerical semigroup $\mathcal{S}$ is $k$-normalescent if it is the projection of the set of integer points in a $k$-dimensional polyhedral cone, and we say that…

For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…

We give a new proof of the Semistable Reduction Theorem for curves. The main idea is to present a curve $Y$ over a local field $K$ as a finite cover of the projective line $X=\PP^1_K$. By successive blowups (and after replacing $K$ by a…

Let X be a normal projective variety admitting an action of a semisimple group with a unique closed orbit. We construct finitely many rational curves in X, all having a common point, such that every effective one-cycle on X is rationally…

The Boij-S\"oderberg characterization decomposes a Betti table into a unique positive integral linear combination of pure diagrams. Given a module with a pure resolution, we describe explicit formulae for computing the decomposition of the…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…

Let $G$ be the general linear group of the degree $n\geq 2$ over the field $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$. In this article, we give a description of orbit decomposition of the multiple projective space $G^m/P^m$ under the diagonal…