In this paper we present some results concerning the median points of a discrete set according to a distance defined by means of two directions p and q . We describe a local characterization of the median points and show how these points can be determined from the projections of the discrete...
In this paper, we describe a new infinite family of $$\frac{q^{2}-1}{2}$$ -tight sets in the hyperbolic quadrics $${\mathcal {Q}}^{+}(5,q)$$ , for $$q \equiv 5 ext{ or } 9 \,\hbox {mod}\,{12}$$ . Under the Klein correspondence, these correspond to Cameron–L...
We present upper bounds on the bit-size of coefficients of non-radical purely lexicographical Grbner bases (triangular sets) in dimension zero. This extends a previous work [4], constrained to... 关键词: Computer Science - Symbolic Computation DOI: 10.1007/978-3-319-72453-9_19 年份: 2017...
Discrete Appl. Math. (1989) C. Berge et al. Strongly perfect graphs Ann. Discrete Math. (1984) A.A. Bertossi Dominating sets for split and bipartite graphs Inform. Process. Lett. (1984) A.A. Bertossi Total domination in interval graphs Inform. Process. Lett. (1986) A.A. Bertossi et...
, Contemporary Design Theory, a Collection of Surveys, Wiley–Interscience Series in Discrete Mathematics and Optimization, Wiley, New York (1992), pp. 241-324 Google Scholar 16 E.S. Lander Symmetric Designs, an Algebraic Approach, Cambridge Univ. Press, Cambridge (1983) Google Scholar 17 R. ...
the development of algebraic methods in discrete geometry lead to a breakthrough of Guth and Katz [16], who showed that the quantity in the first question is, which almost matches Erdős’ upper bound. ForwithSolymosi and Vu [26] proved that the quantity in the first question is, while ...
We show that if n sets in a topological space are given so that all the sets are closed or all are open, and for each k ≤ n every k of the sets have a (k - 2)-connected union, then the n sets have a point in common. As a consequence, we obtain the following starshaped ve...
Probabilistic neural network with homogeneity testing in recognition of discrete patterns set The article is devoted to pattern recognition task with the database containing small number of samples per class. By mapping of local continuous feature v... Savchenko,V A. - 《Neural Networks the Official...
A contagious process evolves in discrete rounds. The set of active vertices in round i>0 is Ai=Ai−1∪{v:|N(v)∩Ai−1|≥r},where N(v) is the set of neighbors of v. That is, a vertex becomes active irrevocably in a given round if it has at least r active neighbors. We ...
Soc.288 (1985), 51–57) has given a sufficient condition for the Lie algebra associated with a discrete group's lower central series to have a certain presentation, and S. Halperin and J.-M. Lemaire (Math. Scand., in press) have discussed the conditions under which some homogeneous ...