scholarly journals Subalgebra analogue of Standard bases for ideals in $ K[[t_{1}, t_{2}, \ldots, t_{m}]][x_{1}, x_{2}, \ldots, x_{n}] $

2021 ◽  
Vol 7 (3) ◽  
pp. 4485-4501
Author(s):  
Nazia Jabeen ◽  
◽  
Junaid Alam Khan
Keyword(s):  
Normal Form ◽  
Finitely Generated ◽  
Standard Bases ◽  
Monomial Ordering

<abstract><p>In this paper, we develop a theory for Standard bases of $ K $-subalgebras in $ K[[t_{1}, t_{2}, \ldots, t_{m}]] [x_{1}, x_{2}, ..., x_{n}] $ over a field $ K $ with respect to a monomial ordering which is local on $ t $ variables and we call them Subalgebra Standard bases. We give an algorithm to compute subalgebra homogeneous normal form and an algorithm to compute weak subalgebra normal form which we use to develop an algorithm to construct Subalgebra Standard bases. Throughout this paper, we assume that subalgebras are finitely generated.</p></abstract>

scholarly journals Computation of minimal homogeneous generating sets and minimal standard bases for ideals of free algebras

2018 ◽  
Vol 25 (3) ◽  
pp. 451-459
Author(s):  
Huishi Li
Keyword(s):  
Free Algebra ◽  
Standard Basis ◽  
Free Algebras ◽  
Grobner Basis ◽  
Finitely Generated ◽  
Generating Set ◽  
Standard Bases ◽  
Generating Sets ◽  
Monomial Ordering ◽  
Minimal Standard

AbstractLet {K\langle X\rangle=K\langle X_{1},\ldots,X_{n}\rangle} be the free algebra generated by {X=\{X_{1},\ldots,X_{n}\}} over a field K. It is shown that, with respect to any weighted {\mathbb{N}}-gradation attached to {K\langle X\rangle}, minimal homogeneous generating sets for finitely generated graded two-sided ideals of {K\langle X\rangle} can be algorithmically computed, and that if an ungraded two-sided ideal I of {K\langle X\rangle} has a finite Gröbner basis {{\mathcal{G}}} with respect to a graded monomial ordering on {K\langle X\rangle}, then a minimal standard basis for I can be computed via computing a minimal homogeneous generating set of the associated graded ideal {\langle\mathbf{LH}(I)\rangle}.

Abelian Semigroups of Matrices on ℂn and Hypercyclicity

2013 ◽  
Vol 57 (2) ◽  
pp. 323-338 ◽  
Author(s):  
Adlene Ayadi ◽  
Habib Marzougui
Keyword(s):  
Normal Form ◽  
Complete Characterization ◽  
Finitely Generated ◽  
Abelian Semigroup

AbstractWe give a complete characterization of a hypercyclic abelian semigroup of matrices on ℂn. For finitely generated semigroups, this characterization is explicit and it is used to determine the minimal number of matrices in normal form over ℂ that form a hypercyclic abelian semigroup on ℂn. In particular, we show that no abelian semigroup generated by n matrices on ℂn can be hypercyclic.

Standard Gröbner-Shirshov Bases of Free Algebras Over Rings, I

1998 ◽  
Vol 08 (06) ◽  
pp. 689-726 ◽  
Author(s):  
Alexander A. Mikhalev ◽  
Andrej A. Zolotykh
Keyword(s):  
Associative Algebra ◽  
Standard Basis ◽  
Free Associative Algebra ◽  
Semigroup Algebras ◽  
Finitely Generated ◽  
Associative Algebras ◽  
Standard Bases ◽  
Equality Problem ◽  
Algebra Over A Field ◽  
The Ideal

We consider standard bases of ideals of free associative algebras over rings. The main result of the article is a criterion for a subset of a free associative algebra to be a standard basis of the ideal it generates. Based on this result, we present an infinite algorithm to construct the reduced standard basis of an ideal. A generalization in case of some semigroup algebras is presented. We also describe a way to construct weak standard bases and reduced standard bases of ideals of a free associative algebra over an arbitrary finitely generated ring (over a finitely generated algebra over a field). Some examples of constructions of standard bases and of solutions of the equality problem are included.

Closing the GAP—A 5Å Scanning Microscope

1969 ◽  
Vol 27 ◽  
pp. 6-7
Author(s):  
A. V. Crewe
Keyword(s):  
Normal Form ◽  
The Other ◽  
Resolving Power ◽  
Scanning Microscope ◽  
Conventional Microscope ◽  
Other Hand ◽  
Closing The Gap ◽  
Thermal Sources ◽  
Better Than ◽  
Transmission Microscope

We have become accustomed to differentiating between the scanning microscope and the conventional transmission microscope according to the resolving power which the two instruments offer. The conventional microscope is capable of a point resolution of a few angstroms and line resolutions of periodic objects of about 1Å. On the other hand, the scanning microscope, in its normal form, is not ordinarily capable of a point resolution better than 100Å. Upon examining reasons for the 100Å limitation, it becomes clear that this is based more on tradition than reason, and in particular, it is a condition imposed upon the microscope by adherence to thermal sources of electrons.

Automorphisms of finite order of nilpotent groups II

2014 ◽  
Vol 51 (4) ◽  
pp. 547-555 ◽  
Author(s):  
B. Wehrfritz
Keyword(s):  
Nilpotent Group ◽  
Finite Order ◽  
Finite Index ◽  
Nilpotent Groups ◽  
Finitely Generated

Let G be a nilpotent group with finite abelian ranks (e.g. let G be a finitely generated nilpotent group) and suppose φ is an automorphism of G of finite order m. If γ and ψ denote the associated maps of G given by \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\gamma :g \mapsto g^{ - 1} \cdot g\phi and \psi :g \mapsto g \cdot g\phi \cdot g\phi ^2 \cdots \cdot \cdot g\phi ^{m - 1} for g \in G,$$ \end{document} then Gγ · kerγ and Gψ · ker ψ are both very large in that they contain subgroups of finite index in G.

METHODS OF REDUCING OF LARGE BOOLEAN FORMULAS REPRESENTED IN A CONJUNCTIVE NORMAL FORM FOR DETERMINING THEIR SATISFIABILITY

2020 ◽  
Author(s):  
N.I. Gdansky ◽  
◽  
A.A. Denisov ◽  
Keyword(s):  
Normal Form ◽  
Normal Forms ◽  
Conjunctive Normal Form ◽  
Boolean Formulas

The article explores the satisfiability of conjunctive normal forms used in modeling systems.The problems of CNF preprocessing are considered.The analysis of particular methods for reducing this formulas, which have polynomial input complexity is given.

Analysis of a 2DOF Nonlinear Mechanical System Using the Normal Form Method

2019 ◽  
Author(s):  
David Julian Gonzalez Maldonado ◽  
Peter Hagedorn ◽  
Thiago Ritto ◽  
Rubens Sampaio ◽  
Artem Karev
Keyword(s):  
Normal Form ◽  
Mechanical System ◽  
Nonlinear Mechanical ◽  
Nonlinear Mechanical System ◽  
Normal Form Method

Normal form method in search for periodic solutions of ordinary differential equations. Case of the fourth order

2018 ◽  
pp. 24-34
Author(s):  
V. F. Edneral ◽  
O. D. Timofeevskaya
Keyword(s):  
Normal Form ◽  
Differential Equations ◽  
Ordinary Differential Equations ◽  
Periodic Solutions ◽  
Fourth Order ◽  
Numerical Solutions ◽  
Numerical Calculations ◽  
Computational Time ◽  
Resonant Normal Form ◽  
Normal Form Method

Introduction:The method of resonant normal form is based on reducing a system of nonlinear ordinary differential equations to a simpler form, easier to explore. Moreover, for a number of autonomous nonlinear problems, it is possible to obtain explicit formulas which approximate numerical calculations of families of their periodic solutions. Replacing numerical calculations with their precalculated formulas leads to significant savings in computational time. Similar calculations were made earlier, but their accuracy was insufficient, and their complexity was very high.Purpose:Application of the resonant normal form method and a software package developed for these purposes to fourth-order systems in order to increase the calculation speed.Results:It has been shown that with the help of a single algorithm it is possible to study equations of high orders (4th and higher). Comparing the tabulation of the obtained formulas with the numerical solutions of the corresponding equations shows good quantitative agreement. Moreover, the speed of calculation by prepared approximating formulas is orders of magnitude greater than the numerical calculation speed. The obtained approximations can also be successfully applied to unstable solutions. For example, in the Henon — Heyles system, periodic solutions are surrounded by chaotic solutions and, when numerically integrated, the algorithms are often unstable on them.Practical relevance:The developed approach can be used in the simulation of physical and biological systems.

Sign in / Sign up

Export Citation Format

Share Document