Notes on extended equation solvability and identity checking for groups

2019 ◽  
Vol 159 (1) ◽  
pp. 246-256
Author(s):  
M. Kompatscher
Keyword(s):  
Equation Solvability

scholarly journals Linear θ-Method and Compact θ-Method for Generalised Reaction-Diffusion Equation with Delay

2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Fengyan Wu ◽  
Qiong Wang ◽  
Xiujun Cheng ◽  
Xiaoli Chen
Keyword(s):  
Diffusion Equation ◽  
Necessary Conditions ◽  
Reaction Diffusion ◽  
Reaction Diffusion Equation ◽  
Stability And Convergence ◽  
Asymptotically Stable ◽  
Sufficient And Necessary Conditions ◽  
Equation Solvability ◽  
Equation With Delay ◽  
Theoretical Results

This paper is concerned with the analysis of the linear θ-method and compact θ-method for solving delay reaction-diffusion equation. Solvability, consistence, stability, and convergence of the two methods are studied. When θ∈[0,1/2), sufficient and necessary conditions are given to show that the two methods are asymptotically stable. When θ∈[1/2,1], the two methods are proven to be unconditionally asymptotically stable. Finally, several examples are carried out to confirm the theoretical results.

scholarly journals The extended equivalence and equation solvability problems for groups

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Gabor Horvath ◽  
Csaba Szabo
Keyword(s):  
Polynomial Time ◽  
Equivalence Problem ◽  
Nilpotent Groups ◽  
60Th Birthday ◽  
Special Issue ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Solvability Problem ◽  
Np Complete ◽  
Equation Solvability

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP-complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise.

The complexity of the equation solvability and equivalence problems over finite groups

2019 ◽  
Vol 30 (03) ◽  
pp. 607-623
Author(s):  
Attila Földvári ◽  
Gábor Horváth
Keyword(s):  
Abelian Group ◽  
Polynomial Time ◽  
Finite Groups ◽  
Finite Abelian Group ◽  
Equivalence Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Semidirect Products ◽  
Solvability Problem ◽  
Equation Solvability

We provide a polynomial time algorithm for deciding the equation solvability problem over finite groups that are semidirect products of a [Formula: see text]-group and an Abelian group. As a consequence, we obtain a polynomial time algorithm for deciding the equivalence problem over semidirect products of a finite nilpotent group and a finite Abelian group. The key ingredient of the proof is to represent group expressions using a special polycyclic presentation of these finite solvable groups.

scholarly journals The complexity of the equation solvability problem over semipattern groups

2017 ◽  
Vol 27 (02) ◽  
pp. 259-272 ◽  
Author(s):  
Attila Földvári
Keyword(s):  
Original Problem ◽  
Main Idea ◽  
Solvable Groups ◽  
Nilpotent Groups ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Matrix Groups ◽  
Semidirect Products ◽  
Solvability Problem ◽  
Equation Solvability

The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the equation solvability problem over certain semidirect products, where the first factor is not necessarily Abelian. Our main idea is to represent such groups as matrix groups, and reduce the original problem to equation solvability over the underlying field. Further, we apply this new method to give a much more efficient algorithm for equation solvability over nilpotent rings than previously existed.

Integro-differential Burgers equation. Solvability and homogenization

2010 ◽  
Vol 72 (11) ◽  
pp. 3953-3968
Author(s):  
Andrey Amosov ◽  
Grigory Panasenko
Keyword(s):  
Burgers Equation ◽  
Equation Solvability

scholarly journals Solvability of quasilinear elliptic equations with strong dependence on the gradient

2000 ◽  
Vol 5 (3) ◽  
pp. 159-173 ◽  
Author(s):  
Darko Žubrinić
Keyword(s):  
Elliptic Equations ◽  
Strong Dependence ◽  
Strong Solutions ◽  
Outer Radius ◽  
Regularity Of Solutions ◽  
Quasilinear Elliptic Equations ◽  
A Posteriori ◽  
The Right ◽  
Equation Solvability ◽  
Quasilinear Elliptic

We study the problem of existence of positive, spherically symmetric strong solutions of quasilinear elliptic equations involvingp-Laplacian in the ball. We allow simultaneous strong dependence of the right-hand side on both the unknown function and its gradient. The elliptic problem is studied by relating it to the corresponding singular ordinary integro-differential equation. Solvability range is obtained in the form of simple inequalities involving the coefficients describing the problem. We also study a posteriori regularity of solutions. An existence result is formulated for elliptic equations on arbitrary bounded domains in dependence of outer radius of domain.

Sign in / Sign up

Export Citation Format

Share Document