Results 21 to 30 of about 33,836 (264)
On the relative proof complexity of deep inference via atomic flows [PDF]
Logical Methods in Computer Science, 2015 We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Anupam Das
doaj +1 more source
Polynomials Generating Maximal Real Subfields of Circular Fields [PDF]
Учёные записки Казанского университета: Серия Физико-математические науки, 2016 We have constructed recurrence formulas for polynomials qn(x) ɕ Q[x], any root of which generates the maximal real subfield of circular field K2n. It has been shown that all real subfields of fixed field K2n can be described by using polynomial qn(x) and
I.G. Galyautdinov, E.E. Lavrentyeva
doaj
The structure of solutions of the matrix linear unilateral polynomial equation with two variables
Karpatsʹkì Matematičnì Publìkacìï, 2017 We investigate the structure of solutions of the matrix linear polynomial equation $A(\lambda)X(\lambda)+B(\lambda)Y(\lambda)=C(\lambda),$ in particular, possible degrees of the solutions.
N.S. Dzhaliuk, V.M. Petrychkovych
doaj +1 more source
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
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
SIMETRISASI BENTUK KANONIK JORDAN
Barekeng, 2021 If the characteristic polynomial of a linear operator is completely factored in scalar field of then Jordan canonical form of can be converted to its rational canonical form of , and vice versa.
Darlena Darlena, Ari Suparwanto
doaj +1 more source
Міжнародний науково-технічний журнал "Проблеми керування та інформатики", 2020 The paper proposes a method for constructing primitive polynomials that are used in the design of radio engineering systems, subsystems of cryptographic information protection in reliable automated information processing and control systems at critical ...
Г.М. Гулак
doaj +1 more source
Partial stability of linear systems with respect to a given component of the phase vector
Журнал Средневолжского математического общества, 2021 A new geometric approach to the study of the partial stability of linear systems is proposed, which is based on the application of the geometric theory of linear operators.
Nikonov Vladimir I.
doaj +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
Elevating PGBMain algorithm performance through strategic minimal Dickson basis selection [PDF]
Computational Algorithms and Numerical DimensionsIn this paper, we enhance the PGBMain algorithm, an efficient method for computing Gröbner bases of parametric polynomial ideals, or Gröbner systems. A key step in the PGBMain algorithm involves computing a minimal Dickson basis in each iteration, which ...
Mahdi Dehghani Darmian
doaj +1 more source