The Study of Root Subspace Decomposition between Characteristic Polynomials and Minimum Polynomial

Let Abe the linear transformation on the linear space V in the field P, Vλibe the root subspace corresponding to the characteristic polynomial of the eigenvalue λi, and Wλibe the root subspace corresponding to the minimum polynomial of λi. Consider the problem of whether Vλiand Wλiare equal under the condition that the characteristic polynomial of Ahas the same eigenvalue as the minimum polynomial (see Theorem 1, 2). This article uses the method of mutual inclusion to prove that Vλi=Wλi. Compared to previous studies and proofs, the results of this research can be directly cited in related works. For instance, they can be directly cited in Daoji Meng’s book “Introduction to Differential Geometry.”

Lattices Generated by Joins of the Flats in Orbits under Finite Affine-singular Symplectic Group and its Characteristic Polynomials

Let ASG（2v ＋ l, v; Fq） be the （2v ＋l）-dimensional affine-singular symplectic space over the finite field Fq and ASp2v＋l,v（Fq） be the affine-singular symplectic group of degree 2v ＋ l over Fq. Let O be any orbit of flats under ASp2v＋l,v（Fq）. Denote by J the set of all flats which are joins of flats in O such that O LJ and assume the join of the empty set of flats in ASG（2v ＋ l, v;Fq） is φ. Ordering LJ by ordinary or reverse inclusion, then two lattices axe obtained. This paper firstly studies the inclusion relations between different lattices, then determines a characterization of flats contained in a given lattice LJ, when the lattices form geometric lattice, lastly gives the characteristic polynomial of LJ.

EIGENVALUES OF A SPECIAL KIND OF SYMMETRIC BLOCK CIRCULANT MATRICES

In this paper, the spectrum and characteristic polynomial for a special kind of symmetric block circulant matrices are given.

Analysis of Eigenvalues for Molecular Structures

In this article,we study different molecular structures such as Polythiophene network,PLY(n)for n=1,2,and 3,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 for their cardinalities,chromatic numbers,graph variations,eigenvalues obtained from the adjacency matrices which are square matrices in order and their corresponding characteristics polynomials.We convert the general structures of these chemical networks in to mathematical graphical structures.We transform the molecular structures of these chemical networks which are mentioned above,into a simple and undirected planar graph and sketch them with various techniques of mathematics.The matrices obtained from these simple undirected graphs are symmetric.We also label the molecular structures by assigning different colors.Their graphs have also been studied for analysis.For a connected graph,the eigenvalue that shows its peak point(largest value)obtained from the adjacency matrix has multiplicity 1.Therefore,the gap between the largest and its smallest eigenvalues is interlinked with some form of“connectivity measurement of the structural graph”.We also note that the chemical structures,Orthosilicate(Nesosilicate)SiO4,Pyrosilicates(Sorosilicates)Si2O7,Chain silicates(Pyroxenes)(SiO3)n,and Cyclic silicates(Ring Silicates)Si3O9 generally have two same eigenvalues.Adjacency matrices have great importance in the field of computer science.

A CRITERION FOR ORTHOGONALITY OF REFINABLE FUNCTIONS

In this note, a criterion for orthonormality of refinable functions via characteristic polynomial of a matrix is given.

Vibration and buckling analyses of nanobeams embedded in an elastic medium

Boundary characteristic orthogonal polynomials are used as shape functions in the Rayleigh–Ritz method to investigate vibration and buckling of nanobeams embedded in an elastic medium. The present formulation is based on the nonlocal Euler–Bernoulli beam theory. The eigen value equation is developed for the buckling and vibration analyses. The orthogonal property of these polynomials makes the computation easier with less computational effort. It is observed that the frequency and critical buckling load parameters are dependent on the temperature, elastic medium, small scale coefficient,and length-to-diameter ratio. These observations are useful in the mechanical design of devices that use carbon nanotubes.

On the McKay Quiver

Using the connection between McKay quiver and Loewy matrix, and the properties of characteristic polynomial of Loewy matrix, we give a generalized way to determine the McKay quiver for a finite subgroup of a generalized linear group.

Applying Linear Controls to Chaotic Continuous Dynamical Systems

In this case-study, we examine the effects of linear control on continuous dynamical systems that exhibit chaotic behavior using the symbolic computer algebra system Mathematica. Stabilizing (or controlling) higher-dimensional chaotic dynamical systems is generally a difficult problem, Musielak and Musielak, [1]. We numerically illustrate that sometimes elementary approaches can yield the desired numerical results with two different continuous higher order dynamical systems that exhibit chaotic behavior, the Lorenz equations and the Rössler attractor.

Generalization of Multiplication M-Sequences over Fp and Its Recip­rocal Sequences

M_(p)-Sequences or M-Sequence over Fp not used so much in current time as binary M-Sequences and it is pending with the difficult to construct there coders and decoders of M_(p)-Sequences further these reasons there is expensive values to construct them but the progress in the technical methods will be lead to fast using these sequences in different life’s ways,and these sequences give more collection of information and distribution them on the input and output links of the communication channels,building new systems with more complexity,larger period,and security.In current article we will study the construction of the multiplication M_(p)-Sequence{z_(n)}and its linear equivalent,this sequences are as multiple two sequences,the first sequence{Sn}is an arbitrary M_(p)-Sequence and the second sequence{ζ_(n)}reciprocal sequence of the first sequence{S_(n)},length of the sequence{z_(n)},period,orthogonal and the relations between the coefficients and roots of the characteristic polynomial of f(x)and it’s reciprocal polynomial g(x)and compare these properties with corresponding properties in M-Sequences.

Stability Analysis of Multi-Dimensional Linear Discrete System and Root Distribution Using Sign Criterion with Real Coefficients

A new idea was proposed to find out the stability and root location of multi-dimensional linear time invariant discrete system (LTIDS) for real coefficient polynomials. For determining stability the sign criterion is synthesized from the Jury’s method for stability which is derived from the characteristic polynomial coefficients of the discrete system. The number of roots lying inside or outside the unit circle and hence on the unit circle is directly determined from the proposed single modified Jury tabulation and the sign criterion. The proposed scheme is simple and the examples are given to bring out the merits of the proposed scheme which is also applicable for the singular and non-singular cases.

Rank-generating functions and Poincaré polynomials of lattices in finite orthogonal space of even characteristic

The geometry of classical groups over finite fields is widely used in many fields.In this paper,we study the rank-generating function,the characteristic polynomial,and the Poincarépolynomial of lattices generated by the orbits of subspaces under finite orthogonal groups of even characteristic.We also determine their expressions.

Quadratic Starlike Trees

We introduce the notion of a quadratic graph,which is a graph whose eigenvalues are integral or quadratic algebraic integral,and we determine nine infinite families of quadratic starlike trees,which are just all the quadratic starlike trees including integral starlike trees.Thus,the quadratic starlike trees are completely characterized.The expressions for characteristic polynomials of quadratic starlike trees are also given.

On the Largest Eigenvalue of Signless Laplacian Matrix of a Graph

The signless Laplacian matrix of a graph is the sum of its diagonal matrix of vertex degrees and its adjacency matrix. Li and Feng gave some basic results on the largest eigenvalue and characteristic polynomial of adjacency matrix of a graph in 1979. In this paper, we translate these results into the signless Laplacian matrix of a graph and obtain the similar results.

Certifying the Global Optimality of Quartic Minimization over the Sphere

The quartic minimization over the sphere is an NP-hard problem in the general case.There exist various methods for computing an approximate solution for any given instance.In practice,it is quite often that a global optimal solution was found but without a certification.We will present in this article two classes of methods which are able to certify the global optimality,i.e.,algebraic methods and semidefinite program(SDP)relaxation methods.Several advances on these topics are summarized,accompanied with some emerged new results.We want to emphasize that for mediumor large-scaled instances,the problem is still a challenging one,due to an apparent limitation on the current force for solving SDP problems and the intrinsic one on the approximation techniques for the problem.

Polynomial Time Algorithm for the Two-Side Exponentiation Problem about Ergodic Matrices over Finite Field

By using the minimal polynomial of ergodic matrix and the property of polynomial over finite field,we present a polynomial time algorithm for the two-side exponentiation problem about ergodic matrices over finite field （TSEPEM）,and analyze the time and space complexity of the algorithm.According to this algorithm,the public key scheme based on TSEPEM is not secure.

On Extending Real Functions to Finite Dimensional Algebras

In a finite dimensional real algebra,we define functional calculus for real functions.The analytic hypothesis is replaced by a differentiable hypothesis.High order differentibility is essentially necessary and sufficient to our discussions.Moreover,we give some examples.

Factorizations of Matrices over Projective-free Rings

An element of a ring R is called strongly J#-clean provided that it can be written as the sum of an idempotent and an element in J#（R） that commute. In this paper, we characterize the strong J#-cleanness of matrices over projective-free rings. This extends many known results on strongly clean matrices over commutative local rings.