English
Related papers

Related papers: Partial elimination ideals and secant cones

200 papers

In this paper, we consider a well-known sparse optimization problem that aims to find a sparse solution of a possibly noisy underdetermined system of linear equations. Mathematically, it can be modeled in a unified manner by minimizing…

Optimization and Control · Mathematics 2021-10-01 Lei Yang , Xiaojun Chen , Shuhuang Xiang

We consider a modification of the Quantifier Elimination (QE) problem called Partial QE (PQE). In PQE, only a small part of the formula is taken out of the scope of quantifiers. The appeal of PQE is that many verification problems, e.g.…

Logic in Computer Science · Computer Science 2019-07-16 Eugene Goldberg

Fiber cones of 0-dimensional ideals with almost minimal multiplicity in Cohen-Macaulay local rings are studied. Ratliff-Rush closure of filtration of ideals with respect to another ideal is introduced. This is used to find a bound on the…

Commutative Algebra · Mathematics 2007-05-23 A. V. Jayanthan , J. K. Verma

The main goal of this paper is to study some local and global properties of secant varieties of algebraic curves. These results complement our previous work [8] by addressing issues given therein and providing solutions to problems raised…

Algebraic Geometry · Mathematics 2026-04-30 Lawrence Ein , Wenbo Niu , Jinhyung Park

We study finite $0$-dimensional schemes in product of multiprojective spaces and their ideals. In particular, we describe the set of generators of the ideal defining a $0$-dimensional scheme in the case $\mathbb P^{1}\times\cdots…

Algebraic Geometry · Mathematics 2021-11-15 Edoardo Ballico , Elena Guardo

Let $G$ be a reductive group over a field $k$ which is algebraically closed of characteristic $p \neq 0$. We prove a structure theorem for a class of subgroup schemes of $G$, for $p$ bounded below by the Coxeter number of $G$. As…

Algebraic Geometry · Mathematics 2023-06-22 V. Balaji , P. Deligne , A. J. Parameswaran

The secant method, as an important approach for solving nonlinear equations, is introduced in nearly all numerical analysis textbooks. However, most textbooks only briefly address the Q-order of convergence of this method, with few…

Numerical Analysis · Mathematics 2025-10-16 Yan Tan , Chenhao Ye , Qinghai Zhang , Shubo Zhao

Let $PQC$ stand for the set of all piecewise quasicontionus function on the unit circle, i.e., the smallest closed subalgebra of $L^\infty(\mathbb{T})$ which contains the classes of all piecewise continuous function $PC$ and all…

Functional Analysis · Mathematics 2017-12-06 Torsten Ehrhardt , Zheng Zhou

In this paper we study the problem of how to determine all elliptic curves defined over an arbitrary number field $K$ with good reduction outside a given finite set of primes $S$ of $K$ by solving $S$-unit equations. We give examples of…

Number Theory · Mathematics 2015-11-17 Angelos Koutsianas

Let $E$ be an elliptic curve over $\mathbb{Q}$, $p$ an odd prime number and $n$ a positive integer. In this article, we investigate the ideal class group $\mathrm{Cl}(\mathbb{Q}(E[p^n]))$ of the $p^n$-division field $\mathbb{Q}(E[p^n])$ of…

Number Theory · Mathematics 2024-06-18 Naoto Dainobu

We study the percolation properties of graph partitioning on random regular graphs with N vertices of degree $k$. Optimal graph partitioning is directly related to optimal attack and immunization of complex networks. We find that for any…

Statistical Mechanics · Physics 2007-10-07 Gerald Paul , Reuven Cohen , Sameet Sreenivasan , Shlomo Havlin , H. Eugene Stanley

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota

In this paper we introduce the notion of I-convergence of sequences of k-dimensional subspaces of an inner product space, where I is an ideal of subsets of N, the set of all natural numbers and k in N. We also study some basic properties of…

Functional Analysis · Mathematics 2024-03-22 Prasanta Malik , Saikat Das

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

A projective scheme $X$ is called `quadratic' if $X$ is scheme-theoretically cut out by homogeneous equations of degree 2. Furthermore, we say $X$ satisfies `property $\textbf{N}_{2,p}$' if it is quadratic and the quadratic ideal has only…

Algebraic Geometry · Mathematics 2012-06-12 Kangjin Han , Sijong Kwak

The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.

Formal Languages and Automata Theory · Computer Science 2015-09-02 Eric Rowland , Jeffrey Shallit

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…

Combinatorics · Mathematics 2009-11-10 Rafael D. Sorkin

We give a formula computing the number of one-nodal rational curves that pass through an appropriate collection of constraints in a complex projective space. We combine the methods and results from three different papers.

Algebraic Geometry · Mathematics 2007-05-23 A. Zinger

The infinite pigeonhole principle for 2-partitions ($\mathsf{RT}^1_2$) asserts the existence, for every set $A$, of an infinite subset of $A$ or of its complement. In this paper, we study the infinite pigeonhole principle from a…

Logic · Mathematics 2020-09-21 Benoit Monin , Ludovic Patey

Earlier, we introduced Partial Quantifier Elimination (PQE). It is a $\mathit{generalization}$ of regular quantifier elimination where one can take a $\mathit{part}$ of the formula out of the scope of quantifiers. We apply PQE to CNF…

Logic in Computer Science · Computer Science 2024-07-16 Eugene Goldberg