中文
相关论文

相关论文: An algorithmic approach to the existence of ideal …

200 篇论文

We introduce a framework for proving statements about linear operators by verification of ideal membership in a free algebra. More specifically, arbitrary first-order statements about identities of morphisms in preadditive semicategories…

逻辑 · 数学 2024-03-13 Clemens Hofstadler , Clemens G. Raab , Georg Regensburger

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

数论 · 数学 2014-08-13 Aurel Page

We classify reflexive graded right ideals, up to isomorphism and shift, of generic cubic three dimensional Artin-Schelter regular algebras. We also determine the possible Hilbert functions of these ideals. These results are obtained by…

环与代数 · 数学 2007-05-23 K. De Naeghel , N. Marconnet

Students studying the Lasker-Noether theorem on primary decomposition of ideals may want to see an example of an ideal (necessarily in a non-Noetherian ring) which does not have a primary decomposition. The most well-known counterexample is…

交换代数 · 数学 2017-07-26 David C. Vella

An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…

组合数学 · 数学 2023-06-02 Ada Stelzer , Alexander Yong

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

交换代数 · 数学 2024-08-07 Martin Kreuzer , Florian Walsh

We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of the no-counterexample interpretation as dynamic processes…

计算机科学中的逻辑 · 计算机科学 2018-12-31 Thomas Powell

A notion of partial ideal for an operator algebra is a weakening the notion of ideal where the defining algebraic conditions are enforced only in the commutative subalgebras. We show that, in a von Neumann algebra, the ultraweakly closed…

算子代数 · 数学 2014-08-07 Nadish de Silva , Rui Soares Barbosa

Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether…

交换代数 · 数学 2019-08-07 Martin Kreuzer , Le Ngoc Long , Lorenzo Robbiano

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

逻辑 · 数学 2024-06-04 Dhruv Kulshreshtha

Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…

符号计算 · 计算机科学 2023-11-21 Clemens Hofstadler , Clemens G. Raab , Georg Regensburger

In classical and real algebraic geometry there are several notions of the radical of an ideal I. There is the vanishing radical defined as the set of all real polynomials vanishing on the real zero set of I, and the real radical defined as…

Noncommutative rational functions, i.e., elements of the universal skew field of fractions of a free algebra, can be defined through evaluations of noncommutative rational expressions on tuples of matrices. This interpretation extends their…

环与代数 · 数学 2018-04-24 Jurij Volčič

Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Peter M Schuster

Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…

量子物理 · 物理学 2017-04-07 Michael Ben-Or , Lior Eldar

The "neural code" is the way the brain characterizes, stores, and processes information. Unraveling the neural code is a key goal of mathematical neuroscience. Topology, coding theory, and, recently, commutative algebra are some the…

交换代数 · 数学 2017-06-28 Sema Gunturkun , Jack Jeffries , Jeffrey Sun

Commutative rings in which every prime ideal is the intersection of maximal ideals are called Hilbert (or Jacobson) rings. We propose to define classical Hilbert modules by the property that {\it classical prime} submodules are the…

交换代数 · 数学 2012-02-03 Marzieh Arabi-Kakavand , Mahmood Behboodi

An algorithm for resolution of singularities in characteristic zero is described. It is expressed in terms of multi-ideals, that essentially are defined as a finite sequence of pairs, each one consiting of a sheaf of ideals and a positive…

代数几何 · 数学 2013-04-10 Augusto Nobile

In commutative ring theory, there is a theorem of Cohen which states that if in a commutative ring all prime ideals are finitely generated then every ideal is finitely generated. However, it is known that having only maximal ideals finitely…

交换代数 · 数学 2018-07-10 Souvik Dey

It is well-known that within Zermelo-Fraenkel set theory (ZF), the Axiom of Choice (AC) implies the Maximal Ideal Theorem (MIT), namely that every nontrivial commutative ring has a maximal ideal. The converse implication MIT $\Rightarrow$…

交换代数 · 数学 2025-06-30 Alexei Entin