Displaying similar documents to “Improvement of inequalities for the ( r , q ) -structures and some geometrical connections”

On stabbing triangles by lines in 3-space

Boris Aronov, Jiří Matoušek (1995)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We give an example of a set P of 3 n points in 3 such that, for any partition of P into triples, there exists a line stabbing Ω ( n ) of the triangles determined by the triples.

Incidence structures of type ( p , n )

František Machala (2003)

Czechoslovak Mathematical Journal

Similarity:

Every incidence structure 𝒥 (understood as a triple of sets ( G , M , I ) , I G × M ) admits for every positive integer p an incidence structure 𝒥 p = ( G p , M p , I p ) where G p ( M p ) consists of all independent p -element subsets in G ( M ) and I p is determined by some bijections. In the paper such incidence structures 𝒥 are investigated the 𝒥 p ’s of which have their incidence graphs of the simple join form. Some concrete illustrations are included with small sets G and M .

On Mazurkiewicz sets

Marta N. Charatonik, Włodzimierz J. Charatonik (2000)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

A Mazurkiewicz set M is a subset of a plane with the property that each straight line intersects M in exactly two points. We modify the original construction to obtain a Mazurkiewicz set which does not contain vertices of an equilateral triangle or a square. This answers some questions by L.D. Loveland and S.M. Loveland. We also use similar methods to construct a bounded noncompact, nonconnected generalized Mazurkiewicz set.

Simultaneous solution of linear equations and inequalities in max-algebra

Abdulhadi Aminu (2011)

Kybernetika

Similarity:

Let a ø p l u s b = max ( a , b ) and a ø t i m e s b = a + b for a , b . Max-algebra is an analogue of linear algebra developed on the pair of operations ( ø p l u s , ø t i m e s ) extended to matrices and vectors. The system of equations A ø t i m e s x = b and inequalities C ø t i m e s x ł e q d have each been studied in the literature. We consider a problem consisting of these two systems and present necessary and sufficient conditions for its solvability. We also develop a polynomial algorithm for solving max-linear program whose constraints are max-linear equations and inequalities.