Related papers: Sorting and labelling integral ideals in a number …
Neural ideals, originally defined in arXiv:1212.4201, give a way of translating information about the firing pattern of a set of neurons into a pseudomonomial ideal in a polynomial ring. We give a simple criterion for determining whether a…
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…
In this article, we disprove a conjecture of F. Alarc\'on and D. Anderson and give a complete classification of the prime ideals in the one variable polynomial semiring with coefficients in Boolean semifield. We group the prime ideals of…
The principal ideal problem constitutes a fundamental problem in algebraic number theory and has attracted significant attention due to its applications in ideal lattice based cryptosystems. Efficient quantum algorithm has been found to…
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…
This paper extends the article of the Bruns and Conca on SAGBI bases and their computation (J. Symb. Comput. 120 (2024)) in two directions. (i) We describe the extension of the Singular library sagbiNormaliz.sing to the computation of…
Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…
Multi-label ranking maps instances to a ranked set of predicted labels from multiple possible classes. The ranking approach for multi-label learning problems received attention for its success in multi-label classification, with one of the…
Label ranking is a prediction task which deals with learning a mapping between an instance and a ranking (i.e., order) of labels from a finite set, representing their relevance to the instance. Boosting is a well-known and reliable ensemble…
We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…
We study the generic initial ideals (gin) of certain ideals that arise in modular invariant theory. For all cases an explicit generating set is known we calculate the generic initial ideal of the Hilbert ideal of a cyclic group of prime…
Border bases can be considered to be the natural extension of Gr\"obner bases that have several advantages. Unfortunately, to date the classical border basis algorithm relies on (degree-compatible) term orderings and implicitly on reduced…
We consider graph labelings with an assignment of odd prime numbers to the vertices. Similarly to graceful graphs, a labeling is said to be elegant if the absolute differences between the labels of adjacent vertices describe exactly the…
In this paper, we describe an algorithm that efficiently collect relations in class groups of number fields defined by a small defining polynomial. This conditional improvement consists in testing directly the smoothness of principal ideals…
Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the…
In this paper we continue the development of a new technique for computing elimination ideals by substitution which has been called $Z$-separating re-embeddings. Given an ideal $I$ in the polynomial ring $K[x_1,\dots,x_n]$ over a field $K$,…
The stratum St(J,<) (the homogeneous stratum Sth(J,<) respectively) of a monomial ideal J in a polynomial ring R is the family of all (homogeneous) ideals of R whose initial ideal with respect to the term order < is J. St(J,<) and Sth(J,<)…
We consider the simplest quartic number fields $\mathbb{K}_m$ defined by the irreducible quartic polynomials $$x^4-mx^3-6x^2+mx+1,$$ where $m$ runs over the positive rational integers such that the odd part of $m^2+16$ is squarefree. In…
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…
We discuss principality of prime ideals of finite algebraic number fields $L=K(\theta)$ over an algebraic number field $K ([K:\mathbb{Q}]<\infty)$ defined by irreducible polynomials $f(x)\in \mathfrak{O}_{K}[x]$ and $f(\theta)=0$. Our main…