English
Related papers

Related papers: Orbital integrals and ideal class monoids for a Ba…

200 papers

The equivariant Hilbert series of an ideal generated by an orbit of a monomial under the action of the monoid $\mbox{Inc}(\mathbb{N})$ of strictly increasing functions is determined. This is used to find the dimension and degree of such an…

Commutative Algebra · Mathematics 2016-08-24 Sema Gunturkun , Uwe Nagel

The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…

Commutative Algebra · Mathematics 2019-04-23 Yannis C. Stamatiou , Christos Tatakis

Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…

Commutative Algebra · Mathematics 2016-02-09 Mina Bigdeli , Jürgen Herzog , Ali Akbar Yazdan Pour , Rashid Zaare-Nahandi

In this article, we consider the monoid of all monotone and order-decreasing partial transformations denoted as $\mathcal{DORP}_{n}$ on an $n$ ordered chain $[n]=\{1, \ldots,n\}$, its two-sided ideal $I(n,p)= \{\rho \in \mathcal{DORP}_{n} :…

Group Theory · Mathematics 2025-12-30 Muhammad Mansur Zubairu , Abdullahi Umar , Fatma Salim Al-Kharousi

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

Let I\subset K[x,y] be a <x,y>-primary monomial ideal where K is a field. This paper produces an algorithm for computing the Ratliff-Rush closure I for the ideal I=<m_0,...,m_{n}> whenever m_{i} is contained in the integral closure of the…

Commutative Algebra · Mathematics 2010-09-07 Ibrahim Al-Ayyoub

The strong isomorphism classes of extensions of finite groups are parametrized by orbits of a prescribed action on the second cohomology group. We study these orbits in the case of extensions of a finite abelian $p$-group by a cyclic factor…

Group Theory · Mathematics 2023-09-25 Oihana Garaialde Ocaña , Mima Stanojkovski

We show how to compute efficiently with nominal sets over the total order symmetry, by developing a direct representation of such nominal sets and basic constructions thereon. In contrast to previous approaches, we work directly at the…

Logic in Computer Science · Computer Science 2022-08-17 David Venhoek , Joshua Moerman , Jurriaan Rot

We consider the Rosenfeld-Groebner algorithm for computing a regular decomposition of a radical differential ideal generated by a set of ordinary differential polynomials in n indeterminates. For a set of ordinary differential polynomials…

Commutative Algebra · Mathematics 2009-02-25 Oleg Golubitsky , Marina Kondratieva , Marc Moreno Maza , Alexey Ovchinnikov

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

Group Theory · Mathematics 2014-10-03 Yong Yang

We propose a candidate, which we call the fractional Galois ideal after Snaith's fractional ideal, for replacing the classical Stickelberger ideal associated to an abelian extension of number fields. The Stickelberger ideal can be seen as…

Number Theory · Mathematics 2010-04-30 Paul Buckingham

A finite group G is said to be a POS-group if the number of elements of every order occurring in G divides |G|. We answer two questions by Finch and Jones by providing an infinite family of nonabelian POS-groups with orders not divisible by…

Group Theory · Mathematics 2016-05-20 Bret J. Benesh

For a general class of non-negative functions defined on integral ideals of number fields, upper bounds are established for their average over the values of certain principal ideals that are associated to irreducible binary forms with…

Number Theory · Mathematics 2018-03-28 T. D. Browning , E. Sofos

We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…

Commutative Algebra · Mathematics 2021-10-18 Huy Tai Ha , Ngo Viet Trung

We study a form of refined class number formula (resp. type number formula) for maximal orders in totally definite quaternion algebras over real quadratic fields, by taking into consideration the automorphism groups of right ideal classes…

Number Theory · Mathematics 2019-06-04 Qun Li , Jiangwei Xue , Chia-Fu Yu

We implement methods from the geometry of numbers to give explicit estimates for the number of integral ideals in a number field. We pay particular attention to minimising the effect of the degree $n$ of the number field on the error term…

Number Theory · Mathematics 2026-04-22 Anton Fehnker

The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…

Number Theory · Mathematics 2019-09-25 Tommy Hofmann , Carlo Sircana

Let E be the set of integrable and derivable causal functions of x defined on the real interval I from a to infinity, a being real, such f(a) is equal to zero for x lower than or equal to a. We give the expression of one operator that…

General Mathematics · Mathematics 2014-05-06 Raoelina Andriambololona

A new description of free massless superfields of arbitrary superspin $Y$ ($Y>1/2$) is proposed. Following the first-order philosophy, we relax some of the properties (reality, gauge redundancy) of the unconstrained higher spin…

High Energy Physics - Theory · Physics 2022-06-29 Konstantinos Koutrolikos

We study an alternative model of infinitary term rewriting. Instead of a metric on terms, a partial order on partial terms is employed to formalise convergence of reductions. We consider both a weak and a strong notion of convergence and…

Logic in Computer Science · Computer Science 2015-07-01 Patrick Bahr