Results 11 to 20 of about 326,492 (325)
Factorization in Formal Languages [PDF]
We consider several novel aspects of unique factorization in formal languages. We reprove the familiar fact that the set uf(L) of words having unique factorization into elements of L is regular if L is regular, and from this deduce an quadratic upper and
A Lempel +9 more
core +2 more sources
Factorizations of complete graphs into tadpoles
A tadpole (also a canoe paddle or lollipop) is a graph that arises from a cycle and a path by gluing a terminal vertex of the path to an arbitrary vertex of the cycle.
Michael Kubesa, Tom Raiman
doaj +1 more source
On Koopman and Perron-Frobenius operators of random dynamical systems
In this paper, we investigate the Koopman and the Perron-Frobenius operators of random dynamical systems in general setting. Moreover, we give some necessary and sufficient conditions for the existence of invariant densities for the ...
Hmissi Mohamed
doaj +1 more source
We use Voiculescu’s free probability theory to prove the existence of prime factors, hence answering a longstanding problem in the theory of von Neumann algebras.
openaire +3 more sources
Empirical study on the construction of a cognitive model of factorization in eighth-grade students
The construction of cognitive models is the basis for cognitive diagnosis, and the cognitive models will change based on the purpose of the study. According to the purpose of mathematical education, the cognitive factorization model is constructed based ...
Xu Zhangtao +4 more
doaj +1 more source
Selective factor VIII activation by the tissue factor–factor VIIa–factor Xa complex [PDF]
Publisher's Note: There is an Inside Blood Commentary on this article in this issue.
Yuichi Kamikubo +12 more
openaire +2 more sources
Factorization method for solving nonlocal boundary value problems in Banach space
This article deals with the factorization and solution of nonlocal boundary value problems in a Banach space of the abstract form B1 u = A u - S Φ( u )- G Ψ(A0 u) = f, u ∈ D (B1) , where A, A0 are linear abstract operators, S, G are vectors of functions,
I.N. Parasidis, E. Providas
doaj +1 more source
Analysis of the RSA-cryptosystem in abstract number rings
Quantum computers can be a real threat to some modern cryptosystems (such as the RSA-cryptosystem). The analogue of the RSA-cryptosystem in abstract number rings is not affected by this threat, as there are currently no factorization algorithms using ...
Nikita V. Kondratyonok
doaj +1 more source
Cycle frames and the Oberwolfach problem
For an integer denotes a graph with uniform edge-multiplicity Let be a subset of positive integers. A 2-regular subgraph of -partite graph containing vertices of all but one partite set is called partial 2-factor, where denotes wreath product and is an ...
Shanmuga Vadivu Andiyappan +1 more
doaj +1 more source
Zero product preserving bilinear operators acting in sequence spaces
Consider a couple of sequence spaces and a product function $-$ a canonical bilinear map associated to the pointwise product $-$ acting in it. We analyze the class of "zero product preserving" bilinear operators associated with this product, that are ...
E. Erdoğan
doaj +1 more source

