The paper contains a review of the main results of Yerevan research group in planar stochastic geometry, in particular the second order random geometrical processes using the methods of integration of combinatorial decompositions and invariant imbedding. For the present review we have chosen the results...
57 PINK ISTVÁN_ NUMBER OF SOLUTIONS TO A SPECIAL TYPE OF UNIT EQUATIONS IN TWO UNKN 1:19:49 RUZSA IMRE_ HÉZAGOS BEURLING 51:34 ZÁBRÁDI GERGELY_ THE SUP-NORM PROBLEM FOR AUTOMORPHIC CUSP FORMS OF PGL(N,Z[I]), 1:40:34 EMMANUEL KOWALSKI_ SIDON SETS IN ALGEBRAIC GEOMETRY 1:...
On a Problem of Erds in Combinatorial Geometry In this thesis, we solve a long-standing open problem in combinatorial geometry known as the empty-hexagon problem or 6-hole problem. Erdos asked in 1977 whether every sufficiently large set of points in general position in the plane con... T ...
We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as minimum spanning trees and Steiner minimum trees. In particular, ...
Algorithms and Combinatorics(共27册), 这套丛书还有 《Matrices and Matroids for Systems Analysis》《Optimal Interconnection Trees in the Plane》《Geometry of Cuts and Metrics》《Boolean Function Complexity 2012》《The Mathematics of Paul Erdos》 等。
1.of, pertaining to, or involving the combination of elements, as in phonetics or music. 2.of or pertaining to the enumeration of the number of ways of doing or arranging something in a specific way. 3.of or pertaining to mathematical combinations. ...
In addition to some necessary conditions and counterexamples, we show that rectangle arrangements pierced by a horizontal line are squarable under certain sufficient conditions. 展开 关键词: Computer Science - Computational Geometry DOI: 10.1007/978-3-319-27261-0_20 ...
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficiently. First, we give a data structure that can be used to compute the poin
Summary: In this contribution, we propose the notion of homotopy for both combinatorial maps and weighted combinatorial maps. We also describe transformati... J Marchadier,WG Kropatsch,A Hanbury - Discrete Geometry for Computer Imagery, International Conference, Dgci, Naples, Italy, November 被引量...
Coherent configurations are combinatorial objects invented for the purpose of studying finite permutation groups; every permutation group which is not doubly transitive preserves a non-trivial coherent configuration. However, symmetric c... PJ Cameron - Groups, Combinatorics & Geometry 被引量: 72发表: ...