中文
相关论文

相关论文: The Dedekind-Hasse Criterion in Quaternion Algebra…

200 篇论文

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

环与代数 · 数学 2017-03-30 Dandan Huang , Yingpu Deng

We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…

数论 · 数学 2025-02-28 Stefano Marseglia , Harry Smit

We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the run time of these algorithms and consider several related…

数论 · 数学 2014-11-19 Markus Kirschmer , John Voight

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

数论 · 数学 2014-02-11 Anton S. Mosunov

A pair of elements $a,b$ in an integral domain $R$ is an idempotent pair if either $a(1-a) \in bR$, or $b(1-b) \in aR$. $R$ is said to be a PRINC domain if all the ideals generated by an idempotent pair are principal. We show that in an…

环与代数 · 数学 2018-10-03 Giulio Peruginelli , Luigi Salce , Paolo Zanardo

Let $\cO$ be a maximal order in a definite quaternion algebra over $\mathbb{Q}$ of prime discriminant $p$, and $\ell$ a small prime. We describe a probabilistic algorithm, which for a given left $O$-ideal, computes a representative in its…

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 present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…

交换代数 · 数学 2018-05-08 Mawunyo Kofi Darkey-Mensah , Przemysław Koprowski

In this article we show how the Dedekind-Hasse criterion may be applied to prove a simple result about quadratic number fields that usually is derived as a consequence of the theory of ideals and ideal classes.

数论 · 数学 2012-05-08 Franz Lemmermeyer

In a Dedekind domain $D$, every non-zero proper ideal $A$ factors as a product $A=P_1^{t_1}\cdots P_k^{t_k}$ of powers of distinct prime ideals $P_i$. For a Dedekind domain $D$, the $D$-modules $D/P_i^{t_i}$ are uniserial. We extend this…

环与代数 · 数学 2018-02-13 Alberto Facchini , Zahra Nazemian

We consider the following control problem on fair allocation of indivisible goods. Given a set $I$ of items and a set of agents, each having strict linear preference over the items, we ask for a minimum subset of the items whose deletion…

多智能体系统 · 计算机科学 2017-06-01 Britta Dorn , Ronald de Haan , Ildikó Schlotter

We define Dedekind semidomains as semirings in which each nonzero fractional ideal is invertible. Then we find some equivalent condition for semirings to being Dedekind. For example, we prove that a Noetherian semidomain is Dedekind if and…

环与代数 · 数学 2019-07-17 Peyman Nasehpour

For a Dedekind domain $D$, let $\mathcal{P}(D)$ be the set of ideals of $D$ that are radical of a principal ideal. We show that, if $D,D'$ are Dedekind domains and there is an order isomorphism between $\mathcal{P}(D)$ and…

交换代数 · 数学 2021-10-27 Dario Spirito

An integral domain $D$ is called an SP-domain if every ideal is a product of radical ideals. Such domains are always almost Dedekind domains, but not every almost Dedekind domain is an SP-domain. The SP-rank of $D$ provides a natural…

交换代数 · 数学 2024-05-08 Balint Rago , Dario Spirito

Pr\"{u}fer domains and subclasses of integral domains such as Dedekind domains admit characterizations by means of the properties of their ideal lattices. Interestingly, a Leavitt path algebra $L$, in spite of being non-commutative and…

环与代数 · 数学 2020-12-29 Songül Esin , Müge Kanuni , Ayten Koç , Katherine Radler , Kulumani M. Rangaswamy

We study almost Dedekind domains with respect to the failure of ideals to have radical factorization, that is, we study how to measure how far an almost Dedekind domain is from being an SP-domain. To do so, we consider the maximal space…

交换代数 · 数学 2022-01-19 Dario Spirito

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…

交换代数 · 数学 2020-11-17 Richard Gustavson , Alexey Ovchinnikov , Gleb Pogudin

We study different form of boundness for ideals of almost Dedekind domains, generalizing the notions of critical ideals, radical factorization, and SP-domains. We show that every almost Dedekind domain has at least one noncritical maximal…

交换代数 · 数学 2023-01-25 Dario Spirito

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

数论 · 数学 2018-07-09 Fusun Akman

Let $A$ be a quaternion algebra over a number field $F$, and $\mathcal{O}$ be an $O_F$-order of full rank in $A$. Let $K$ be a quadratic field extension of $F$ that embeds into $A$, and $B$ be an $O_F$-order in $K$. Suppose that…

数论 · 数学 2021-02-19 Deke Peng , Jiangwei Xue
‹ 上一页 1 2 3 10 下一页 ›