14,754 results
Search Results
2. Algorithm for Determining the State of Impregnated Paper Insulation of High-Voltage Cables.
- Author
-
Sidorova, Anna, Semenov, Dmitry, Cheremukhin, Artem, and Astakhova, Tatyana
- Subjects
- *
ALGORITHMS , *CABLES , *VOLTAGE , *POLYNOMIALS - Abstract
The paper presents a technique for determining the time index of growth of the slope of reverse voltage for double insulated cables, based on the body of the theory of series. It is proved that in the vicinity of the extremum point (maximum) the function of the reverse voltage is approximated by polynomials of the nth power. It is proposed to use second-degree polynomials for practical calculations. The method for calculating relevant indicators is illustrated using real data. Analysis of deviations made it possible to conclude that the calculation method proposed in the paper is far more accurate. In the final part of the study, it was concluded that there is a promising outlook for further development of methodological guidelines for determining complex indices of the remaining life of the cable, including but not limited to the use of various mathematical methods. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
3. Algorithm for Determining the State of Impregnated Paper Insulation of High-Voltage Cables.
- Author
-
Sidorova, Anna, Semenov, Dmitry, Cheremukhin, Artem, and Astakhova, Tatyana
- Subjects
- *
CABLES , *ALGORITHMS , *ELECTRIC potential , *POLYNOMIALS , *CABLE manufacturing , *GUIDELINES - Abstract
The paper presents a technique for determining the time index of growth of the slope of reverse voltage for double insulated cables, based on the body of the theory of series. It is proved that in the vicinity of the extremum point (maximum) the function of the reverse voltage is approximated by polynomials of the nth power. It is proposed to use second-degree polynomials for practical calculations. The method for calculating relevant indicators is illustrated using real data. Analysis of deviations made it possible to conclude that the calculation method proposed in the paper is far more accurate. In the final part of the study, it was concluded that there is a promising outlook for further development of methodological guidelines for determining complex indices of the remaining life of the cable, including but not limited to the use of various mathematical methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
4. COMPARISON OF VARIOUS FRACTIONAL BASIS FUNCTIONS FOR SOLVING FRACTIONAL-ORDER LOGISTIC POPULATION MODEL: This paper is dedicated to Professor Hari Mohan Srivastava on the occasion of his 80th Birthday.
- Author
-
Izadi, Mohammad
- Subjects
- *
ALGEBRAIC equations , *ORTHOGONAL polynomials , *INITIAL value problems , *COLLOCATION methods , *APPROXIMATION algorithms , *LEGENDRE'S polynomials , *POLYNOMIALS - Abstract
Three types of orthogonal polynomials (Chebyshev, Chelyshkov, and Legendre) are employed as basis functions in a collocation scheme to solve a nonlinear cubic initial value problem arising in population growth models. The method reduces the given problem to a set of algebraic equations consist of polynomial coefficients. Our main goal is to present a comparative study of these polynomials and to asses their performances and accuracies applied to the logistic population equation. Numerical applications are given to demonstrate the validity and applicability of the method. Comparisons are also made between the present method based on different basis functions and other existing approximation algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
5. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
- Author
-
Limaye, Nutan, Srinivasan, Srikanth, and Tavenas, Sébastien
- Subjects
- *
ALGEBRA , *POLYNOMIALS , *CIRCUIT complexity , *ALGORITHMS , *DIRECTED acyclic graphs , *LOGIC circuits - Abstract
An Algebraic Circuit for a multivariate polynomial P is a computational model for constructing the polynomial P using only additions and multiplications. It is a syntactic model of computation, as opposed to the Boolean Circuit model, and hence lower bounds for this model are widely expected to be easier to prove than lower bounds for Boolean circuits. Despite this, we do not have superpolynomial lower bounds against general algebraic circuits of depth 3 (except over constant-sized finite fields) and depth 4 (over any field other than F2), while constant-depth Boolean circuit lower bounds have been known since the early 1980s. In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0. We also observe that our super-polynomial lower bound for constant-depth circuits implies the first deterministic sub-exponential time algorithm for solving the Polynomial Identity Testing (PIT) problem for all small-depth circuits using the known connection between algebraic hardness and randomness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Polynomial maps and polynomial sequences in groups.
- Author
-
Hu, Ya-Qing
- Subjects
- *
ABELIAN groups , *DIFFERENCE equations , *POLYNOMIALS , *NONCOMMUTATIVE algebras , *INTEGERS - Abstract
This paper presents a modified version of Leibman's group-theoretic generalizations of the difference calculus for polynomial maps from nonempty commutative semigroups to groups, and proves that it has many desirable formal properties when the target group is locally nilpotent and also when the semigroup is the set of nonnegative integers. We will apply it to solve Waring's problem for general discrete Heisenberg groups in a sequel to this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. Enhanced power graphs of certain non-abelian groups.
- Author
-
Parveen, Dalal, Sandeep, and Kumar, Jitender
- Subjects
- *
NONABELIAN groups , *UNDIRECTED graphs , *POWER spectra , *LAPLACIAN matrices , *FINITE groups , *QUATERNIONS , *POLYNOMIALS - Abstract
The enhanced power graph of a group G is a simple undirected graph with vertex set G and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, we obtain the Laplacian spectrum of the enhanced power graph of certain non-abelian groups, viz. semidihedral, dihedral and generalized quaternion. Also, we obtained the metric dimension and the resolving polynomial of the enhanced power graphs of these groups. At the final part of this paper, we study the distant properties and the detour distant properties, namely: closure, interior, distance degree sequence, eccentric subgraph of the enhanced power graph of semidihedral group, dihedral group and generalized quaternion group, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. Moment Problems and Integral Equations.
- Author
-
Olteanu, Cristian Octav
- Subjects
- *
INTEGRAL equations , *FOURIER transforms , *DIOPHANTINE equations , *POLYNOMIAL approximation , *POLYNOMIALS , *INTEGERS - Abstract
The first part of this work provides explicit solutions for two integral equations; both are solved by means of Fourier transform. In the second part of this paper, sufficient conditions for the existence and uniqueness of the solutions satisfying sandwich constraints for two types of full moment problems are provided. The only given data are the moments of all positive integer orders of the solution and two other linear, not necessarily positive, constraints on it. Under natural assumptions, all the linear solutions are continuous. With their value in the subspace of polynomials being given by the moment conditions, the uniqueness follows. When the involved linear solutions and constraints are positive, the sufficient conditions mentioned above are also necessary. This is achieved in the third part of the paper. All these conditions are written in terms of quadratic expressions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. On Certain Properties of Parametric Kinds of Apostol-Type Frobenius–Euler–Fibonacci Polynomials.
- Author
-
Guan, Hao, Khan, Waseem Ahmad, Kızılateş, Can, and Ryoo, Cheon Seoung
- Subjects
- *
POLYNOMIALS , *GENERATING functions , *OPERATOR functions , *CHEBYSHEV polynomials , *REPRESENTATIONS of graphs - Abstract
This paper presents an overview of cosine and sine Apostol-type Frobenius–Euler–Fibonacci polynomials, as well as several identities that are associated with these polynomials. By applying a partial derivative operator to the generating functions, the authors obtain derivative formulae and finite combinatorial sums involving these polynomials and numbers. Additionally, the paper establishes connections between cosine and sine Apostol-type Frobenius–Euler–Fibonacci polynomials of order α and several other polynomial sequences, such as the Apostol-type Bernoulli–Fibonacci polynomials, the Apostol-type Euler–Fibonacci polynomials, the Apostol-type Genocchi–Fibonacci polynomials, and the Stirling–Fibonacci numbers of the second kind. The authors also provide computational formulae and graphical representations of these polynomials using the Mathematica program. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
10. The transcendence of growth constants associated with polynomial recursions.
- Author
-
Kumar, Veekesh
- Subjects
- *
POLYNOMIALS , *ALGEBRAIC numbers , *INTEGERS - Abstract
Let P (x) : = a d x d + ⋯ + a 0 ∈ ℚ [ x ] , a d > 0 , be a polynomial of degree d ≥ 2. Let (x n) be a sequence of integers satisfying x n + 1 = P (x n) for all n = 0 , 1 , 2 , ... and x n → ∞ as n → ∞. Set α : = lim n → ∞ x n d − n . Then, under the assumption a d 1 / (d − 1) ∈ ℚ , in a recent result by [A. Dubickas, Transcendency of some constants related to integer sequences of polynomial iterations, Ramanujan J. 57 (2022) 569–581], either α is transcendental or α can be an integer or a quadratic Pisot unit with α − 1 being its conjugate over ℚ. In this paper, we study the nature of such α without the assumption that a d 1 / (d − 1) is in ℚ , and we prove that either the number α is transcendental, or α h is a Pisot number with h being the order of the torsion subgroup of the Galois closure of the number field ℚ α , a d − 1 d − 1 . Other results presented in this paper investigate the solutions of the inequality | | q 1 α 1 n + ⋯ + q k α k n + β | | < n in (n , q 1 , ... , q k) ∈ ℕ × (K ×) k , considering whether β is rational or irrational. Here, K represents a number field, and ∈ (0 , 1). The notation | | x | | denotes the distance between x and its nearest integer in ℤ. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
11. Adaptive control of a class of uncertain nonlinear systems using brain emotional learning and Legendre polynomials.
- Author
-
Amiri, Fatemeh and Khorashadizadeh, Saeed
- Subjects
- *
ADAPTIVE control systems , *UNCERTAIN systems , *NONLINEAR systems , *POLYNOMIALS , *DERIVATIVES (Mathematics) - Abstract
In this paper, an adaptive controller for a class of uncertain nonlinear systems is presented using a combination of Legendre polynomials and brain emotional learning-based intelligent controller (BELBIC). Recently, some versions of BELBIC have been presented with the aim of satisfying the universal approximation property using Gaussian basis function. However, the size of regressor vector is too large that imposes a heavy computational load to the processor. The novelty of this paper is presenting a new version of BELBIC with less computational burden using Legendre polynomials. Moreover, there are very few tuning parameters in Legendre polynomials. Another contribution of this paper is editing the stability analysis presented in recent related works. Due to the intrinsic non-differentiability of the adaptation rules of BELBIC, the second time derivative of Lyapunov function is undefined and thus, the Barbalat's lemma cannot be applied to verify the asymptotic convergence of the error function. Therefore, bounded-input-bounded-output (BIBO) stability can only be claimed for this controller. Simulation results on different case studies show that Legendre polynomials can improve the universal approximation property of BELBIC with less tuning parameters. Moreover, in the absence of the robust control term in the control law, the performance Legendre polynomials will not deteriorate, while the performance degrade in Gaussian basis function is quite considerable. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. Zero/low overshoot conditions based on maximally‐flatness for PID‐type controller design for uncertain systems with time‐delay or zeros.
- Author
-
Canevi, Mehmet and Söylemez, Mehmet Turan
- Subjects
- *
UNCERTAIN systems , *TRANSFER functions , *CONTINUOUS time systems - Abstract
This paper extends the characteristic ratio approach using novel inequalities to ensure zero/low overshoot for linear‐time‐invariant systems with zeros. The extension provided by this paper is based on the maximally‐flatness property of a transfer function, where the square‐magnitude of the transfer function is ensured to be a low‐pass filter. In order to be able to design low‐order/fixed structure controllers, a partial pole‐assignment approach is used instead of the full pole‐assignment used in the Characteristic Ratio Assignment (CRA) method. The developed inequalities and additional stability conditions are combined into an optimization problem using time domain restrictions when necessary. Although the method given in the paper is general, particular inequalities are developed for PI and PI‐PD controller cases, due to their frequent use in industrial applications. Similarly, First‐Order‐Plus‐Delay‐Time (FOPDT) and Second‐Order‐Plus‐Delay‐Time (SOPDT) systems are considered specifically, since most of the practical systems can be approximated by one of these types. The study is extended to plants with uncertainties where a theorem is developed to decrease computation time dramatically. The benefits of the proposed methods are demonstrated by several examples. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. Approximation by operators Involving Δh-Gould-Hopper Appell polynomials.
- Author
-
YILMAZ, Bilge Zehra SERGİ and İÇÖZ, Gürhan
- Subjects
- *
POLYNOMIALS , *LINEAR operators - Abstract
The present paper deals with the approximation properties of the linear positive operators, including Δh -Gould-Hopper Appell polynomials. We investigate some theorems for convergence of the operators and their approximation degrees with the help of the classical approach, Peetre's K-functional, Lipschitz class and Voronovskajatype theorem. In the last section of the paper, we introduce the Kantorovich form of the operators and examine the approximation degree. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. Polynomial Intermediate Checksum for Integrity under Releasing Unverified Plaintext and Its Application to COPA.
- Author
-
Zhang, Ping
- Subjects
- *
POLYNOMIALS , *IMAGE encryption - Abstract
COPA, introduced by Andreeva et al., is the first online authenticated encryption (AE) mode with nonce-misuse resistance, and it is covered in COLM, which is one of the final CAESAR portfolios. However, COPA has been proven to be insecure in the releasing unverified plaintext (RUP) setting. This paper mainly focuses on the integrity under RUP (INT-RUP) defect of COPA. Firstly, this paper revisits the INT-RUP security model for adaptive adversaries, investigates the possible factors of INT-RUP insecurity for "Encryption-Mix-Encryption"-type checksum-based AE schemes, and finds that these AE schemes with INT-RUP security vulnerabilities utilize a common poor checksum technique. Then, this paper introduces an improved checksum technique named polynomial intermediate checksum (PIC) for INT-RUP security and emphasizes that PIC is a sufficient condition for guaranteeing INT-RUP security for "Encryption-Mix-Encryption"-type checksum-based AE schemes. PIC is generated by a polynomial sum with full terms of intermediate internal states, which guarantees no information leakage. Moreover, PIC ensures the same level between the plaintext and the ciphertext, which guarantees that the adversary cannot obtain any useful information from the unverified decryption queries. Again, based on PIC, this paper proposes a modified scheme COPA-PIC to fix the INT-RUP defect of COPA. COPA-PIC is proven to be INT-RUP up to the birthday-bound security if the underlying primitive is secure. Finally, this paper discusses the properties of COPA-PIC and makes a comparison for AE modes with distinct checksum techniques. The proposed work is of good practical significance. In an interactive system where two parties communicate, the receiver can effectively determine whether the information received from the sender is valid or not, and thus perform the subsequent operation more effectively. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. Thin Polytopes: Lattice Polytopes With Vanishing Local h*-Polynomial.
- Author
-
Borger, Christopher, Kretschmer, Andreas, and Nill, Benjamin
- Subjects
- *
LEANNESS , *POLYNOMIALS , *POLYTOPES , *CLASSIFICATION , *DEFINITIONS - Abstract
In this paper, we study the novel notion of thin polytopes: lattice polytopes whose local |$h^{*}$| -polynomials vanish. The local |$h^{*}$| -polynomial is an important invariant in modern Ehrhart theory. Its definition goes back to Stanley with fundamental results achieved by Karu, Borisov, and Mavlyutov; Schepers; and Katz and Stapledon. The study of thin simplices was originally proposed by Gelfand, Kapranov, and Zelevinsky, where in this case the local |$h^{*}$| -polynomial simply equals its so-called box polynomial. Our main results are the complete classification of thin polytopes up to dimension 3 and the characterization of thinness for Gorenstein polytopes. The paper also includes an introduction to the local |$h^{*}$| -polynomial with a survey of previous results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. Proof of a conjecture on the determinant of the walk matrix of rooted product with a path.
- Author
-
Wang, Wei, Yan, Zhidan, and Mao, Lihuan
- Subjects
- *
MATRIX multiplications , *LINEAR algebra , *CHEBYSHEV polynomials , *LOGICAL prediction , *LAPLACIAN matrices , *POLYNOMIALS , *MULTILINEAR algebra - Abstract
The walk matrix of an n-vertex graph G with adjacency matrix A, denoted by $ W(G) $ W (G) , is $ [e,Ae,\ldots,A^{n-1}e] $ [ e , Ae , ... , A n − 1 e ] , where e is the all-ones vector. Let $ G\circ P_m $ G ∘ P m be the rooted product of G and a rooted path $ P_m $ P m (taking an endvertex as the root), i.e. $ G\circ P_m $ G ∘ P m is a graph obtained from G and n copies of $ P_m $ P m by identifying each vertex of G with an endvertex of a copy of $ P_m $ P m . Mao et al. [A new method for constructing graphs determined by their generalized spectrum. Linear Algebra Appl. 2015;477:112–127.] and Mao and Wang [Generalized spectral characterization of rooted product graphs. Linear Multilinear Algebra. 2022. DOI:10.1080/03081087.2022.2098226.] proved that, for m = 2 and $ m\in \{3,4\} $ m ∈ { 3 , 4 } , respectively \[ \det W(G\circ P_m)=\pm a_0^{\lfloor\frac{m}{2}\rfloor}(\det W(G))^m, \] det W (G ∘ P m) = ± a 0 ⌊ m 2 ⌋ (det W (G)) m , where $ a_0 $ a 0 is the constant term of the characteristic polynomial of G. Furthermore, in the same paper, Mao and Wang conjectured that the formula holds for any $ m\ge 2 $ m ≥ 2. In this paper, we verify this conjecture using the technique of Chebyshev polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. Bifurcations for Homoclinic Networks in Two-Dimensional Polynomial Systems.
- Author
-
Luo, Albert C. J.
- Subjects
- *
NONLINEAR dynamical systems , *BIFURCATION theory , *POLYNOMIALS , *DYNAMICAL systems , *NONLINEAR theories , *NONLINEAR systems - Abstract
The bifurcation theory for homoclinic networks with singular and nonsingular equilibriums is a key to understand the global dynamics of nonlinear dynamical systems, which will help one determine the dynamical behaviors of physical and engineering nonlinear systems. In this paper, the appearing and switching bifurcations for homoclinic networks through equilibriums in planar polynomial dynamical systems are studied. The appearing and switching bifurcations are discussed for the homoclinic networks of nonsingular and singular sources, sinks, saddles with singular saddle-sources, saddle-sinks, and double-saddles in self-univariate polynomial systems. The first integral manifolds for nonsingular and singular equilibrium networks are determined. The illustrations of singular equilibriums to networks of nonsingular sources, sinks and saddles are given. The appearing and switching bifurcations are studied for homoclinic networks of singular and nonsingular saddles and centers with singular parabola-saddles and double-inflection saddles in crossing-univariate polynomial systems, and the first integral manifolds of such homoclinic networks are determined through polynomial functions. The illustrations of singular equilibriums to networks of nonsingular saddles and centers are given. This paper may help one understand higher-order bifurcation theory in nonlinear dynamical systems, which is completely different from the classic bifurcation theories. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
18. Bounds for zeros of Collatz polynomials, with necessary and sufficient strictness conditions.
- Author
-
Hohertz, Matt
- Subjects
- *
NATURAL numbers , *POLYNOMIALS , *GENERATING functions - Abstract
In a previous paper, we introduced the Collatz polynomials $ P_N\left (z \right) $ P N (z) , whose coefficients are the terms of the Collatz sequence of the positive integer N. Our work in this paper expands on our previous results, using the Eneström-Kakeya Theorem to tighten our old bounds of the roots of $ P_N\left (z \right) $ P N (z) and giving precise conditions under which these new bounds are sharp. In particular, we confirm an experimental result that zeros on the circle $ \ensuremath {\{z\in \ensuremath {\mathbb {C}}:\left | z \right | = 2\}} $ { z ∈ C : | z | = 2 } are rare: the set of N such that $ P_N\left (z \right) $ P N (z) has a root of modulus 2 is sparse in the natural numbers. We close with some questions for further study. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. On Variance and Average Moduli of Zeros and Critical Points of Polynomials.
- Author
-
Sheikh, Sajad A., Mir, Mohammad Ibrahim, Alamri, Osama Abdulaziz, and Dar, Javid Gani
- Subjects
- *
POLYNOMIALS , *CRITICAL point theory - Abstract
This paper investigates various aspects of the distribution of roots and critical points of a complex polynomial, including their variance and the relationships between their moduli using an inequality due to de Bruijn. Making use of two other inequalities-again due to de Bruijn-we derive two probabilistic results concerning upper bounds for the average moduli of the imaginary parts of zeros and those of critical points, assuming uniform distribution of the zeros over a unit disc and employing the Markov inequality. The paper also provides an explicit formula for the variance of the roots of a complex polynomial for the case when all the zeros are real. In addition, for polynomials with uniform distribution of roots over the unit disc, the expected variance of the zeros is computed. Furthermore, a bound on the variance of the critical points in terms of the variance of the zeros of a general polynomial is derived, whereby it is established that the variance of the critical points of a polynomial cannot exceed the variance of its roots. Finally, we conjecture a relation between the real parts of the zeros and the critical points of a polynomial. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
20. A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2×2 submatrices.
- Author
-
Iwamasa, Yuni
- Subjects
- *
POLYNOMIALS , *MINORS , *MATRICES (Mathematics) , *ALGORITHMS , *BIPARTITE graphs , *INTEGERS - Abstract
In this paper, we consider the problem of computing the entire sequence of the maximum degree of minors of a block-structured symbolic matrix (a generic partitioned polynomial matrix) A = (A α β x α β t d α β ) , where A α β is a 2 × 2 matrix over a field F , x α β is an indeterminate, and d α β is an integer for α = 1 , 2 , ⋯ , μ and β = 1 , 2 , ⋯ , ν , and t is an additional indeterminate. This problem can be viewed as an algebraic generalization of the maximum weight bipartite matching problem. The main result of this paper is a combinatorial -time algorithm for computing the entire sequence of the maximum degree of minors of a (2 × 2) -type generic partitioned polynomial matrix of size 2 μ × 2 ν . We also present a minimax theorem, which can be used as a good characterization (NP ∩ co-NP characterization) for the computation of the maximum degree of minors of order k. Our results generalize the classical primal-dual algorithm (the Hungarian method) and minimax formula (Egerváry's theorem) for the maximum weight bipartite matching problem. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
21. Several Goethals–Seidel Sequences with Special Structures.
- Author
-
Shen, Shuhui and Zhang, Xiaojun
- Subjects
- *
POLYNOMIALS , *SYMMETRY , *MOTIVATION (Psychology) , *COMPUTERS - Abstract
In this paper, we develop a novel method to construct Goethals–Seidel (GS) sequences with special structures. In the existing methods, utilizing Turyn sequences is an effective and convenient approach; however, this method cannot cover all GS sequences. Motivated by this, we are devoted to designing some sequences that can potentially construct all GS sequences. Firstly, it is proven that a quad of ± 1 polynomials can be considered a linear combination of eight polynomials with coefficients uniquely belonging to { 0 , ± 1 } . Based on this fact, we change the construction of a quad of Goethals–Seidel sequences to find eight sequences consisting of 0 and ± 1 . One more motivation is to obtain these sequences more efficiently. To this end, we make use of the k-block, of which some properties of (anti) symmetry are discussed. After this, we can then look for the sequences with the help of computers since the symmetry properties facilitate reducing the search range. Moreover, we find that one of the eight blocks, which we utilize to construct GS sequences directly, can also be combined with Williamson sequences to generate GS sequences with more order. Several examples are provided to verify the theoretical results. The main contribution of this work is in building a bridge linking the GS sequences and eight polynomials, and the paper also provides a novel insight through which to consider the existence of GS sequences. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. Inequalities for polynomials satisfying p(z)≡znp(1/z).
- Author
-
Dalal, A. and Govil, N. K.
- Subjects
- *
POLYNOMIALS , *LOGICAL prediction - Abstract
Finding the sharp estimate of max | z | = 1 | p ′ (z) | in terms of max | z | = 1 | p (z) | for the class of polynomials p(z) satisfying p (z) ≡ z n p (1 / z) has been a well-known open problem for a long time and many papers in this direction have appeared. The earliest result is due to Govil, Jain and Labelle [9] who proved that for polynomials p(z) satisfying p (z) ≡ z n p (1 / z) and having all the zeros either in left half or right half-plane, the inequality max | z | = 1 | p ′ (z) | ≤ n 2 max | z | = 1 | p (z) | holds. A question was posed whether this inequality is sharp. In this paper, we answer this question in the negative by obtaining a bound sharper than n 2 . We also conjecture that for such polynomials max | z | = 1 | p ′ (z) | ≤ ( n 2 - 2 - 1 4 (n - 2)) max | z | = 1 | p (z) | and provide evidence in support of this conjecture. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
23. The Bubble Transform and the de Rham Complex.
- Author
-
Falk, Richard S. and Winther, Ragnar
- Subjects
- *
DIFFERENTIAL forms , *BUBBLES , *POLYNOMIALS - Abstract
The purpose of this paper is to discuss a generalization of the bubble transform to differential forms. The bubble transform was discussed in Falk and Winther (Found Comput Math 16(1):297–328, 2016) for scalar valued functions, or zero-forms, and represents a new tool for the understanding of finite element spaces of arbitrary polynomial degree. The present paper contains a similar study for differential forms. From a simplicial mesh T of the domain Ω , we build a map which decomposes piecewise smooth k-forms into a sum of local bubbles supported on appropriate macroelements. The key properties of the decomposition are that it commutes with the exterior derivative and preserves the piecewise polynomial structure of the standard finite element spaces of k-forms. Furthermore, the transform is bounded in L 2 and also on the appropriate subspace consisting of k-forms with exterior derivatives in L 2 . [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. Three New Proofs of the Theorem rank f (M) + rank g (M) = rank (f , g)(M) + rank [ f , g ](M).
- Author
-
Pop, Vasile and Negrescu, Alexandru
- Subjects
- *
POLYNOMIALS - Abstract
It is well known that in C [ X ] , the product of two polynomials is equal to the product of their greatest common divisor and their least common multiple. In a recent paper, we proved a similar relation between the ranks of matrix polynomials. More precisely, the sum of the ranks of two matrix polynomials is equal to the sum of the rank of the greatest common divisor of the polynomials applied to the respective matrix and the rank of the least common multiple of the polynomials applied to the respective matrix. In this paper, we present three new proofs for this result. In addition to these, we present two more applications. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. Limit cycles and homoclinic networks in two-dimensional polynomial systems.
- Author
-
Luo, Albert C. J.
- Subjects
- *
LIMIT cycles , *POLYNOMIALS , *DYNAMICAL systems , *CLINICS - Abstract
In this paper, the properties of equilibriums in planar polynomial dynamical systems are studied. The homoclinic networks of sources, sinks, and saddles in self-univariate polynomial systems are discussed, and the numbers of sources, sinks, and saddles are determined through a theorem, and the first integral manifolds are determined. The corresponding proof of the theorem is completed, and a few illustrations of networks for source, sinks, and saddles are presented for a better understanding of the homoclinic networks. Such homoclinic networks are without any centers even if the networks are separated by the homoclinic orbits. The homoclinic networks of positive and negative saddles with clockwise and counterclockwise limit cycles in crossing-univariate polynomial systems are studied secondly, and the numbers of saddles and centers are determined through a theorem, and the first integral manifolds are determined through polynomial functions. The corresponding proof of the theorem is given, and a few illustrations of networks of saddles and centers are given to show the corresponding geometric structures. Such homoclinic networks of saddles and centers are without any sources and sinks. Since the maximum equilibriums for such two types of planar polynomial systems with the same degrees are discussed, the maximum centers and saddles should be obtained, and maximum sinks, sources, and saddles should be achieved. This paper may provide a different way to determine limit cycles in the Hilbert 16th problem. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. Remarks on combinatorial numbers containing special numbers and polynomials.
- Author
-
Kilar, Neslihan
- Subjects
- *
GENERATING functions , *POLYNOMIALS - Abstract
The most important aim of this paper is to study some special cases of the open problem for ordinary generating functions (OGFs) for the combinatorial Simsek numbers of the sixth kind given by Simsek in [12]. The other aim is to give some identities and relations, including these numbers and others, via these generating functions. Finally, we present some applications of some special values of these results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. New type of partially degenerate Changhee-Genocchi polynomials and numbers.
- Author
-
Khan, Waseem Ahmad
- Subjects
- *
POLYNOMIALS - Abstract
In this paper, we consider two new polynomials, partially degenerate Changhee-Genocchi polynomials and partially degenerate Changhee-Genocchi poynomials of higher-order. We analyzed some properties and formulas of these polynomials. Moreover, we derive multifarious correlations for these polynomials, including Changhee polynomials, Daehee polynomials, Stirling numbers of the first and the second kinds, and partially degenerate Changhee-Genocchi polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Local Restrictions from the Furst-Saxe-Sipser Paper.
- Author
-
Tamaki, Suguru and Watanabe, Osamu
- Subjects
- *
LOGIC circuits , *POLYNOMIALS , *ISOMORPHISM (Mathematics) , *MATHEMATICAL functions , *SATISFIABILITY (Computer science) - Abstract
In their celebrated paper (Furst et al., Math. Syst. Theory 17(1), 13-27 (12)), Furst, Saxe, and Sipser used random restrictions to reveal the weakness of Boolean circuits of bounded depth, establishing that constant-depth and polynomial-size circuits cannot compute the parity function. Such local restrictions have played important roles and have found many applications in complexity analysis and algorithm design over the past three decades. In this article, we give a brief overview of two intriguing applications of local restrictions: the first one is for the Isomorphism Conjecture and the second one is for moderately exponential time algorithms for the Boolean formula satisfiability problem. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
29. Some summability methods for Dunkl–Gamma‐type operators including Appell polynomials.
- Author
-
Braha, Naim L.
- Subjects
- *
POLYNOMIALS , *FUNCTION spaces , *CONTINUOUS functions , *POWER series , *SUMMABILITY theory - Abstract
In this paper, we give some properties of the Dunkl–Gamma‐type operators including Appell polynomials, using into consideration the generalized power summability method. In the first section are given moments of the new defined operators. In second section are given some direct estimation related to the Dunkl–Gamma‐type operators, including Korovkin‐type theorem. In the third section, we give some results related to the weighted spaces of continuous functions, and in the last section, we give some properties in the sense of A$$ A $$‐statistically convergence, including Voronovskaya and Grüss–Voronovskaya‐type theorem. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Local solvability and stability for the inverse Sturm‐Liouville problem with polynomials in the boundary conditions.
- Author
-
Chitorkin, Egor E. and Bondarenko, Natalia P.
- Subjects
- *
INVERSE problems , *POLYNOMIALS , *BANACH spaces , *LINEAR equations - Abstract
In this paper, we for the first time prove local solvability and stability of the inverse Sturm‐Liouville problem with complex‐valued singular potential and with polynomials of the spectral parameter in the boundary conditions. The proof method is constructive. It is based on the reduction of the inverse problem to a linear equation in the Banach space of bounded infinite sequences. We prove that, under a small perturbation of the spectral data, the main equation of the inverse problem remains uniquely solvable. Furthermore, we derive new reconstruction formulas for obtaining the problem coefficients from the solution of the main equation and get stability estimates for the recovered coefficients. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Evaluation maps for affine quantum Schur algebras.
- Author
-
Fu, Qiang and Liu, Mingqiang
- Subjects
- *
AFFINE algebraic groups , *HECKE algebras , *MODULES (Algebra) , *ALGEBRA , *POLYNOMIALS - Abstract
For a ∈ C ⁎ there are two natural evaluation maps ev a and ev a from the affine Hecke algebra H ▵ (r) C to the Hecke algebra H (r) C. The maps ev a and ev a induce evaluation maps ev ˜ a and ev ˜ a from the affine quantum Schur algebra S ▵ (n , r) C to the quantum Schur algebra S (n , r) C , respectively. In this paper we prove that the evaluation map ev ˜ a (resp. ev ˜ a) is compatible with the evaluation map Ev a (resp. Ev (− 1) n a q n ) for quantum affine sl n. Furthermore we compute the Drinfeld polynomials associated with the simple S ▵ (n , r) C -modules which come from the simple S (n , r) C -modules via the evaluation maps ev ˜ a. Then we characterize finite-dimensional irreducible S ▵ (n , r) C -modules which are irreducible as S (n , r) C -modules for n > r. As an application, we characterize finite-dimensional irreducible modules for the affine Hecke algebra H ▵ (r) C which are irreducible as modules for the Hecke algebra H (r) C. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Linearizations of matrix polynomials viewed as Rosenbrock's system matrices.
- Author
-
Dopico, Froilán M., Marcaida, Silvia, Quintana, María C., and Van Dooren, Paul
- Subjects
- *
POLYNOMIALS , *MATRICES (Mathematics) , *MATRIX pencils , *EIGENVALUES , *PROBLEM solving - Abstract
A well known method to solve the Polynomial Eigenvalue Problem (PEP) is via linearization. That is, transforming the PEP into a generalized linear eigenvalue problem with the same spectral information and solving such linear problem with some of the eigenvalue algorithms available in the literature. Linearizations of matrix polynomials are usually defined using unimodular transformations. In this paper we establish a connection between the standard definition of linearization for matrix polynomials introduced by Gohberg, Lancaster and Rodman and the notion of polynomial system matrix introduced by Rosenbrock. This connection gives new techniques to show that a matrix pencil is a linearization of the corresponding matrix polynomial arising in a PEP. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Extending a conjecture of Graham and Lovász on the distance characteristic polynomial.
- Author
-
Abiad, Aida, Brimkov, Boris, Hayat, Sakander, Khramova, Antonina P., and Koolen, Jack H.
- Subjects
- *
POLYNOMIALS , *LOGICAL prediction , *DIAMETER - Abstract
Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order n is unimodal with the maximum value occurring at ⌊ n 2 ⌋. In this paper we investigate this problem for block graphs. In particular, we prove the unimodality part and we establish the peak for several extremal cases of uniform block graphs with small diameter. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. Vertex-minors of graphs: A survey.
- Author
-
Kim, Donggyu and Oum, Sang-il
- Subjects
- *
POLYNOMIALS , *LOGICAL prediction , *MATROIDS - Abstract
For a vertex v of a graph, the local complementation at v is an operation that replaces the neighborhood of v by its complement graph. Two graphs are locally equivalent if one is obtained from the other by a sequence of local complementations. A graph H is a vertex-minor of a graph G if H is an induced subgraph of a graph locally equivalent to G. Although this concept was introduced in the 1980s, it was not widely known and except for the survey paper of Bouchet published in 1990, there is no comprehensive survey listing all the new developments. We survey classic and recent theorems and conjectures on vertex-minors and related concepts such as circle graphs, cut-rank functions, rank-width, and interlace polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. On the eigenvalues and Seidel eigenvalues of chain graphs.
- Author
-
Xiong, Zhuang and Hou, Yaoping
- Subjects
- *
EIGENVALUES , *POLYNOMIALS , *MATRICES (Mathematics) , *REGULAR graphs - Abstract
In this paper, we primarily focus on the eigenvalues of the adjacency matrix and Seidel matrix of chain graphs, referred to as eigenvalues and Seidel eigenvalues of these graphs, respectively. Firstly, we utilize the characteristic polynomial of the adjacency matrix of a chain graph to construct infinite pairs of non-isomorphic cospectral chain graphs. Next, we determine the inertia of the Seidel matrix of a chain graph and establish an interval that does not contain the Seidel eigenvalues of chain graphs. Lastly, we characterize chain graphs with distinct Seidel eigenvalues. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. Enhanced Turan-type Inequalities for Polynomials.
- Author
-
N., Reingachan, Soraisam, Robinson, Devi, Khangembam Babina, Singh, M. Singhajit, and Chanam, Barchand
- Subjects
- *
POLYNOMIALS , *MATHEMATICS , *BULLS - Abstract
If p(z) = Xn ν=0 aνz ν is a polynomial of degree n having all its zeros in |z| ≤ k, k ≥ 1, Jain [Bull. Math. Soc. Sci. Math. Roumania Tome, 59(2016), 339-347] proved max |z|=1 |p′ (z)| ≥ nAk max |z|=1 |p(z)|, where Ak = ( |a0| + |an|k n+1/ |ao|(1 + k n+1) + |an|(k n+1 + k 2n) ) . In this paper, we initially derive a generalized form that not only encompasses but also enhances the aforementioned inequality. Additionally, we extend this formulation to a more comprehensive result, thereby producing an improved outcome for certain established inequalities as a specific instance. [ABSTRACT FROM AUTHOR]
- Published
- 2024
37. Fixed points and orbits in skew polynomial rings.
- Author
-
Chapman, Adam and Paran, Elad
- Subjects
- *
POLYNOMIAL rings , *ORBITS (Astronomy) , *NONCOMMUTATIVE algebras , *DIVISION rings , *POLYNOMIALS - Abstract
In this paper, we study orbits and fixed points of polynomials in a general skew polynomial ring D [ x , σ , δ ]. We extend results of the first author and Vishkautsan on polynomial dynamics in D [ x ]. In particular, we show that if a ∈ D and f ∈ D [ x , σ , δ ] satisfy f (a) = a , then f ∘ n (a) = a for every formal power of f. More generally, we give a sufficient condition for a point a to be r -periodic with respect to a polynomial f. Our proofs build upon foundational results on skew polynomial rings due to Lam and Leroy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. On Minimum Second neighborhood Degree Energy of Graphs.
- Author
-
MANILAL, K. and HARIKRISHNAN, K. A.
- Subjects
- *
NEIGHBORHOODS , *POLYNOMIALS - Abstract
In this paper we establish the second neighborhood degree polynomials of some graphs along with their energy and also, we obtain some bounds for the spectral radius and second neighborhood energy of graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. GEOMETRIC PROPERTIES OF THE LATTICE OF POLYNOMIALS WITH INTEGER COEFFICIENTS.
- Author
-
Lipnicki, Artur and Śmietański, Marek J.
- Subjects
- *
INTEGERS , *POLYNOMIALS , *POLYNOMIAL approximation , *INTEGER approximations , *HYPERPLANES - Abstract
This paper is related to the classic but still being examined issue of approximation of functions by polynomials with integer coefficients. Let r, n be positive integers with n ≥ 6r. Let Pn ∩ Mr be the space of polynomials of degree at most n on [0, 1] with integer coefficients such that P(k)(0)/k! and P(k)(1)/k! are integers for k = 0,. . ., r - 1 and let PZn ∩ Mr be the additive group of polynomials with integer coefficients. We explore the problem of estimating the minimal distance of elements of PZn ∩ Mr from Pn ∩ Mr in L2(0, 1). We give rather precise quantitative estimations for successive minima of PZn in certain specific cases. At the end, we study properties of the shortest polynomials in some hyperplane in Pn ∩ Mr. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. Multiple Skew-Orthogonal Polynomials and 2-Component Pfaff Lattice Hierarchy.
- Author
-
Li, Shi-Hao, Shen, Bo-Jian, Xiang, Jie, and Yu, Guo-Fu
- Subjects
- *
POLYNOMIALS , *ORTHOGONAL polynomials - Abstract
In this paper, we introduce multiple skew-orthogonal polynomials and investigate their connections with classical integrable systems. By using Pfaffian techniques, we show that multiple skew-orthogonal polynomials can be expressed by multi-component Pfaffian tau-functions upon appropriate deformations. Moreover, a two-component Pfaff lattice hierarchy, which is equivalent to the Pfaff–Toda hierarchy studied by Takasaki, is obtained by considering the recurrence relations and Cauchy transforms of multiple skew-orthogonal polynomials. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Design of an Alternative to Polynomial Modified RSA Algorithm.
- Author
-
Abass, Banen Najah and Yassein, Hassan Rashed
- Subjects
- *
RSA algorithm , *PUBLIC key cryptography , *POLYNOMIALS , *ALGEBRA - Abstract
The modified RSA provides high efficiency against attacks and, as a result, it is considered the ideal choice for many applications. In this paper, we introduce an alternative to the modified RSA key encryption system called TPRSA, based on Tri-Cartesian algebra and polynomials, by modifying the mathematical structure of text encryption and decryption keys to obtain a high level of security. [ABSTRACT FROM AUTHOR]
- Published
- 2024
42. Applications of Chuh-Shih-Chieh's Identity in Geodetic Independence Polynomials.
- Author
-
Maldo, Jun Francis B. and Artes Jr., Rosalio G.
- Subjects
- *
POLYNOMIALS , *GRAPH connectivity , *INDEPENDENT sets , *GEODESICS , *LINEAR dependence (Mathematics) - Abstract
Let G be a simple connected graph. The geodetic independence polynomial G, denoted by g(G; x), is the polynomial whose coefficients correspond to the number of geodetic independent subsets of V (G). In this paper, we apply the Chuh-Shih-Chieh's Identity to establish the geodetic independence polynomial of cycles. [ABSTRACT FROM AUTHOR]
- Published
- 2024
43. Induced Path Polynomials of the Join and Corona of Graphs.
- Author
-
Villarta, Cerina A., Eballe, Rolito G., and Artes Jr., Rosalio G.
- Subjects
- *
POLYNOMIALS , *GRAPH connectivity - Abstract
In this paper, we establish the induced path polynomials of graphs resulting from the join and corona of two connected graphs. [ABSTRACT FROM AUTHOR]
- Published
- 2024
44. A higher-order family of simultaneous iterative methods with Neta's correction for polynomial complex zeros.
- Author
-
Neves Machado, Roselaine and Guerreiro Lopes, Luiz
- Subjects
- *
POLYNOMIALS , *NONLINEAR equations , *SIMULTANEOUS equations - Abstract
In this paper, a new family of iterative methods for the simultane-ous approximation of simple complex polynomial zeros is presented. The proposed family of simultaneous methods is constructed on the basis of the well-known third order Ehrlich iteration, combined with an iterative correction from the sixth order Neta's method for nonlinear equations. It is proved that the use of this iterative correction allows to increase the convergence order of the basic method from three to eight. Numerical examples are given to illustrate the convergence and effectiveness of the proposed combined method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
45. The maximum number of centers for planar polynomial Kolmogorov differential systems.
- Author
-
He, Hongjin and Xiao, Dongmei
- Subjects
- *
POLYNOMIALS - Abstract
The maximum number of centers is an open problem proposed by Gasull for planar polynomial differential systems of degree n with n ≥ 4. In this paper we study the problem for planar polynomial Kolmogorov differential systems of degree n , prove that the maximum number of centers is exactly seven for planar quartic polynomial Kolmogorov differential systems, and give the upper and lower bound for the maximum number of centers that the Kolmogorov differential systems of degree n can have. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Linear Complexity of r-Ary Sequences Derived from Euler Quotient Modulo pq.
- Author
-
Xiao, Zibi, Li, Zepeng, Yang, Bo, and Fan, Jinmei
- Subjects
- *
SHIFT registers , *POLYNOMIALS , *EULER polynomials - Abstract
In this paper, we present a generic construction of r-ary sequences with period pq2 based on the Euler quotient modulo pq, where p and q are odd primes satisfying that p divides q − 1 and r is any prime less than q. The minimal polynomial and the linear complexity of the proposed sequences are determined in most cases under the assumption that rq−1≢1 (mod q2). The result shows that each of the sequences has large linear complexity. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. A q-analogue for partial-fraction decomposition of a rational function and its application.
- Author
-
Luo, Ze-Qian and Luo, Qiu-Ming
- Subjects
- *
POLYNOMIALS , *INTEGRALS - Abstract
In this paper, by using the residue method of complex analysis, we obtain a q-analogue for partial-fraction decomposition of the rational function x M (x + 1) n λ . As applications, we deduce the corresponding q-algebraic and q-combinatorial identities which are the q-extensions of Chu' results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Misiurewicz polynomials and dynamical units, part II.
- Author
-
Benedetto, Robert L. and Goksel, Vefa
- Subjects
- *
POLYNOMIALS , *ORBITS (Astronomy) , *ARITHMETIC , *INTEGERS - Abstract
Fix an integer d ≥ 2 . The parameters c 0 ∈ Q ¯ for which the unicritical polynomial f d , c (z) = z d + c ∈ C [ z ] has finite postcritical orbit, also known as Misiurewicz parameters, play a significant role in complex dynamics. Recent work of Buff, Epstein, and Koch proved the first known cases of a long-standing dynamical conjecture of Milnor using their arithmetic properties, about which relatively little is otherwise known. Continuing our work from a companion paper, we address further arithmetic properties of Misiurewicz parameters, especially the nature of the algebraic integers obtained by evaluating the polynomial defining one such parameter at a different Misiurewicz parameter. In the most challenging such combinations, we describe a connection between such algebraic integers and the multipliers of associated periodic points. As part of our considerations, we also introduce a new class of polynomials we call p-special, which may be of independent number theoretic interest. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. On Generalized Fibospinomials: Generalized Fibonacci Polynomial Spinors.
- Author
-
Çolak, Ece Gülşah, Gönül Bilgin, Nazmiye, and Soykan, Yüksel
- Subjects
- *
SPINORS , *POLYNOMIALS , *QUANTUM mechanics , *GENERATING functions , *QUATERNIONS - Abstract
Spinors are important objects in physics, which have found their place more and more after the discovery that particles have an intrinsic angular momentum shape and Cartan's mathematical expression of this situation. Recent studies using special number sequences have also revealed a new approach to the use of spinors in mathematics and have provided a different perspective for spinor research that can be used as a source for future physics studies. The purpose of this work is to expand the generalized Fibonacci quaternion polynomials to the generalized Fibonacci polynomial spinors by associating spinors with quaternions, and to introduce and investigate a new polynomial sequence that can be used to benefit from the potential advantages of spinors in physical applications, and thus, to provide mathematical arguments, such as new polynomials, for studies using spinors and quaternions in quantum mechanics. Starting from this point of view, in this paper we introduce and investigate a new family of sequences called generalized Fibospinomials (or generalized Fibonacci polynomial spinors or Horadam polynomial spinors). Being particular cases, we use (r , s) -Fibonacci and (r , s) -Lucas polynomial spinors. We present Binet's formulas, generating functions and the summation formulas for these polynomials. In addition, we obtain some special identities of these new sequences and matrices related to these polynomials. The importance of this study is that generalized Fibospinomials are currently the most generalized sequence in the literature when moving from Fibonacci quaternions to spinor structure, and that a wide variety of new spinor sequences can be obtained from this particular polynomial sequence. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Ising's Roots and the Transfer-Matrix Eigenvalues.
- Author
-
Folk, Reinhard and Holovatch, Yurij
- Subjects
- *
ISING model , *EIGENVALUES , *POTTS model , *ORDER picking systems , *POLYNOMIALS - Abstract
Today, the Ising model is an archetype describing collective ordering processes. As such, it is widely known in physics and far beyond. Less known is the fact that the thesis defended by Ernst Ising 100 years ago (in 1924) contained not only the solution of what we call now the 'classical 1D Ising model' but also other problems. Some of these problems, as well as the method of their solution, are the subject of this note. In particular, we discuss the combinatorial method Ernst Ising used to calculate the partition function for a chain of elementary magnets. In the thermodynamic limit, this method leads to the result that the partition function is given by the roots of a certain polynomial. We explicitly show that 'Ising's roots' that arise within the combinatorial treatment are also recovered by the eigenvalues of the transfer matrix, a concept that was introduced much later. Moreover, we discuss the generalization of the two-state model to a three-state one presented in Ising's thesis, which is not included in his famous paper of 1925 (E. Ising, Z. Physik 31 (1925) 253). The latter model can be considered as a forerunner of the now-abundant models with many-component order parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.