Related papers: Number systems over general orders

An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…

Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…

Sorting is a common and ubiquitous activity for computers. It is not surprising that there exist a plethora of sorting algorithms. For all the sorting algorithms, it is an accepted performance limit that sorting algorithms are linearithmic…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

A Gross space is a vector space E of infinite dimension over some field F, which is endowed with a symmetric bilinear form Phi:E^2 -> F and has the property that every infinite dimensional subspace U subseteq E satisfies dim U^perp < dim E.…

The class of non-commutative hypercomplex number systems (HNS) of 4-dimension, constructed by using of non-commutative Grassmann-Clifford procedure of doubling of 2-dimensional systems is investigated in the article and established here are…

We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…

Let G be a Chevalley group scheme and B<=G a Borel subgroup scheme, both defined over Z. Let K be a global function field, S be a finite non-empty set of places over K, and O_S be the corresponding S-arithmetic ring. Then, the S-arithmetic…

A method based on order completion for solving general equations is presented. In particular, this method can be used for solving large classes of nonlinear systems of PDEs, with possibly associated initial and/or boundary value problems.

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…

We introduce a universal weight system (a function on chord diagrams satisfying the $4$-term relation) taking values in the ring of polynomials in infinitely many variables whose particular specializations are weight systems associated with…

In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…

Let $p$ be a prime, $S$ be a $p$-group and $\mathcal{F}$ be a saturated fusion system over $S$. Then $\mathcal{F}$ is said to be supersolvable, if there exists a series of $S$, namely $1 = S_0 \leq S_1 \leq \cdots \leq S_n = S$, such that…

Let O be an order in an algebraic number field K, i.e., a ring with quotient field K which is contained in the ring of integers of K. The order O is called monogenic, if it is of the shape Z[w], i.e., generated over the rational integers by…

This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…

The domination polynomial (the total domination polynomial) of a graph $ G $ of order $ n $ is the generating function of the number of dominating sets (total dominating sets) of $ G $ of any size. In this paper, we study the domination…

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

Let $p$ be a prime number, $K$ be the henselization of the rational functions over the finite field $\mathbb{F}_p$ and $R$ be the ring of additive polynomials over K. We show that the field of Laurent series over $\mathbb{F}_p$ is decidable…

Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…