نتایج جستجو برای: krulls intersection theorem

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

Journal: :bulletin of the iranian mathematical society 0
b. omoomi department of mathematical sciences‎, ‎isfahan university of technology‎, ‎84156-83111‎, ‎isfahan‎, ‎iran. z. maleki department of mathematical sciences, isfahan university of technology, 84156-83111, isfahan, iran

‎for a set of non-negative integers~$l$‎, ‎the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$‎. ‎the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...

2012
Sotiris E. Nikoletseas Christoforos Raptopoulos Paul G. Spirakis

In this paper, we relate the problem of finding a maximum clique to the intersection number of the input graph (i.e. the minimum number of cliques needed to edge cover the graph). In particular, we consider the maximum clique problem for graphs with small intersection number and random intersection graphs (a model in which each one of m labels is chosen independently with probability p by each ...

Journal: :Math. Oper. Res. 2000
Yakar Kannai Myrna Holtz Wooders

Reny and Wooders (1998) showed that there is some point in the intersection of sets in Shapley’s (1973) generalization of the Knaster-Kuratowski-Mazurkiwicz Theorem with the property that the collection of all sets containing that point is partnered as well as balanced. We provide a further extension by showing that the collection of all such sets can be chosen to be strictly balanced, implying...

2012
Sylvain Salvati Giulio Manzonetto Mai Gehrke Hendrik Pieter Barendregt

In simply typed λ-calculus with one ground type the following theorem due to Loader holds. (i) Given the full model F over a finite set, the question whether some element f ∈ F is λ-definable is undecidable. In the λ-calculus with intersection types based on countably many atoms, the following is proved by Urzyczyn. (ii) It is undecidable whether a type is inhabited. Both statements are major r...

Journal: :Proceedings of the American Mathematical Society 2021

The purpose of this article is to point out a mistake in the published paper Graphs hyperbolic groups and limit set intersection theorem- Proc AMS, vol 146, no 5, pp 1859--1871, which subsequently weakens main theorem that paper. We state prove weaker result note.

2013
M. Angeles Alfonseca Jaegil Kim

One of the fundamental results regarding intersection bodies is Busemann’s theorem, which states that the intersection body of a symmetric convex body is convex. Thus, it is natural to ask how much of convexity is guaranteed under the intersection body operation. In this paper we provide several results about the (strict) improvement of convexity for intersection bodies of symmetric bodies of r...

Journal: :Proceedings of the American Mathematical Society 1980

Journal: :Proceedings of the American Mathematical Society 2017

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

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