We introduce a novel application of Gröbner bases to solve (non-homogeneous) systems of integer linear equations over integers. For this purpose, we present a new algorithm which ascertains whether a linear system of equations has an integer solution or not; in the affirmative case, the general integer solution of the system is determined.
We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A.We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction, we obtain a finite algorithm for solving a polynomial equation over A when A is F[x1, ..., xN] or F(x1,...
Let be a group and let be a finite subset. The isoperimetric method investigates the objective function , defined on the subsets with and , where is the product of by .In this paper we present all the basic facts about the isoperimetric method. We improve some of our previous results and obtain generalizations and short proofs for several known results. We also give some new applications.Some of the results obtained here will be used in coming papers to improve Kempermann structure...
Let be a metric space and . We study homological properties and different types of amenability of Lipschitz algebras and their second duals. Precisely, we first provide some basic properties of Lipschitz algebras, which are important for metric geometry to know how metric properties are reflected in simple properties of Lipschitz functions. Then we show that all of these properties are equivalent to either uniform discreteness or finiteness of . Finally, some results concerning the character...
In this article we extend the algebraic theory of polynomial rings, formalized in Mizar [1], based on [2], [3]. After introducing constant and monic polynomials we present the canonical embedding of R into R[X] and deal with both unit and irreducible elements. We also define polynomial GCDs and show that for fields F and irreducible polynomials p the field F[X]/ is isomorphic to the field of polynomials with degree smaller than the one of p.
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.