On some classes of algebraic surfaces with an infinite set of subspaces of skew symmetry

1993 ◽  
Vol 65 (3) ◽  
pp. 1700-1705
Author(s):  
V. F. Ignatenko
Keyword(s):  
Algebraic Surfaces ◽  
Infinite Set

On algebraic surfaces with an infinite set of planes of skew symmetry

1998 ◽  
Vol 90 (6) ◽  
pp. 2501-2504
Author(s):  
V. F. Ignatenko ◽  
Issam Diban
Keyword(s):  
Algebraic Surfaces ◽  
Infinite Set

scholarly journals A Note on On-Line Ramsey Numbers for Some Paths

Mathematics ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 735
Author(s):  
Tomasz Dzido ◽  
Renata Zakrzewska
Keyword(s):  
Ramsey Number ◽  
Ramsey Numbers ◽  
Minimum Number ◽  
On Line ◽  
Infinite Set ◽  
Do So

We consider the important generalisation of Ramsey numbers, namely on-line Ramsey numbers. It is easiest to understand them by considering a game between two players, a Builder and Painter, on an infinite set of vertices. In each round, the Builder joins two non-adjacent vertices with an edge, and the Painter colors the edge red or blue. An on-line Ramsey number r˜(G,H) is the minimum number of rounds it takes the Builder to force the Painter to create a red copy of graph G or a blue copy of graph H, assuming that both the Builder and Painter play perfectly. The Painter’s goal is to resist to do so for as long as possible. In this paper, we consider the case where G is a path P4 and H is a path P10 or P11.

Density of sets with missing differences and applications

2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai
Keyword(s):  
Number Theory ◽  
Asymptotic Density ◽  
Theory Problem ◽  
Distance Graphs ◽  
Positive Integers ◽  
Infinite Set

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.

Sign in / Sign up

Export Citation Format

Share Document