Related papers: On Conditions Relating to Nonsolvability

The Levin conjecture was proposed by Levin in 1962 which conjectures the solvability of any group equation with coefficients in a torsion free group. The Levin conjecture is recently shown to hold for group equations of length seven by…

We introduce a new approach to modeling uncertainty based on plausibility measures. This approach is easily seen to generalize other approaches to modeling uncertainty, such as probability measures, belief functions, and possibility…

One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…

This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

Let $L/K$ be a finite Galois extension of fields with group $\Gamma$. Associated to each Hopf-Galois structure on $L/K$ is a group $G$ of the same order as the Galois group $\Gamma$. The type of the Hopf-Galois structure is by definition…

In the limit of infinite yield time for stresses, the hydrodynamic equations for viscoelastic, Non-Newtonian liquids such as polymer melts must reduce to that for solids. This piece of information suffices to uniquely determine the…

Giving a condition for the the amenability of groups, Rosenblatt and Willis, first introduced the concept of configuration. From the beginning of the theory, the question whether the concept of configuration equivalence coincides with the…

We develop a framework to test the Equivalence Principle (EP) under conditions where the quantum aspects of nature cannot be neglected, specifically in the context of interference phenomena with unstable particles. We derive the…

Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $\psi(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and…

We develop a framework to give upper bounds on the "practical" computational complexity of stability problems for a wide range of nonlinear continuous and hybrid systems. To do so, we describe stability properties of dynamical systems using…

The knapsack problem is a classic optimisation problem that has been recently extended in the setting of groups. Its study reveals to be interesting since it provides many different behaviours, depending on the considered class of groups.…

For a finite group $G$, we study the probability $sp(G)$ that, given two elements $x,y \in G$, the cyclic subgroup $\langle x \rangle$ is subnormal in the subgroup $\langle x, y \rangle$. This can be seen as an intermediate invariant…

We show that a natural notion of irreducibility implies connectedness in the Compact Quantum Group setting. We also investigate the converse implication and show it is related to Kaplansky's conjectures on group algebras.

We study the link between stably finiteness and stably projectionless-ness for $C^*$-algebras of solvable Lie groups. We show that these two properties are equivalent if the dimension of the group is not divisible by $4$; otherwise, they…

Any group that has a subnormal series, in which all factors are abelian and all except the last one are $p'$-torsion-free, can be embedded into a group with a subnormal series of the same length, with the same properties and such that any…

This paper studies finite-time stability and instability theorems in probability sense for stochastic nonlinear systems. Firstly, a new sufficient condition is proposed to guarantee that the considered system has a global solution.…

The show that the upper-left-corner problem and upper-right-corner problem for matrix groups with rational entries are undecidable. To reach this aim, we answer a question of Dixon from 1985 by proving the undecidability of the stabilizer…

In this paper, we propose a catalog of iterative methods for solving the Split Feasibility Problem in the non-convex setting. We study four different optimization formulations of the problem, where each model has advantageous in different…

An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…