English
Related papers

Related papers: Algorithms for Checking Zero-Dimensional Complete …

200 papers

A finite dimensional filiform K-Lie algebra is a nilpotent Lie algebra g whose nil index is maximal, that is equal to dim g -1. We describe necessary and sufficient conditions for a filiform algebra over an algebraically closed field of…

Rings and Algebras · Mathematics 2018-06-21 Elisabeth Remm

A perfect $K_r$-tiling in a graph $G$ is a collection of vertex-disjoint copies of the clique $K_r$ in $G$ covering every vertex of $G$. The famous Hajnal--Szemer\'edi theorem determines the minimum degree threshold for forcing a perfect…

Combinatorics · Mathematics 2020-09-16 József Balogh , Béla Csaba , András Pluhár , Andrew Treglown

A local ring $R$ is regular if and only if every finitely generated $R$-module has finite projective dimension. Moreover, the residue field $k$ is a test module: $R$ is regular if and only if $k$ has finite projective dimension. This…

Commutative Algebra · Mathematics 2021-05-14 Benjamin Briggs , Eloísa Grifo , Josh Pollitz

Let $k$ be an arbitrary field, and C be a curve in A^n defined parametrically by x_1=f_1(t),...,x_n=f_n(t), where f_1,...,f_n\in k[t]. A necessary and sufficient condition for the two function fields k(t) and k(f_1,...,f_n) to be same is…

Algebraic Geometry · Mathematics 2007-05-23 Hyungju Park

The second Veronese ideal $I_n$ contains a natural complete intersection $J_n$ generated by the principal $2$-minors of a symmetric $(n\times n)$-matrix. We determine subintersections of the primary decomposition of $J_n$ where one…

Commutative Algebra · Mathematics 2016-08-12 Thomas Kahle , André Wagner

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebraic Geometry · Mathematics 2019-11-06 Adrien Poteaux , Martin Weimann

Let $A$ be a finite dimensional associative $\mathbb{K}$-algebra over an algebraically closed field $\mathbb{K}$ of characteristic zero. To $A$, we can associate its basic form that is given by a quiver $Q = (Q_0, Q_1)$ with an admissible…

Representation Theory · Mathematics 2023-06-16 Charles Paquette , Deepanshu Prasad , David Wehlau

Many complex multi-target prediction problems that concern large target spaces are characterised by a need for efficient prediction strategies that avoid the computation of predictions for all targets explicitly. Examples of such problems…

Information Retrieval · Computer Science 2018-03-06 Michiel Stock , Krzysztof Dembczynski , Bernard De Baets , Willem Waegeman

We consider the following question, concerning associative algebras R over an algebraically closed field k: When can the space of (equivalence classes of) finite dimensional irreducible representations of R be topologically embedded into a…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

We study the syzygies of a codimension two ideal I = <f_1,f_2,f_3> in k[x,y,z]. Our main result is that the module of syzygies vanishing (scheme-theoretically) at the zero locus Z = V(I) is generated by the Koszul syzygies iff Z is a local…

Algebraic Geometry · Mathematics 2007-05-23 David Cox , Hal Schenck

This work concerns surjective maps $\varphi\colon R\to S$ of commutative noetherian local rings with kernel generated by a regular sequence that is part of a minimal generating set for the maximal ideal of $R$. The main result provides…

Commutative Algebra · Mathematics 2022-08-31 Srikanth B. Iyengar , Janina C. Letz , Jian Liu , Josh Pollitz

We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…

Data Structures and Algorithms · Computer Science 2024-05-02 Katarzyna Paluch , Mateusz Wasylkiewicz

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

Algebraic Geometry · Mathematics 2013-01-22 Na Lei , Xiaopeng Zheng , Yuxue Ren

A complete intersection of n polynomials in n indeterminates has only a finite number of zeros. In this paper we address the following question: how do the zeros change when the coefficients of the polynomials are perturbed? In the first…

Commutative Algebra · Mathematics 2011-02-11 Lorenzo Robbiano , Maria Laura Torrente

We prove a fast computable criterion that expresses non-flatness in terms of torsion: Let R be a regular algebra of finite type over a field K of characteristic zero and let F be a module finitely generated over an R-algebra of finite type.…

Commutative Algebra · Mathematics 2017-09-29 Janusz Adamus , Hadi Seyedinejad

This is my PhD thesis from 2004 under Prof. S.M. Bhatwadekar. Here we answer a question of Nori and prove the following result. Let $A$ be a smooth affine domain of dimension $d$ over an infinite perfect field. Let $I$ be an ideal of $A[T]$…

Commutative Algebra · Mathematics 2014-08-13 M. K. Keshari , S. M. Bhatwadekar

In this paper we extend a result of Cowsik on set-theoretic complete intersection and a result Huneke, Morales and Goto and Nishida about Noetherian symbolic Rees algebras of ideals. As applications, we show that the symbolic Rees algebras…

Commutative Algebra · Mathematics 2022-10-13 Clare D'Cruz , Mousumi Mandal , J. K. Verma

We introduce a class of noncommutatative algebras called representation complete intersections (RCI). A graded associative algebra A is said to be RCI provided there exist arbitrarily large positive integers n such that the scheme Rep_n(A),…

Algebraic Geometry · Mathematics 2007-05-23 Pavel Etingof , Victor Ginzburg

A zero-dimensional polynomial ideal may have a lot of complex zeros. But sometimes, only some of them are needed. In this paper, for a zero-dimensional ideal $I$, we study its complex zeros that locate in another variety $\textbf{V}(J)$…

Symbolic Computation · Computer Science 2014-08-19 Ye Liang

We propose an algorithm based on Newton's method and subdivision for finding all zeros of a polynomial system in a bounded region of the plane. This algorithm can be used to find the intersections between a line and a surface, which has…

Numerical Analysis · Mathematics 2025-10-20 Gun Srijuntongsiri , Stephen A. Vavasis
‹ Prev 1 3 4 5 6 7 10 Next ›