Results 21 to 30 of about 6,569 (263)
The group and the minimal polynomial of a graph
Journal of Combinatorial Theory, Series B, 1980 AbstractThis paper presents some results linking the minimal polynomial of the adjacency matrix of a graph with its group structure. An upper bound on the order of the group is derived for graphs whose minimal and characteristic polynomials are identical.
CRISCUOLO, GIOVANNI +3 more
openaire +3 more sources
A standard form in (some) free fields: How to construct minimal linear representations
Open Mathematics, 2020 We describe a standard form for the elements in the universal field of fractions of free associative algebras (over a commutative field). It is a special version of the normal form provided by Cohn and Reutenauer and enables the use of linear algebra ...
Schrempf Konrad
doaj +1 more source
A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences
Mathematics, 2022 A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence.
Musthofa +3 more
doaj +1 more source
MINIMIZING POLYNOMIALS ON NONCOMPACT SETS
Acta Universitatis Apulensis, 2018 Summary: In this paper, the problem of minimizing a polymonial \(g_* = \inf\limits_{x \in S(F)}g(x)\) in the noncompact case is investigated. It is known that such problem is severely ill-posed. This paper studies the representation of a non-negative polynomial \(g\) on a noncompact semi-algebraic set \(S\) modulo its KKT (Karush-Kuhn-Tucker) ideal ...
Tri, P. V., Sy, T. V. Q.
openaire +1 more source
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Thanh Minh Hoang, Thomas Thierauf
openaire +1 more source
Minimal Polynomials in Finite Semifields [PDF]
Journal of Siberian Federal University. Mathematics & Physics, 2018 Summary: We consider the classical notion of a minimal polynomial and apply it to investigations in finite semifields. A proper finite semifield has non-associative multiplication, that leads to a number of anomalous properties of one-side-ordered minimal polynomials.
openaire +4 more sources
On the Structure of Valiant's Complexity Classes [PDF]
Discrete Mathematics & Theoretical Computer Science, 1999 In Valiant developed an algebraic analogue of the theory of NP-completeness for computations of polynomials over a field. We further develop this theory in the spirit of structural complexity and obtain analogues of well-known results by Baker, Gill, and
Peter Bürgisser
doaj +3 more sources
Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices
AxiomsGraph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj +1 more source
Noncommutative Phase Space Schrödinger Equation with Minimal Length
Advances in High Energy Physics, 2014 We consider the Schrödinger equation under an external magnetic field in two-dimensional noncommutative phase space with an explicit minimal length relation.
H. Hassanabadi +2 more
doaj +1 more source
Vector-Valued Jack Polynomials from Scratch
Symmetry, Integrability and Geometry: Methods and Applications, 2011 Vector-valued Jack polynomials associated to the symmetric group S_N are polynomials with multiplicities in an irreducible module of S_N and which are simultaneous eigenfunctions of the Cherednik-Dunkl operators with some additional properties concerning
Jean-Gabriel Luque, Charles F. Dunkl
doaj +1 more source