vanishing ideals
Recently Published Documents


TOTAL DOCUMENTS

24
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

2020 ◽  
Vol 2020 (20) ◽  
pp. 6597-6665
Author(s):  
Raphaël Clouâtre ◽  
Edward J Timko

Abstract We study similarity classes of commuting row contractions annihilated by what we call higher-order vanishing ideals of interpolating sequences. Our main result exhibits a Jordan-type direct sum decomposition for these row contractions. We illustrate how the family of ideals to which our theorem applies is very rich, especially in several variables. We also give two applications of the main result. First, we obtain a purely operator theoretic characterization of interpolating sequences for the multiplier algebra of the Drury–Arveson space. Second, we classify certain classes of cyclic commuting row contractions up to quasi-similarity in terms of their annihilating ideals. This refines some of our recent work on the topic. We show how this classification is sharp: in general quasi-similarity cannot be improved to similarity. The obstruction to doing so is a scarcity of norm-controlled similarities between commuting tuples of nilpotent matrices, and we investigate this question in detail.


2020 ◽  
Vol 70 (4) ◽  
pp. 909-916
Author(s):  
Amin Khademi

AbstractLet X be a completely regular topological space. For each closed non-vanishing ideal H of CB(X), the normed algebra of all bounded continuous scalar-valued mappings on X equipped with pointwise addition and multiplication and the supremum norm, we study its spectrum, denoted by 𝔰𝔭(H). We make a correspondence between algebraic properties of H and topological properties of 𝔰𝔭(H). This continues some previous studies, in which topological properties of 𝔰𝔭(H) such as the Lindelöf property, paracompactness, σ-compactness and countable compactness have been made into correspondence with algebraic properties of H. We study here other compactness properties of 𝔰𝔭(H) such as weak paracompactness, sequential compactness and pseudocompactness. We also study the ideal isomorphisms between two non-vanishing closed ideals of CB(X).


2020 ◽  
Vol 279 ◽  
pp. 107243
Author(s):  
A. Khademi ◽  
M.R. Koushesh
Keyword(s):  

2019 ◽  
Vol 27 (2) ◽  
pp. 233-258
Author(s):  
M. Eduardo Uribe-Paczka ◽  
Eliseo Sarmiento ◽  
Carlos Rentería Márquez

AbstractLet K be a finite field. Let X* be a subset of the a ne space Kn, which is parameterized by odd cycles. In this paper we give an explicit Gröbner basis for the vanishing ideal, I(X*), of X*. We give an explicit formula for the regularity of I(X*) and finally if X* is parameterized by an odd cycle of length k, we show that the Hilbert function of the vanishing ideal of X* can be written as linear combination of Hilbert functions of degenerate torus.


2019 ◽  
Vol 18 (06) ◽  
pp. 1950102 ◽  
Author(s):  
Amir Hashemi ◽  
Martin Kreuzer ◽  
Samira Pourkhajouei

In this paper, we consider the problem of computing all possible order ideals and also sets connected to 1, and the corresponding border bases, for the vanishing ideal of a given finite set of points. In this context, two different approaches are discussed: based on the Buchberger–Möller Algorithm [H. M. Möller and B. Buchberger, The construction of multivariate polynomials with preassigned zeros, EUROCAM ’82 Conf., Computer Algebra, Marseille/France 1982, Lect. Notes Comput. Sci. 144, (1982), pp. 24–31], we first propose a new algorithm to compute all possible order ideals and the corresponding border bases for an ideal of points. The second approach involves adapting the Farr–Gao Algorithm [J. B. Farr and S. Gao, Computing Gröbner bases for vanishing ideals of finite sets of points, in 16th Int. Symp. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC-16, Las Vegas, NV, USA (Springer, Berlin, 2006), pp. 118–127] for finding all sets connected to 1, as well as the corresponding border bases, for an ideal of points. It should be noted that our algorithms are term ordering free. Therefore, they can compute successfully all border bases for an ideal of points. Both proposed algorithms have been implemented and their efficiency is discussed via a set of benchmarks.


2019 ◽  
Vol 105 (3-4) ◽  
pp. 429-438
Author(s):  
A. Tochimani ◽  
R. H. Villarreal

2018 ◽  
Vol 35 (1) ◽  
pp. 47-63 ◽  
Author(s):  
Peter Beelen ◽  
Mrinmoy Datta ◽  
Sudhir R. Ghorpade

2018 ◽  
Vol 240 ◽  
pp. 125-136 ◽  
Author(s):  
A. Khademi ◽  
M.R. Koushesh
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document