Springer Science and Business Media LLC

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
On (D,H)-analytic Sets and their Topological Applications
Springer Science and Business Media LLC - Tập 34 - Trang 235-248 - 1997
Eliza Wajch
An abstract concept of (D, H)-analytic sets is introduced and applied to characterizations of normality, perfect normality and Oz-spaces, as well as to some problems related to the theory of compactifications. A metrization theorem for pseudocompact spaces is deduced.
On a new class of inversive pseudorandom numbers for parallelized simulation methods
Springer Science and Business Media LLC - Tập 42 - Trang 77-87 - 2001
Harald Niederreiter, Arne Winterhof
Inversive methods are attractive alternatives to the linear method for pseudorandom number generation. A particularly attractive method is the digital explicit inversive method recently introduced by the authors. We establish some new results on the statistical properties of parallel streams of pseudorandom numbers generated by this method. In particular, we extend the results of the first author ...... hiện toàn bộ
Invariant Minimal Unit Vector Fields on Lie Groups
Springer Science and Business Media LLC - Tập 40 - Trang 123-133 - 2000
K. Tsukada, L. Vanhecke
We provide a new characterization of invariant minimal unit vector fields on Lie groups and use it to construct some new examples. In particular, we determine all these vector fields on three-dimensional Lie groups.
A random walk proof of the Erdős-Taylor conjecture
Springer Science and Business Media LLC - Tập 50 - Trang 223-245 - 2005
Jay Rosen
For the simple random walk in ]]>\mathbb{Z}^2$ we study those points which are visited an unusually large number of times, and provide a new proof of the Erdős-Taylor Conjecture describing the number of visits to the most visited point.
On graphs having domination number half their order
Springer Science and Business Media LLC - Tập 16 - Trang 287-293 - 1985
J. F. Fink, M. S. Jacobson, L. F. Kinch, J. Roberts
In this paper we present a characterization of connected graphs of order 2n with domination numbern. Using this class of graphs, we determine an infinite class of graphs with the property that the domination number of the product of any two is precisely the product of the domination numbers.
Một họ các đường cong elliptic có bậc $$\ge 5$$ Dịch bởi AI
Springer Science and Business Media LLC - Tập 71 - Trang 243-249 - 2015
Farzali Izadi, Kamran Nabardi
Trong bài báo này, chúng tôi xây dựng một họ các đường cong elliptic có bậc $$\ge 5$$. Để thực hiện điều này, chúng tôi sử dụng công thức Heron cho một bộ ba $$(A^2, B^2, C^2)$$ không nhất thiết phải là ba cạnh của một tam giác. Hóa ra rằng, với tư cách là các tham số của một họ đường cong elliptic, ba số nguyên dương A, B và C, cùng với tham số bổ sung D, thỏa mãn phương trình Diophantine bậc bốn...... hiện toàn bộ
Generalizations of theorems of J. Aczél and R. Ger and T. Kochanek
Springer Science and Business Media LLC - Tập 85 - Trang 203-209 - 2022
Marcin Balcerowski
We present a result which generalizes a theorem proved by Aczél (Bull Am Math Soc 54:392–400, 1948). Hence we obtain generalizations of a theorem proved by Ger and Kochanek (Colloq Math 115:87–99, 2009).
On the global balanced-projective dimension of valuation domains
Springer Science and Business Media LLC - Tập 46 - Trang 33-40 - 2003
L. Fuchs, K. M. Rangaswamy
Assuming the General Continuum Hypothesis, the global balanced-projective dimension of a valuation domain is determined. We show that it is always equal to the supremum of the projective dimensions of torsion-free modules.
Symmetric random walk in random environment in one dimension
Springer Science and Business Media LLC - - 2002
Katalin Nagy
We give a new proof of the central limit theorem for one dimensional symmetric random walk in random environment. The proof is quite elementary and natural. We show the convergence of the generators and from this we conclude the convergence of the process. We also investigate the hydrodynamic limit (HDL) of one dimensional symmetric simple exclusion in random environment and prove stochastic conve...... hiện toàn bộ
Hitting time fork edge-disjoint spanning trees in a random graph
Springer Science and Business Media LLC - Tập 31 - Trang 235-240 - 1995
E. M. Palmer, J. J. Spencer
We show that in almost every random graph process, the hitting time for havingk edge-disjoint spanning trees equals the hitting time for having minimum degreek.
Tổng số: 1,468   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10