Results 141 to 150 of about 1,588 (189)
Some of the next articles are maybe not open access.
Journal of Symbolic Logic, 1994
AbstractWe obtain a p-adic semilinear cell decomposition theorem using methods developed by Denef in [Journal für die Reine und Angewandte Mathematik, vol. 369 (1986), pp. 154–166]. We also prove that any set definable with quantifiers in (0,1, +, —, λq, Pn){n∈ℕ,q∈ℚp} may be defined without quantifiers, where λq is scalar multiplication by q and Pn is ...
openaire +2 more sources
AbstractWe obtain a p-adic semilinear cell decomposition theorem using methods developed by Denef in [Journal für die Reine und Angewandte Mathematik, vol. 369 (1986), pp. 154–166]. We also prove that any set definable with quantifiers in (0,1, +, —, λq, Pn){n∈ℕ,q∈ℚp} may be defined without quantifiers, where λq is scalar multiplication by q and Pn is ...
openaire +2 more sources
Journal of Mathematical Physics, 1988
Semilinear operators on a complex Hilbert space are studied in a part of a program that aims to develop the theories of additive operators on complex and quaternionic Hilbert spaces for application to problems in mathematical physics. The more notable among the new results proved on the eigenvalue problem for semilinear operators are the following: (i)
Sharma, C. S., Almeida, D. F.
openaire +2 more sources
Semilinear operators on a complex Hilbert space are studied in a part of a program that aims to develop the theories of additive operators on complex and quaternionic Hilbert spaces for application to problems in mathematical physics. The more notable among the new results proved on the eigenvalue problem for semilinear operators are the following: (i)
Sharma, C. S., Almeida, D. F.
openaire +2 more sources
On the Boundedness Property of Semilinear Sets
2013An additive system to generate a semilinear set is k-bounded if it can generate any element of the set by repeatedly adding vectors according to its rules so that pairwise differences between components in any intermediate vector are bounded by k except for those that have achieved their final target value.
Oscar H. Ibarra, Shinnosuke Seki 0001
openaire +1 more source
Ultrahomogeneous Semilinear Spaces
Proceedings of the London Mathematical Society, 2002Recall that a semilinear space \(S\) is a non-empty set of elements called points, provided with a collection of subsets called lines such that any pair of points is contained in at most one line and every line contains at least two points. Note that semilinear spaces are a common generalization of graphs and of linear spaces.
openaire +3 more sources
Semilinear Motion Planning in REDLOG
Applicable Algebra in Engineering, Communication and Computing, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Kybernetika, 2009
Summary: We introduce four families of semilinear copulas (i.e., copulas that are linear in at least one coordinate of any point of the unit square) of which the diagonal and opposite diagonal sections are given functions. For each of these families, we provide necessary and sufficient conditions under which given diagonal and opposite diagonal ...
Tarad Jwaid +2 more
openaire +2 more sources
Summary: We introduce four families of semilinear copulas (i.e., copulas that are linear in at least one coordinate of any point of the unit square) of which the diagonal and opposite diagonal sections are given functions. For each of these families, we provide necessary and sufficient conditions under which given diagonal and opposite diagonal ...
Tarad Jwaid +2 more
openaire +2 more sources
Semilinear Hamiltonian Schroedinger systems
International Journal of Dynamical Systems and Differential Equations, 2011In this paper we investigate on local and global existence for some semilinear Schrodinger systems having conservation of the energy and masses. Moreover we presents some blowing up examples for 2 × 2 systems.
FANELLI, Luca +2 more
openaire +2 more sources
The complexity of semilinear sets
1980In this paper we shall characterize the computational complexity of two decision problems: the inequality problem and the uniform word problem for semilinear sets. It will be proved that the first problem is log-complete in the second class (Σp2) of the polynomial-time hierarchy and the second problem is log-complete in NP.
openaire +2 more sources
Stably computable predicates are semilinear
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 2006We consider the model of population protocols introduced by Angluin et al. [2], in which anonymous finite-state agents stably compute a predicate of their inputs via two-way interactions in the all-pairs family of communication networks. We prove that all predicates stably computable in this model (and certain generalizations of it) are semilinear ...
Dana Angluin +2 more
openaire +1 more source
Kybernetika, 2007
Summary: We complement the recently introduced classes of lower and upper semilinear copulas by two new classes, called vertical and horizontal semilinear copulas, and characterize the corresponding class of diagonals. The new copulas are in essence asymmetric, with maximum asymmetry given by \(1/16\).
Bernard De Baets +2 more
openaire +2 more sources
Summary: We complement the recently introduced classes of lower and upper semilinear copulas by two new classes, called vertical and horizontal semilinear copulas, and characterize the corresponding class of diagonals. The new copulas are in essence asymmetric, with maximum asymmetry given by \(1/16\).
Bernard De Baets +2 more
openaire +2 more sources