Practice of operator relationships in symbolical calculus.
Presentations of finite simple groups: a computational approach
All finite simple groups of Lie type of rank over a field of size , with the possible exception of the Ree groups , have presentations with at most 49 relations and bit-length . Moreover, and have presentations with 3 generators; 7 relations and bit-length , while has a presentation with 6 generators, 25 relations and bit-length .
Primitives des fonctions élémentaires
Principal concepts of systems fuzzification. Fuzzification of systems for technical and medical practice. I
Probabilistic construction of small strongly sum-free sets via large Sidon sets
We give simple randomized algorithms leading to new upper bounds for combinatorial problems of Choi and Erdős: For an arbitrary additive group G let denote the set of all subsets S of G with n elements having the property that 0 is not in S+S. Call a subset A of G admissible with respect to a set S from if the sum of each pair of distinct elements of A lies outside S. Suppose first that S is a subset of the positive integers in the interval [2n,4n). Denote by f(S) the number of elements in a...
Program Algebra over an Algebra
We introduce an algebra with free variables, an algebra with undefined values, a program algebra over a term algebra, an algebra with integers, and an algebra with arrays. Program algebra is defined as universal algebra with assignments. Programs depend on the set of generators with supporting variables and supporting terms which determine the value of free variables in the next state. The execution of a program is changing state according to successor function using supporting terms.
Programming means for simulation of logical networks. II
Programming means for simulation of logical networks. III
Progress in developing Poisson-Boltzmann equation solvers
This review outlines the recent progress made in developing more accurate and efficient solutions to model electrostatics in systems comprised of bio-macromolecules and nanoobjects, the last one referring to objects that do not have biological function themselves but nowadays are frequently used in biophysical and medical approaches in conjunction with bio-macromolecules. The problem of modeling macromolecular electrostatics is reviewed from two different angles: as a mathematical task provided...
Propriétés de complexité pour une famille d'algorithmes de Markov
Puiseux series solutions of ordinary polynomial differential equations: complexity study.