Academia.eduAcademia.edu

Bezout identity

description11 papers
group0 followers
lightbulbAbout this topic
Bézout's identity is a fundamental theorem in number theory stating that for any integers a and b, there exist integers x and y such that ax + by = gcd(a, b). This identity highlights the relationship between the coefficients of a linear combination of two integers and their greatest common divisor.
lightbulbAbout this topic
Bézout's identity is a fundamental theorem in number theory stating that for any integers a and b, there exist integers x and y such that ax + by = gcd(a, b). This identity highlights the relationship between the coefficients of a linear combination of two integers and their greatest common divisor.

Key research themes

1. How can Bezout's identity be utilized or extended to efficiently compute greatest common divisors (gcd) of polynomials and relate to subresultants and parametric polynomial families?

This theme focuses on algebraic and algorithmic methods grounded in Bezout's identity to calculate gcds of polynomials efficiently under various settings, including parameters and multivariate structures. It also connects with how subresultants and Bezout matrices can facilitate determinant-based computations and elucidate structural properties of polynomial gcds, enabling applications in symbolic computation and algebraic complexity.

Key finding: Introduces a novel algorithm based on Bezout identity that reduces the gcd computation of two degree-n polynomials to n iterative steps involving only linear combinations and division by x, avoiding polynomial division or... Read more
Key finding: Analyzes new determinantal expressions of subresultant polynomials when polynomial coefficients depend on parameters, showing that subresultants can be computed effectively via principal minors of Bezout and Hybrid Bezout... Read more
Key finding: Applies the extended Euclidean algorithm to specialized Aunu binary polynomials, demonstrating the successful computation of gcds and existence of Bezout coefficients (s, t) satisfying s*f + t*g = gcd(f, g) in binary... Read more

2. How is Bezout's identity involved in algebraic structures and factorization methods for cryptography and system control, especially in nonlinear and unstable contexts?

This theme covers the use of Bezout's identity and related algebraic factorizations in advanced cryptographic systems and robust control of uncertain nonlinear systems. Particularly, it studies how the identity and its extended versions can parameterize and guarantee stability or invertibility in system design, and underlie signature algorithms, factorization procedures, and key-generation in cryptosystems, thereby forming a conceptual backbone linking number-theoretic identities to practical secure communication and control synthesis.

Key finding: Develops a cryptosystem integrating a signature scheme reliant on the generalized Euclidean algorithm to produce Bezout coefficients for pairs of primes in key generation and signature creation. The scheme leverages modular... Read more
Key finding: Utilizes right coprime factorizations to design robust controllers for nonlinear systems, where factors satisfy a Bezout-type identity A N + B D = I. The paper addresses challenges of high nonlinearity in inverting factors... Read more
Key finding: Generalizes the construction of coprime factorizations and Bezout factors for fractional order systems with complex transfer functions involving fractional powers, enabling parametrization of all stabilizing controllers via... Read more
Key finding: Introduces a decentralized Bezout factorization for generalized singular systems with two control channels, extending Bezout identity to parameterize all stabilizing decentralized controllers. The paper formalizes Bezout... Read more
Key finding: Presents an algebraic feedback control design method within the ring of retarded quasipolynomial meromorphic functions (RMS), employing a Bezout equation framework and Youla-Kučera parameterization to stabilize integrating... Read more

3. What are the algebraic and arithmetical generalizations and applications of Bezout's identity in number theory, orthogonal polynomials, and commutative algebra?

This theme investigates theoretical extensions of Bezout's identity beyond integers and basic polynomial rings to arithmetical varieties, classical orthogonal polynomial systems, and commutative ring structures. It includes the adaptation of Bezout's identity in arithmetic intersection theory, its role in recurrence relations and differential equations of orthogonal polynomials, as well as its utilization in describing divisibility properties in generalized lattices and Bezout monoids, revealing deep connections of Bezout identity across algebraic and number-theoretic domains.

Key finding: Extends Bezout's identity to families of classical orthogonal polynomials as solutions to second-order hypergeometric differential equations, deriving explicit differential, recurrence, and orthogonality relations for Bezout... Read more
Key finding: Proves arithmetic analogues of classical Bezout's theorem for heights of algebraic cycles intersecting properly in arithmetic varieties, establishing an equality (up to bounded error) relating heights of intersection cycles... Read more
Key finding: Defines Bezout monoids as distributive lattice-ordered semigroups with multiplicative and lattice operations satisfying compatibility conditions inspired by divisibility properties in Bezout rings. The paper develops... Read more
Key finding: Demonstrates how the Bezout property and gcd existence in integral domains (GCD domains) enable generalization of classical number-theoretic results such as Sophie Germain's theorem and Case I of Fermat's Last Theorem in... Read more
Key finding: Connects the theory of subresultants with locally nilpotent derivations in commutative rings containing rationals, proving that subresultants inherit Lie series properties under derivation. The findings imply that Bézout... Read more

All papers in Bezout identity

This here is a Proof of "Bézout's identity" in a diffrent way as i am using "Proof by induction"
This research paper aims to attach a signature scheme that enables signature generation and verification to a well-defined cryptosystem. So, the new system combines key generation, encryption, signature generation, signature verification,... more
In this paper, the decentralized control of generalized systems is considered via a frequency domain approach. Firstly, based on the design of generalized decentralized observer-based controllers, a state-space representation of the... more
In this paper, the Bezout's identity is analyzed in the context of classical orthogonal polynomials solution of a second order differential equation of hypergeometric type. Differential equations, relation with the starting family as well... more
The objective of this paper is to demonstrate the utilization of algebraic controller design in an unconventional ring while control integrating processes with time delay. In contrast to many other methods, the proposed method is not... more
In this paper, the Bezout's identity is analyzed in the context of classical orthogonal polynomials solution of a second order differential equation of hypergeometric type. Differential equations, relation with the starting family as well... more
In the last decades, fractional di erential equations have become popular among scientists in order to model various stable physical phenomena with anomalous decay, s a y that are not of exponential type. Moreover in discrete-time series... more
A large class of viscoelastic and elastoplastic systems, frequently encountered in physics, are based on causal pseudo-di erential operators, which are hereditary: the whole past of the state is involved in the dynamic expression of the... more
The stability of non-linear fractional di erential equations is studied. A su cient stability condition on the non-linearity is given for the input-output stability, thanks to many di erent reformulations of the system using di usive... more
We give a frequency-domain approach to stabilization for a large class of systems with transfer functions involving fractional powers of s. A necessary and su cient criterion for BIBO stability is given, and it is shown how to construct... more
In this paper we establish a connection between subresultants and locally nilpotent derivations over commutative rings containing the rationals. As consequence of this connection, we prove that for any commutative ring with unit and any... more
The robust control issue for uncertain nonlinear system is discussed by using the method of right coprime factorization. As it is difficult to obtain the inverse of the right factor due to the high nonlinearity, the proving of the Bezout... more
In this paper we give an algorithmic characterization of rank two locally nilpotent derivations in dimension three. Together with an algorithm for computing the plinth ideal, this gives a method for computing the rank of a locally... more
Download research papers for free!