Computations with Frobenius powers.
Hermiller, Susan, Swanson, Irena (2005)
Experimental Mathematics
Similarity:
Hermiller, Susan, Swanson, Irena (2005)
Experimental Mathematics
Similarity:
Krzysztof Woźniakowski (2001)
Studia Mathematica
Similarity:
We show that in the space C[-1,1] there exists an orthogonal algebraic polynomial basis with optimal growth of degrees of the polynomials.
Winkler, Franz (1990)
Mathematica Pannonica
Similarity:
Janusz Zieliński (2010)
Open Mathematics
Similarity:
Border bases are an alternative to Gröbner bases. The former have several more desirable properties. In this paper some constructions and operations on border bases are presented. Namely; the case of a restriction of an ideal to a polynomial ring (in a smaller number of variables), the case of the intersection of two ideals, and the case of the kernel of a homomorphism of polynomial rings. These constructions are applied to the ideal of relations and to factorizable derivations. ...
Alessandro Perotti (1998)
Publicacions Matemàtiques
Similarity:
Let I(f) be a zero-dimensional ideal in C[z1, ..., zn] defined by a mapping f. We compute the logarithmic residue of a polynomial g with respect to f. We adapt an idea introduced by Aizenberg to reduce the computation to a special case by means of a limiting process. We then consider the total sum of local residues of g w.r.t. f. If the zeroes of f are simple, this sum can be computed from a finite number of logarithmic residues. In...
Markus Dod, Tomer Kotek, James Preen, Peter Tittmann (2015)
Discussiones Mathematicae Graph Theory
Similarity:
This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph...
Jorge Luis Arocha, Bernardo Llano (2000)
Discussiones Mathematicae Graph Theory
Similarity:
The mean value of the matching polynomial is computed in the family of all labeled graphs with n vertices. We introduce the dominating polynomial of a graph whose coefficients enumerate the dominating sets for a graph and study some properties of the polynomial. The mean value of this polynomial is determined in a certain special family of bipartite digraphs.
J. Siciak (1971)
Annales Polonici Mathematici
Similarity:
Norbert Hegyvári, François Hennecart (2009)
Acta Arithmetica
Similarity:
Luís R. A. Finotti (2009)
Acta Arithmetica
Similarity:
R. Ger (1971)
Annales Polonici Mathematici
Similarity:
Jason Lucier (2006)
Acta Arithmetica
Similarity:
Umberto Zannier (2007)
Acta Arithmetica
Similarity:
Ivan Gutman (1982)
Publications de l'Institut Mathématique
Similarity:
A. Schinzel (2008)
Acta Arithmetica
Similarity:
Amir Hashemi (2014)
Acta Arithmetica
Similarity:
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.