Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Discrete & computational geometry 5 (1990), S. 263-288 
    ISSN: 1432-0444
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A hyperplane arrangement is a finite set of hyperplanes through the origin in a finite-dimensional real vector space. Such an arrangement divides the vector space into a finite set of regions. Every such region determines a partial order on the set of all regions in which these are ordered according to their combinatorial distance from the fixed base region. We show that the base region is simplicial whenever the poset of regions is a lattice and that conversely this condition is sufficient for the lattice property for three-dimensional arrangements, but not in higher dimensions. For simplicial arrangements, the poset of regions is always a lattice. In the case of supersolvable arrangements (arrangements for which the lattice of intersections of hyperplanes is supersolvable), the poset of regions is a lattice if the base region is suitably chosen. We describe the geometric structure of such arrangements and derive an expression for the rank-generating function similar to a known one for Coxeter arrangements. For arrangements with a lattice of regions we give a geometric interpretation of the lattice property in terms of a closure operator defined on the set of hyperplanes. The results generalize to oriented matroids. We show that the adjacency graph (and poset of regions) of an arrangement determines the associated oriented matroid and hence in particular the lattice of intersections.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Annals of the New York Academy of Sciences 555 (1989), S. 0 
    ISSN: 1749-6632
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Natural Sciences in General
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 17 (1997), S. 53-65 
    ISSN: 1439-6912
    Keywords: 05 E 99 ; 55 M 99 ; 05 D 05 ; 55 N 99
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A multicomplexM is a collection of monomials closed under divisibility. For suchM we construct a cell complex ΔM whosei-dimensional cells are in bijection with thef i monomials ofM of degreei+1. The bijection is such that the inclusion relation of cells corresponds to divisibility of monomials. We then study relations between the numbersf i and the Betti numbers of ΔM. For squarefree monomials the construction specializes to the standard geometric realization of a simplicial complex.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 1 (1992), S. 305-328 
    ISSN: 1572-9192
    Keywords: chip-firing game ; vector addition system ; reachability ; random walk ; probabilistic abacus ; Laplace operator ; Petri net
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the following (solitary) game: each node of a directed graph contains a pile of chips. A move consists of selecting a node with at least as many chips as its outdegree, and sending one chip along each outgoing edge to its neighbors. We extend to directed graphs several results on the undirected version obtained earlier by the authors, P. Shor, and G. Tardos, and we discuss some new topics such as periodicity, reachability, and probabilistic aspects. Among the new results specifically concerning digraphs, we relate the length of the shortest period of an infinite game to the length of the longest terminating game, and also to the access time of random walks on the same graph. These questions involve a study of the Laplace operator for directed graphs. We show that for many graphs, in particular for undirected graphs, the problem whether a given position of the chips can be reached from the initial position is polynomial time solvable. Finally, we show how the basic properties of the “probabilistic abacus” can be derived from our results.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 5 (1996), S. 291-314 
    ISSN: 1572-9192
    Keywords: cohomology ; characteristic polynomial ; Coxeter subspace arrangement ; homotopy ; homology ; lexicographic shellability ; signed graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let $$\mathcal{D}$$ n,k be the family of linear subspaces of ℝn given by all equations of the form $$\varepsilon _1 x_{l_1 } = \varepsilon _2 x_{l_2 } = \cdots = \varepsilon _k x_{l_k } ,$$ for 1≤il〈⋯〈i k ≤n and (∈1,...,∈ k )∈{+1,−1} k . Also let B n,k,h be $$\mathcal{D}_{n,k} $$ enlarged by the subspaces $$x_{j_1 } = x_{j_2 } = \cdots = x_{j_h } = 0,$$ for 1 ≤ j1 〈⋯〈 jh ≤ n.The special cases B n,2,1 and $$\mathcal{D}_n $$ ,2 are well known as the reflection hyperplane arrangements corresponding to the Coxeter groups of type B n and D n, respectively. In this paper we study combinatorial and topological properties of the intersection lattices of these subspace arrangements. Expressions for their Möbius functions and characteristic polynomials are derived. Lexicographic shellability is established in the case of B n,k,h , 1 ≤ h 〈 k, which allows computation of the homology of its intersection lattice and the cohomology groups of the manifold M n,k,h =ℝ n \∪B n,k,h . For instance, it is shown that H d(Mn,k,k−1) is torsion-free and is nonzero if and only if d=t(k−2) for some t, 0 ≤ t ≤[n/k]. Torsion-free cohomology follows also for the complement in ℂ n of the complexification B n,k,h ℂ , 1 ≤ h 〈 k.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 5 (1996), S. 291-314 
    ISSN: 1572-9192
    Keywords: cohomology ; characteristic polynomial ; Coxeter subspace arrangement ; homotopy ; homology ; lexicographic shellability ; signed graph
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let $${\mathcal{D}}_{n,k} $$ be the family of linear subspaces of ℝn given by all equations of the form $$\varepsilon _1 x_{i_1 } = \varepsilon _2 x_{i_2 } = \cdot \cdot \cdot \varepsilon _k x_{i_k } ,$$ for 1 ≤ 〈 • • • 〈 i k ≤ i and $$\left( {\varepsilon _1 ,...,\varepsilon _k } \right)\varepsilon \left\{ { + 1, - 1} \right\}^k $$ Also let $${\mathcal{B}}_{n,k,h} $$ be $${\mathcal{D}}_{n,k} $$ enlarged by the subspaces $$x_{j_1 } = x_{j_2 } = \cdot \cdot \cdot x_{j_h } = 0,$$ for 1 ≤. The special cases $${\mathcal{B}}_{n,2,1} $$ and $${\mathcal{D}}_{n,2} $$ are well known as the reflection hyperplane arrangements corresponding to the Coxeter groups of type B nand D n respectively. In this paper we study combinatorial and topological properties of the intersection lattices of these subspace arrangements. Expressions for their Möbius functions and characteristic polynomials are derived. Lexicographic shellability is established in the case of $${\mathcal{B}}_{n,k,h,} 1 \leqslant h 〈 k$$ , which allows computation of the homology of its intersection lattice and the cohomology groups of the manifold $$\begin{gathered} {\mathcal{D}}_{n,2} \hfill \\ M_{n,k,h,} = {\mathbb{R}}^n \backslash \bigcup {{\mathcal{B}}_{n,k,h,} } \hfill \\ \end{gathered} $$ . For instance, it is shown that $$H^d \left( {M_{n,k,k - 1} } \right)$$ is torsion-free and is nonzero if and only if d = t(k − 2) for some $$t,0 \leqslant t \leqslant \left[ {{n \mathord{\left/ {\vphantom {n k}} \right. \kern-\nulldelimiterspace} k}} \right]$$ . Torsion-free cohomology follows also for the complement in ℂnof the complexification $${\mathcal{B}}_{n,k,h}^C ,1 \leqslant h 〈 k$$ .
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Acta applicandae mathematicae 4 (1985), S. 99-100 
    ISSN: 1572-9036
    Keywords: 03B99 ; 06A10 ; 54H25 ; Fixed points ; reflexive domains ; retracts ; posets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a recent paper in this journal, J. Soto-Andrade and F. J. Varela draw attention to the fact that ifR is a retract of a reflexive domain in a suitable category thenR has the fixed point property. They suggest [1], pp. 1 and 18, that conversely every structure with the fixed point property is a retract of a reflexive domain. In this note it is shown that ifR is a retract of a reflexive domain thenR R has the fixed point property. This leads to counterexamples to the suggestion of Soto-Andrade and Varela in the categoryPo of partially ordered sets and monotone maps.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Acta mathematica 161 (1988), S. 279-303 
    ISSN: 1871-2509
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...