Related papers: Canonical Characteristic Sets of Characterizable D…
For an ideal $I\subseteq\mathbb{R}[x]$ given by a set of generators, a new semidefinite characterization of its real radical $I(V_\mathbb{R}(I))$ is presented, provided it is zero-dimensional (even if $I$ is not). Moreover we propose an…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…
This paper is devoted to give all the technical constructions and definitions that will lead to the construction of an algorithm of resolution of singularities for binomial ideals. We construct a resolution function that will provide a…
We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…
The paper introduces the notion of the size of countable sets that preserves the Part-Whole Principle and generalizes the notion of the cardinality of finite sets. The sizes of natural numbers, integers, rational numbers, and all their…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
The equivalence group is determined for systems of linear ordinary differential equations in both the standard form and the normal form. It is then shown that the normal form of linear systems reducible by an invertible point transformation…
Let $\C$ be a sequence of multisets of subspaces of a vector space $\F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $\C$ under the group action of the general semilinear group. It allows us…
Normal ideals on regular uncountable cardinals are familiar objects. We investigate ideals that are pleasant--while a normal ideal is closed under arbitrary diagonal unions, a pleasant ideal is closed only under diagonal unions indexed by…
The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
We prove formulas for the core of ideals that apply in arbitrary characteristic.
Let $R$ be a commutative $G$-graded ring with a nonzero unity. In this article, we introduce the concept of graded radically principal ideals. A graded ideal $I$ of $R$ is said to be graded radically principal if $Grad(I)=Grad(\langle…
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different…
Typestate systems ensure many desirable properties of imperative programs, including initialization of object fields and correct use of stateful library interfaces. Abstract sets with cardinality constraints naturally generalize typestate…
In this lecture note, we discuss a fundamental concept, referred to as the {\it characteristic rank}, which suggests a general framework for characterizing the basic properties of various low-dimensional models used in signal processing.…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…