2,946 research outputs found
Cuntz-Krieger algebras associated with Hilbert -quad modules of commuting matrices
Let be the -algebra associated with
the Hilbert -quad module arising from commuting matrices with
entries in . We will show that if the associated tiling space
is transitive, the -algebra is simple and purely infinite. In particulr, for two positive
integers , the -groups of the simple purely infinite -algebra
are computed by using the Euclidean
algorithm.Comment: 19 page
The Orchard crossing number of an abstract graph
We introduce the Orchard crossing number, which is defined in a similar way
to the well-known rectilinear crossing number. We compute the Orchard crossing
number for some simple families of graphs. We also prove some properties of
this crossing number.
Moreover, we define a variant of this crossing number which is tightly
connected to the rectilinear crossing number, and compute it for some simple
families of graphs.Comment: 17 pages, 10 figures. Totally revised, new material added. Submitte
On the classification of easy quantum groups
In 2009, Banica and Speicher began to study the compact quantum subgroups of
the free orthogonal quantum group containing the symmetric group S_n. They
focused on those whose intertwiner spaces are induced by some partitions. These
so-called easy quantum groups have a deep connection to combinatorics. We
continue their work on classifying these objects introducing some new examples
of easy quantum groups. In particular, we show that the six easy groups O_n,
S_n, H_n, B_n, S_n' and B_n' split into seven cases on the side of free easy
quantum groups. Also, we give a complete classification in the half-liberated
case.Comment: 39 pages; appeared in Advances in Mathematics, Vol. 245, pages
500-533, 201
Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
In 1973 Bermond, Germa, Heydemann and Sotteau conjectured that if divides
, then the complete -uniform hypergraph on vertices has a
decomposition into Hamilton Berge cycles. Here a Berge cycle consists of an
alternating sequence of distinct vertices and
distinct edges so that each contains and . So the
divisibility condition is clearly necessary. In this note, we prove that the
conjecture holds whenever and . Our argument is based on
the Kruskal-Katona theorem. The case when was already solved by Verrall,
building on results of Bermond
The Zero-Undetected-Error Capacity Approaches the Sperner Capacity
Ahlswede, Cai, and Zhang proved that, in the noise-free limit, the
zero-undetected-error capacity is lower bounded by the Sperner capacity of the
channel graph, and they conjectured equality. Here we derive an upper bound
that proves the conjecture.Comment: 8 Pages; added a section on the definition of Sperner capacity;
accepted for publication in the IEEE Transactions on Information Theor
On the Tutte-Krushkal-Renardy polynomial for cell complexes
Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from
graphs to cell complexes. We show that evaluating this polynomial at the origin
gives the number of cellular spanning trees in the sense of A. Duval, C.
Klivans, and J. Martin. Moreover, after a slight modification, the
Tutte-Krushkal-Renardy polynomial evaluated at the origin gives a weighted
count of cellular spanning trees, and therefore its free term can be calculated
by the cellular matrix-tree theorem of Duval et al. In the case of cell
decompositions of a sphere, this modified polynomial satisfies the same duality
identity as the original polynomial. We find that evaluating the
Tutte-Krushkal-Renardy along a certain line gives the Bott polynomial. Finally
we prove skein relations for the Tutte-Krushkal-Renardy polynomial..Comment: Minor revision according to a reviewer comments. To appear in the
Journal of Combinatorial Theory, Series
Expressive Messaging on Mobile Platforms
We present a design for expressive multimodal messaging on mobile platforms. Strong context, simple text messages, and crude animations combine well to produce surprisingly expressive results
Tameness and Artinianness of Graded Generalized Local Cohomology Modules
Let , \fa\supseteq \bigoplus_{n> 0}R_n and
and be a standard graded ring, an ideal of and two finitely generated
graded -modules, respectively. This paper studies the homogeneous components
of graded generalized local cohomology modules. First of all, we show that for
all , H^i_{\fa}(M, N)_n, the -th graded component of the -th
generalized local cohomology module of and with respect to \fa,
vanishes for all . Furthermore, some sufficient conditions are proposed
to satisfy the equality \sup\{\en(H^i_{\fa}(M, N))| i\geq 0\}=
\sup\{\en(H^i_{R_+}(M, N))| i\geq 0\}. Some sufficient conditions are also
proposed for tameness of H^i_{\fa}(M, N) such that i= f_{\fa}^{R_+}(M, N)
or i= \cd_{\fa}(M, N), where f_{\fa}^{R_+}(M, N) and \cd_{\fa}(M, N)
denote the -finiteness dimension and the cohomological dimension of
and with respect to \fa, respectively. We finally consider the Artinian
property of some submodules and quotient modules of H^j_{\fa}(M, N), where
is the first or last non-minimax level of H^i_{\fa}(M, N).Comment: 18pages, with some revisions and correction
On the equivariant main conjecture of Iwasawa theory
Recently, D. Burns and C. Greither (Invent. Math., 2003) deduced an
equivariant version of the main conjecture for abelian number fields. This was
the key to their proof of the equivariant Tamagawa number conjecture. A. Huber
and G. Kings (Duke Math. J., 2003) also use a variant of the Iwasawa main
conjecture to prove the Tamagawa number conjecture for Dirichlet motives. We
use the result of the second pair of authors and the Theorem of
Ferrero-Washington to reprove the equivariant main conjecture in a slightly
more general form. The main idea of the proof is essentially the same as in the
paper of D. Burns and C. Greither, but we can replace complicated
considerations of Iwasawa -invariants by a considerably simpler argument.Comment: 24 pages, minor changes, final version, to appear in Acta Arithmetic
- …
