The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials

2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’Aini Aris ◽  
Azlina Jumadi
Keyword(s):  
Convex Polytopes ◽  
Polynomial Systems ◽  
Matrix Formulation ◽  
Bivariate Polynomials ◽  
Homogeneous Coordinates ◽  
The Matrix ◽  
Projective Vector ◽  
Coordinate Rings ◽  
Resultant Matrix ◽  
The Given

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of a certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.

scholarly journals The Convex Polytopes and Homogeneous Coordinate Rings of Bivariate Polynomials

2019 ◽  
Vol 16 (2) ◽  
pp. 1
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’ Aini Aris ◽  
Azlina Jumadi
Keyword(s):  
Convex Polytopes ◽  
Polynomial Systems ◽  
Matrix Formulation ◽  
Bivariate Polynomials ◽  
Homogeneous Coordinates ◽  
The Matrix ◽  
Projective Vector ◽  
Coordinate Rings ◽  
Resultant Matrix ◽  
The Given

Concepts from algebraic geometry such as cones and fans are related to toric varieties and can be applied to determine the convex polytopes and homogeneous coordinate rings of multivariate polynomial systems. The homogeneous coordinates of a system in its projective vector space can be associated with the entries of the resultant matrix of the system under consideration. This paper presents some conditions for the homogeneous coordinates of certain system of bivariate polynomials through the construction and implementation of the Sylvester-Bèzout hybrid resultant matrix formulation. This basis of the implementation of the Bèzout block applies a combinatorial approach on a set of linear inequalities, named 5-rule. The inequalities involved the set of exponent vectors of the monomials of the system and the entries of the matrix are determined from the coefficients of facets variable known as brackets. The approach can determine the homogeneous coordinates of the given system and the entries of the Bèzout block. Conditions for determining the homogeneous coordinates are also given and proven.   

scholarly journals Sylvester-type matrices for sparse resultants

2014 ◽  
Vol 6 (1) ◽  
Author(s):  
Shamsatun Nahar Ahmad ◽  
Nor’aini Aris
Keyword(s):  
Polynomial System ◽  
Polynomial Systems ◽  
Special Structure ◽  
Incremental Algorithm ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Newton Polytopes ◽  
The Matrix ◽  
Necessary And Sufficient ◽  
Resultant Matrix

The resultant matrix of a polynomial system depends on the geometry of its input Newton polytopes. Therefore for sparse inputs, the matrix is lower in dimension. The aim of the study is to infer conditions on the class of polynomial systems that can give a resultant matrix whose size is minimized, that is an optimal or Sylvester-type sparse resultant matrix. From the work of Emiris, the ‘incremental algorithm’ has been claimed to produce optimal matrices for the class of multi-homogeneous (or multigraded) systems of special structure. Cyclic polynomial systems for n-root problems also fall under this classification. We have applied the Maple multires package to obtain Sylvester-type matrices for some examples. The ultimate aim of the study is to verify whether the multigraded systems constitute to the only class of polynomial systems that can give sparse resultant optimal matrix; hence giving a necessary and sufficient condition for producing exact sparse resultants.

scholarly journals Integrated Recycling Process of Matrices of Organic Moulding Sands

2013 ◽  
Vol 58 (3) ◽  
pp. 809-812 ◽  
Author(s):  
R. Dańko
Keyword(s):  
Recycling Process ◽  
Conceptual Approach ◽  
Assessment Index ◽  
Experimental Stand ◽  
Synthetic Resins ◽  
The Matrix ◽  
Ignition Loss ◽  
On Line ◽  
The Given ◽  
Reclamation Process

Abstract The idea and experimental verification of assumptions of the integrated recycling process of matrices of uniform self-hardening moulding sands with synthetic resins, leading to obtaining moulding sands matrix of expected quality - is presented in the hereby paper. The basis of the presented process constitutes a combination of the method of forecasting averaged ignition losses of moulding sands after casting and defining the range of necessary matrix reclamation treatments in order to obtain its full recycling. Simultaneously, the empirically determined dependence of dusts amounts emitted during the reclamation process of the matrix from the given spent sand on the ignition loss values (which is the most proper assessment index of the obtained reclaimed material quality) was taken into account. The special experimental stand for investigations of the matrix recycling process was one of the elements of the conceptual approach and verification of its assumptions. The stand was equipped with the system of current on-line control of the purification degree of matrix grains from organic binder remains. The results of own investigations, allowing to combine ignition loss values of spent moulding sands after casting knocking out with amounts of dusts generated during the mechanical reclamation treatment of such sands, were utilized in the system.

scholarly journals State estimation for bilinear impulsive control systems under uncertainties

2018 ◽  
pp. 35-41 ◽  
Author(s):  
Oxana G. Matviychuk
Keyword(s):  
Differential Equations ◽  
State Estimation ◽  
Control Systems ◽  
Uncertain Systems ◽  
Impulsive Control ◽  
Compact Set ◽  
The Matrix ◽  
Initial States ◽  
Impulsive Control Systems ◽  
The Given

The state estimation problem for uncertain impulsive control systems with a special structure is considered. The initial states are taken to be unknown but bounded with given bounds. We assume here that the coefficients of the matrix included in the differential equations are not exactly known, but belong to the given compact set in the corresponding space. We present here algorithms that allow to find the external ellipsoidal estimates of reachable sets for such bilinear impulsive uncertain systems.

scholarly journals Homogenization of very rough three-dimensional interfaces for the poroelasticity theory with Biot's model

2019 ◽  
Author(s):  
Nguyen Thi Kieu ◽  
Pham Chi Vinh ◽  
Do Xuan Tung
Keyword(s):  
Incident Angle ◽  
Three Dimensional ◽  
Homogenization Method ◽  
Reflection And Transmission Coefficients ◽  
Biot Theory ◽  
Rough Interface ◽  
Matrix Formulation ◽  
Reflection And Transmission ◽  
Transmission Coefficients ◽  
The Matrix

In this paper, we carry out the homogenization of a very rough three-dimensional interface separating  two dissimilar generally anisotropic poroelastic solids modeled by the Biot theory. The very rough interface is assumed to be a cylindrical surface that rapidly oscillates between two parallel planes, and the motion is time-harmonic. Using the homogenization method with the matrix formulation of the poroelasicity theory, the explicit  homogenized equations have been derived. Since the obtained  homogenized equations are totally explicit, they are very convenient for solving various practical problems. As an example proving this, the reflection and transmission of SH waves at a very rough interface of tooth-comb type is considered. The closed-form analytical expressions of the reflection and transmission coefficients have been  derived. Based on them, the effect of the incident angle and some material parameters  on the reflection and transmission coefficients are examined numerically.

scholarly journals Transformation of land use pattern in the East Borsod coal basin from the beginning of minig industry to the political changes

2016 ◽  
Vol 10 (3-4) ◽  
pp. 223-231
Author(s):  
László Sütő ◽  
Erika Homoki ◽  
Zoltán Dobány ◽  
Péter Rózsa
Keyword(s):  
Land Cover ◽  
Human Disturbance ◽  
The Political ◽  
Early 20Th Century ◽  
Late Period ◽  
Topographic Map ◽  
Coal Basin ◽  
Land Use Pattern ◽  
The Matrix ◽  
The Given

Historical geographic studies on land cover may support the understanding of the recent state. Focusing on coal mining, this process was followed and analyzed in the case of the East Borsod Coal Basin from the early 20th century to the political change. The contemporaneous maps and manuscripts concerning the mining were evaluated using geoinformatic techniques. Moreover, digitalized topographic map coming from the early and late period of mining (1924 and 1989, respectively) were analyzed. To determine the degree of human disturbance hemerobic relations and changes of the given land cover patches were quantified on the basis of the maps of the three military surveys, too. It can be stated that montanogenic subtype of an industrialagricultural landscape has been formed in the Bükkhát area. Beside the concentrated artificial surfaces, however, relative dominance of forest forming the matrix of the landscape remained.

scholarly journals ВДОСКОНАЛЕНА ПОЛІНОМІАЛЬНО-СКЛАДНА АТАКА ВІДНОВЛЕННЯ ВІДКРИТОГО ТЕКСТУ НА РАНЦЕВИЙ ШИФР НА ОСНОВІ МАТРИЦЬ

2020 ◽  
pp. 67-74
Author(s):  
Олексій Сергійович Вамболь
Keyword(s):  
Discrete Logarithm ◽  
Public Information ◽  
Galois Field ◽  
Secret Key ◽  
The Matrix ◽  
Encryption Schemes ◽  
Shared Secret ◽  
Symmetric Key ◽  
Asymmetric Encryption ◽  
The Given

Asymmetric ciphers are widely used to ensure the confidentiality of data transmission via insecure channels. These cryptosystems allow the interacting parties to create a shared secret key for a symmetric cipher in such a way that an eavesdropper gets no information useful for cryptanalysis. Network security protocols that use asymmetric ciphers include TLS, S/MIME, OpenPGP, Tor, and many others. Some of the asymmetric encryption schemes are homomorphic, that is, that they allow calculations on encrypted data to be performed without preliminary decryption. The aforesaid property makes possible using these cryptosystems not only for symmetric key establishment but also in several areas of application, in particular in secret voting protocols and cloud computing. The matrix-based knapsack cipher is a new additively homomorphic asymmetric encryption scheme, which is based on the properties of isomorphic transformations of the inner direct product of diagonal subgroups of a general linear group over a Galois field. Unlike classic knapsack encryption schemes, the cryptographic strength of this cipher depends on the computational complexity of the multidimensional discrete logarithm problem. Despite some useful properties, further research into the cryptographic strength of the matrix-based knapsack cipher has found serious drawbacks inherent in this cryptographic scheme. In the given paper an improved polynomial-time plaintext-recovery attack on the matrix-based knapsack cipher is proposed. Applying this cryptanalytic method requires only public information and has time complexity O(t1.34), where t denotes the decryption time of the attacked cryptosystem. The aforementioned attack is more productive and easier to implement in software in comparison with the original one. The advantages of the proposed method are due to using in its algorithm the simple and relatively fast matrix trace operation instead of more complex and slower transformations.

scholarly journals The matrix formulation of type IIB five-branes

1998 ◽  
Vol 523 (1-2) ◽  
pp. 158-170 ◽  
Author(s):  
Savdeep Sethi
Keyword(s):  
Matrix Formulation ◽  
The Matrix
Sign in / Sign up

Export Citation Format

Share Document