نتایج جستجو برای: dense set

تعداد نتایج: 718148  

Journal: :Proceedings of the Edinburgh Mathematical Society 2022

Abstract We prove that certain families of homogenous affine iterated function systems in $\mathbb {R}^{d}$ have the property open set condition and existence exact overlaps both occur densely space translation parameters. These examples demonstrate theorems Falconer Jordan–Pollicott–Simon on almost sure dimensions self-affine sets measures, exceptional parameters can be a dense set. The proof ...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه شهید مدنی آذربایجان - دانشکده علوم پایه 1392

let g=(v,e) be a graph with vertex set v and edge set e.for two vertices u,v of g ,the closed interval i[u,v] ,consists of u,v and all vertices lying in some u-v geodesic in g.if s is a set of vertices of g then i[s]is the union of all sets i[u,v]for u,v ? s. if i[s]=v(g) , then s is a geodetic set for g.the geodetic number g(g) is the minimum cardinality of geodetic set.the maximum cardinalit...

Journal: :J. Graph Algorithms Appl. 2015
Patrizio Angelini Giordano Da Lozzo Giuseppe Di Battista Fabrizio Frati Maurizio Patrignani Ignaz Rutter

We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex u is represented by a geometric object R(u) and each edge (u, v) is represented by the intersection between R(u) and R(v), if it belongs to a dense subgraph, or by a curve connecting the boundaries ofR(u) andR(v), otherwise. We study a notion of plana...

Journal: :Turkish Journal of Computer and Mathematics Education (TURCOMAT) 2021

Journal: :Transactions of the American Mathematical Society 1992

Journal: :IEEE Communications Letters 2021

Ultra-reliability and low latency communication has long been an important but challenging task in the fifth sixth generation wireless systems. Scheduling as many users possible to serve on limited time-frequency resource is one of a crucial topic, subjecting maximum allowable transmission power minimum rate requirement each user. We address it by proposing mixed integer programming model, with...

Journal: :Comput. Geom. 2004
Dan Ismailescu Rados Radoicic

Given S1, a starting set of points in the plane, not all on a line, we define a sequence of planar point sets {Si}∞i=1 as follows. With Si already determined, let Li be the set of all the lines determined by pairs of points from Si , and let Si+1 be the set of all the intersection points of lines in Li . We show that with the exception of some very particular starting configurations, the limiti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید