Results 231 to 240 of about 33,836 (264)

Polynomials as Generators of Minimal Clones

37th International Symposium on Multiple-Valued Logic (ISMVL'07), 2007
A minimal clone is an atom of the lattice of clones. A minimal function is a function which generates a minimal clone. We consider the base set with k elements, for a prime k, as a finite field and treat functions as polynomials. Starting from binary minimal functions over GF(3), we generalize some of them and obtain binary minimal functions, as ...
Hajime Machida, Michael Pinsker
openaire   +1 more source

The Complexity of the Minimal Polynomial

2001
We investigate the computational complexity of the minimal polynomial of an integer matrix. We show that the computation of the minimal polynomial is in AC0(GapL), the AC0-closure of the logspace counting class GapL, which is contained in NC2. Our main result is that the problem is hard for GapL (under AC0 many-one reductions). The result extends to
Thanh Minh Hoang, Thomas Thierauf
openaire   +2 more sources

Minimal polynomial realizations

Mathematics of Control, Signals, and Systems, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Minimal ⁎-varieties and minimal supervarieties of polynomial growth

Journal of Algebra, 2020
Let \(\mathfrak M\) be variety of algebras. Consider a space \(V_n\) of multilinear words of length \(n\) over alphabet \(x_1,\dots,x_n\) in relatively free algebra in \(\mathfrak M\), \(n_k=\dim(V_k)\). The sequence \(\{n_k\}\) is a \textit{codimension sequence} of the variety \(\mathfrak M\). Codimension sequence was introduced by \textit{A.
Tatiana Aparecida Gouveia, Rafael Bezerra dos Santos, Ana Cristina Vieira   +2 more
openaire   +2 more sources

A Method to Compute Minimal Polynomials

SIAM Journal on Algebraic Discrete Methods, 1985
Let f(X) and g(X) be polynomials with coefficients in an arbitrary field K. Assume that f(X) is irreducible and let r be a root of f(X). We describe a new algorithm for computing the minimal polynomial of g(r) over K. The novelty of our algorithm is that it begins by computing the polynomial p(X,Y) of smallest degree such that \(p(f,g)=0\).
Peskin, Barbara R., Richman, David R.
openaire   +2 more sources

Minimal degrees for polynomial reducibilities

Journal of the ACM, 1987
The existence of minimal degrees is investigated for several polynomial reducibilities. It is shown that no set has minimal degree with respect to polynomial many-one or Turing reducibility. This extends a result of Ladner in which only recursive sets are considered. A polynomial reducibility ≤ h
openaire   +1 more source

The minimal polynomial of 2 cos(π/q) and Dickson polynomials

Applied Mathematics and Computation, 2012
The authors obtain explicit formulas involving Chebyshev and Dickson polynomials for the minimal polynomials of \(2\cos (\pi /q)\) and \(\cos (2\pi /q)\) by means of Möbius inversion formula.
Abdelmejid Bayad, Ismail Naci Cangül
openaire   +3 more sources

The RCH method for computing minimal polynomials of polynomial matrices

Journal of Systems Science and Complexity, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bo Yu 0003, Jintao Zhang, Yanyan Xu
openaire   +2 more sources

Minimal Balanced Neighborly Polynomials

Acta Mathematica Vietnamica
The study of balanced neighborly polynomials (BNPs) was initiated motivated by an existence problem of balanced neighborly simplicial spheres. The existence of balanced neighborly simplicial spheres is an interesting problem in a combinatorial study of face numbers of simplicial complexes, since if a balanced neighborly simplicial spheres of type \((d,\
Satoshi Murai, Nguyen Thi Thanh Tam
openaire   +2 more sources

On Interpolating Polynomials of Minimal Degree

SIAM Review, 1977
Given an incidence matrix E, the general problem of interpolating data on E is investigated. The objective of determining the polynomials of minimal degree satisfying the data is solved by consider...
openaire   +2 more sources