Results 261 to 270 of about 20,142 (301)
Some of the next articles are maybe not open access.
Journal of Algorithms, 2002
Summary: Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern.
Meyer, U., Sibeyn, J.
openaire +3 more sources
Summary: Near-optimal gossiping algorithms are given for two-dimensional and higher dimensional tori, assuming the full-port store-and-forward communication model. For two-dimensional tori, a previous algorithm achieved optimality in an intricate way, with an adaptive routing pattern.
Meyer, U., Sibeyn, J.
openaire +3 more sources
Bulletin of the London Mathematical Society, 1986
We give a largely group-theoretic proof of Borel's theorem that the maximal tori of a connected soluble algebraic linear group are all conjugate; the usual proofs are more geometric. The trick is to reduce the problem, essentially to a consideration of finite groups, and then to use the Schur-Zassenhaus theorem.
openaire +2 more sources
We give a largely group-theoretic proof of Borel's theorem that the maximal tori of a connected soluble algebraic linear group are all conjugate; the usual proofs are more geometric. The trick is to reduce the problem, essentially to a consideration of finite groups, and then to use the Schur-Zassenhaus theorem.
openaire +2 more sources
Even Hamiltonian systems on Tori and cotangent spaces of Tori
Nonlinear Analysis: Theory, Methods & Applications, 1997This paper deals with \(2\pi\)-periodic solutions of Hamiltonian systems and reviews some results and ideas of proofs. The details can be found in the authors' papers [\textit{T. Bartsch} and \textit{Z.-Q. Wang}, Math. Z. 224, No. 1, 65-76 (1997; Zbl 0870.34046) and J. Differ. Equations 135, No. 1, 103-128 (1997; Zbl 0872.58050)].
Bartsch, Thomas, Wang, Zhi-Qiang
openaire +1 more source
Broadcasting in Unlabeled Tori
Parallel Processing Letters, 1998We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled torus: neither nodes nor links have a priori assigned labels but they know the topology and the size of the torus. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages.
Krzysztof Diks +2 more
openaire +1 more source
The Annals of Mathematics, 1961
Introduction ? 0. Notation and conventions ? 1. Arbitrary fields 1.1. Duality 1.2. Splitting fields 1.3. Isogenies 1.4. Raising the field of definition 1.5. A structure theorem 1.6. Differential forms ? 2. Local fields 2.1. Maximal compact groups 2.2. Isogenies 2.3. Reduction modulo p ? 3. Fields of dimension 1 3.1. Adelization 3.2.
openaire +1 more source
Introduction ? 0. Notation and conventions ? 1. Arbitrary fields 1.1. Duality 1.2. Splitting fields 1.3. Isogenies 1.4. Raising the field of definition 1.5. A structure theorem 1.6. Differential forms ? 2. Local fields 2.1. Maximal compact groups 2.2. Isogenies 2.3. Reduction modulo p ? 3. Fields of dimension 1 3.1. Adelization 3.2.
openaire +1 more source
2003
Distance counting in closed lattices such as toroids is presented. Analytical formulas and/or recursive relations are given for evaluation of the Wiener index and Hosoya polynomial in carbon tori.
Diudea, Mircea V. +4 more
openaire +2 more sources
Distance counting in closed lattices such as toroids is presented. Analytical formulas and/or recursive relations are given for evaluation of the Wiener index and Hosoya polynomial in carbon tori.
Diudea, Mircea V. +4 more
openaire +2 more sources
Flow map parameterization methods for invariant tori in Hamiltonian systems
Communications in Nonlinear Science and Numerical Simulation, 2021Alex Haro, J M Mondelo
exaly