Results 11 to 20 of about 4,447 (309)
Factorization of the Cover Polynomial [PDF]
Journal of Combinatorial Theory, Series B, 1997 The cover polynomial, as introduced by \textit{F. R. K. Chung} and \textit{R. L. Graham} [J. Comb. Theory, Ser. B 65, No. 2, 273-290 (1995; Zbl 0839.05045)], generalizes the factorial rook polynomial to two variables, by also encoding information about the partial permutations which correspond to rook placements.
Dworkin, Morris
openaire +3 more sources
MIMO Antenna Array Design with Polynomial Factorization [PDF]
International Journal of Antennas and Propagation, 2013 One of the main advantages of multiple-input multiple-output (MIMO) antenna is that the degrees-of-freedom can be significantly increased by the concept of virtual antenna array, and thus the MIMO antenna array should be carefully designed to fully ...
Wen-Qin Wang, Huaizong Shao, Jingye Cai
doaj +2 more sources
Factorization Method for Solving Multipoint Problems for Second Order Difference Equations with Polynomial Coefficients [PDF]
, 2020 This paper is devoted to the study of second order linear difference equations with polynomial coefficients subject to multipoint boundary conditions. We provide necessary and sufficient conditions for the existence and uniqueness of solutions and find ...
P. Hahamis +3 more
core +1 more source
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization [PDF]
, 2023 Based on a theorem of Bergman [Cohn, 2006] we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:
Arvind, Vikraman, Joglekar, Pushkar S.
core +1 more source
Faktorisasi Polinomial Square-Free dan bukan Square-Free atas Lapangan Hingga Zp
JTAM (Jurnal Teori dan Aplikasi Matematika), 2019 Abstrak: Faktorisasi polinomial merupakan suatu proses penguraian suatu polinomial berderajat n menjadi polinomial-polinomial lain yang berderajat lebih kecil dari n.
Juli Loisiana Butar-butar +1 more
doaj +1 more source
Factorization of polynomials [PDF]
ACM SIGSAM Bulletin, 1984 The last few years there have been a lot of exciting new results in the area of factorization of polynomials. In this note we give an overview of the most important results, and we give some directions for future research.
openaire +1 more source
Factorizing the polynomial of a code [PDF]
Transactions of the American Mathematical Society, 1984 We give an extension and a simplified presentation of a theorem of Schützenberger. This theorem describes the factorization of the commutative polynomial associated with a finite maximal code. It is the deepest result known so far in the theory of (variable-length) codes.
Hansel, G., Perrin, D., Reutenauer, C.
openaire +2 more sources
The General Inner-Outer Factorization Problem for Discrete-Time Systems [PDF]
, 1999 In this paper we give a theoretical and a computational solution to the most general inner-outer factorization problem formulated for a discrete-time system G.
A. Varga +3 more
core +1 more source
Computation of nonlinear eigenvalues based on the Ore determinant: preliminary results [PDF]
Proceedings of the Estonian Academy of SciencesThe concept of eigenvalues has recently been generalized for nonlinear systems, but the method to find them is missing. Unlike the linear case, now one has to deal with non-commutative polynomials from the Ore ring. In the paper, the Ore determinant of a
Miroslav Halás +3 more
doaj +1 more source
Ramification in quartic cyclic number fields $K$ generated by $x^4+px^2+p$ [PDF]
Mathematica Bohemica, 2021 If $K$ is the splitting field of the polynomial $f(x)=x^4+px^2+p$ and $p$ is a rational prime of the form $4+n^2$, we give appropriate generators of $K$ to obtain the explicit factorization of the ideal $q{\mathcal O}_K$, where $q$ is a positive rational
Julio Pérez-Hernández +1 more
doaj +1 more source