Search results for "rete"
showing 10 items of 3470 documents
On closures of discrete sets
2018
The depth of a topological space $X$ ($g(X)$) is defined as the supremum of the cardinalities of closures of discrete subsets of $X$. Solving a problem of Mart\'inez-Ruiz, Ram\'irez-P\'aramo and Romero-Morales, we prove that the cardinal inequality $|X| \leq g(X)^{L(X) \cdot F(X)}$ holds for every Hausdorff space $X$, where $L(X)$ is the Lindel\"of number of $X$ and $F(X)$ is the supremum of the cardinalities of the free sequences in $X$.
The case of equality in the dichotomy of Mohammadi–Oh
2019
If $n \geq 3$ and $\Gamma$ is a convex-cocompact Zariski-dense discrete subgroup of $\mathbf{SO}^o(1,n+1)$ such that $\delta_\Gamma=n-m$ where $m$ is an integer, $1 \leq m \leq n-1$, we show that for any $m$-dimensional subgroup $U$ in the horospheric group $N$, the Burger-Roblin measure associated to $\Gamma$ on the quotient of the frame bundle is $U$-recurrent.
Explicit Measure Computations for Simplicial Trees and Graphs of Groups
2019
In this chapter, we compute skinning measures and Bowen{Margulis measures for some highly symmetric simplicial trees X endowed with a nonelementary discrete subgroup Г of Aut(X).
Random Walks on Weighted Graphs of Groups
2019
Let X be a locally finite simplicial tree without terminal vertices, and let X = ∣X∣1 be its geometric realisation. Let Γ be a nonelementary discrete subgroup of Aut(X).
On the lattice of J-subnormal subgroups
1992
On the Deskins index complex of a maximal subgroup of a finite group
1999
AbstractLet M be a maximal subgroup of a finite group G. A subgroup C of G is said to be a completion of M in G if C is not contained in M while every proper subgroup of C which is normal in G is contained in M. The set, I(M), of all completions of M is called the index complex of M in G. Set P(M) = {C ϵ I(M) ¦ C} is maximal in I(M) and G = CM. The purpose of this note is to prove: A finite group G is solvable if and only if, for each maximal subgroup M of G, P(M) contains element C with CK(C) nilpotent.
The Bourgain property and convex hulls
2007
Let (Ω, Σ, μ) be a complete probability space and let X be a Banach space. We consider the following problem: Given a function f: Ω X for which there is a norming set B ⊂ BX * such that Zf,B = {x * ○ f: x * ∈ B } is uniformly integrable and has the Bourgain property, does it follow that f is Birkhoff integrable? It turns out that this question is equivalent to the following one: Given a pointwise bounded family ℋ ⊂ ℝΩ with the Bourgain property, does its convex hull co(ℋ) have the Bourgain property? With the help of an example of D. H. Fremlin, we make clear that both questions have negative answer in general. We prove that a function f: Ω X is scalarly measurable provided that there is a n…
Varieties with at most quadratic growth
2010
Let V be a variety of non necessarily associative algebras over a field of characteristic zero. The growth of V is determined by the asymptotic behavior of the sequence of codimensions cn(V); n = 1; 2, … and here we study varieties of polynomial growth. Recently, for any real number a, 3 < a < 4, a variety V was constructed satisfying C1n^a < cn(V) < C2n^a; for some constants C1;C2. Motivated by this result here we try to classify all possible growth of varieties V such that cn(V) < Cn^a; with 0 < a < 2, for some constant C. We prove that if 0 < a < 1 then, for n large, cn(V) ≤ 1, whereas if V is a commutative variety and 1 < a < 2, then lim logn cn(V) = 1 o…
K-theory of function rings
1990
AbstractThe ring R of continuous functions on a compact topological space Xwith values in R or C is considered. It is shown that the algebraic K-theory of such rings with coefficients in ZkZ, k any positive integer, agrees with the topological K-theory of the underlying space X with the same coefficient rings. The proof is based on the result that the map from Rδ (R with discrete topology) to R (R with compact-open topology) induces a natural isomorphism between the homologies with coefficients in ZkZ of the classifying spaces of the respective infinite general linear groups. Some remarks on the situation with X not compact are added.
An algorithm for the Rural Postman problem on a directed graph
1986
The Directed Rural Postman Problem (DRPP) is a general case of the Chinese Postman Problem where a subset of the set of arcs of a given directed graph is ‘required’ to be traversed at minimum cost. If this subset does not form a weakly connected graph but forms a number of disconnected components the problem is NP-Complete, and is also a generalization of the asymmetric Travelling Salesman Problem. In this paper we present a branch and bound algorithm for the exact solution of the DRPP based on bounds computed from Lagrangean Relaxation (with shortest spanning arborescence sub-problems) and on the fathoming of some of the tree nodes by the solution of minimum cost flow problems. Computation…