Spectrum of localized states in fermionic chains with defect and adiabatic charge pumping

In this paper, we study the localized states of a generic quadratic fermionic chain with finite-range couplings and an inhomogeneity in the hopping (defect) that breaks translational invariance. When the hopping of the defect vanishes, which represents an open chain, we obtain a simple bulk-edge correspondence: the zero-energy modes localized at the ends of the chain are related to the roots of a polynomial determined by the couplings of the Hamiltonian of the bulk. From this result, we define an index that characterizes the different topological phases of the system and can be easily computed by counting the roots of the polynomial. As the defect is turned on and varied adiabatically, the zero-energy modes may cross the energy gap and connect the valence and conduction bands. We analyze the robustness of the connection between bands against perturbations of the Hamiltonian. The pumping of states from one band to the other allows the creation of particle–hole pairs in the bulk. An important ingredient for our analysis is the transformation of the Hamiltonian under the standard discrete symmetries, C, P, T, as well as a fourth one, peculiar to our system, that is related to the existence of a gap and localized states.

Algebraic Extensions

Summary In this article we further develop field theory in Mizar [1], [2], [3] towards splitting fields. We deal with algebraic extensions [4], [5]: a field extension E of a field F is algebraic, if every element of E is algebraic over F. We prove amongst others that finite extensions are algebraic and that field extensions generated by a finite set of algebraic elements are finite. From this immediately follows that field extensions generated by roots of a polynomial over F are both finite and algebraic. We also define the field of algebraic elements of E over F and show that this field is an intermediate field of E|F.

Fractional Newton-Raphson Method

The Newton-Raphson (N-R) method is useful to find the roots of a polynomial of degree n, with n ∈ N. However, this method is limited since it diverges for the case in which polynomials only have complex roots if a real initial condition is taken. In the present work, we explain an iterative method that is created using the fractional calculus, which we will call the Fractional Newton-Raphson (F N-R) Method, which has the ability to enter the space of complex numbers given a real initial condition, which allows us to find both the real and complex roots of a polynomial unlike the classical Newton-Raphson method.

A Monoparametric Family of Piecewise Linear Systems to Generate Scroll Attractors via Path-Connected Set of Polynomials

In this work, we present a monoparametric family of piecewise linear systems to generate multiscroll attractors through a polynomial family defined by path curves that connect to the roots. The idea is to define path curves where the roots of a polynomial can take values by determining an initial and a final polynomial. As a consequence, structural stability and bifurcation of the system can be obtained. Structural stability is obtained by preserving the same stability of the initial and final polynomials. However, the system bifurcates by changing the stability of the final polynomial with respect to the initial polynomial. The aim is achieved by the design of a piecewise linear controller that is applied to affine linear systems. Our results are mathematically proved and numerical examples are also provided to illustrate the approach.

THE NUMBER OF ROOTS OF A POLYNOMIAL SYSTEM

Let I be a zero-dimensional ideal in the polynomial ring $K[x_1,\ldots ,x_n]$ over a field K. We give a bound for the number of roots of I in $K^n$ counted with combinatorial multiplicity. As a consequence, we give a proof of Alon’s combinatorial Nullstellensatz.

Spectral Determinants and an Ambarzumian Type Theorem on Graphs

We consider an inverse problem for Schrödinger operators on connected equilateral graphs with standard matching conditions. We calculate the spectral determinant and prove that the asymptotic distribution of a subset of its zeros can be described by the roots of a polynomial. We verify that one of the roots is equal to the mean value of the potential and apply it to prove an Ambarzumian type result, i.e., if a specific part of the spectrum is the same as in the case of zero potential, then the potential has to be zero.

Some results on counting roots of polynomials and the Sylvester resultant.

International audience We present two results, the first on the distribution of the roots of a polynomial over the ring of integers modulo n and the second on the distribution of the roots of the Sylvester resultant of two multivariate polynomials. The second result has application to polynomial GCD computation and solving polynomial diophantine equations.

On the estimation of coefficients of irreducible factors of polynomials over a field of formal power series in nonzero characteristic

We discuss some problems and results related to the Newton-Puiseux algorithm and its generalization for nonzero characteristic obtained by the author earlier. A new method is suggested for obtaining effective estimations of the roots of a polynomial in the field of fraction-power series in arbitrary characteristic.

Results on Functions on Dedekind Multisets

Many real-life problems are well represented only by sets which allow repetition(s), such as the multiset. Although not limited to the following, such cases may arise in a database query, chemical structures and computer programming. The set of roots of a polynomial, say f ( x ) , has been found to correspond to a multiset, say F. If f ( x ) and g ( x ) are polynomials whose sets of roots respectively correspond to the multisets F ( x ) and G ( x ) , the set of roots of their product, f ( x ) g ( x ) , corresponds to the multiset F ⊎ G , which is the sum of multisets F and G. In this paper, some properties of the algebraic sum of multisets ⊎ and some results on selection are established. Also, the count function of the image of any function on Dedekind multisets is defined and some of its properties are established. Some applications of these multisets are also given.