Symmetric Powers of Motives

This chapter develops the basic theory of symmetric powers of smooth varieties. The constructions in this chapter are based on an analogy with the corresponding symmetric power constructions in topology. If 𝐾 is a set (or even a topological space) then the symmetric power 𝑆𝑚𝐾 is defined to be the orbit space 𝐾𝑚/Σ‎𝑚, where Σ‎𝑚 is the symmetric group. If 𝐾 is pointed, there is an inclusion 𝑆𝑚𝐾 ⊂ 𝑆𝑚+1𝐾 and 𝑆∞𝐾 = ∪𝑆𝑚𝐾 is the free abelian monoid on 𝐾 − {*}. When 𝐾 is a connected topological space, the Dold–Thom theorem says that ̃𝐻*(𝐾, ℤ) agrees with the homotopy groups π‎ *(𝑆∞𝐾). In particular, the spaces 𝑆∞(𝑆 𝑛) have only one homotopy group (𝑛 ≥ 1) and hence are the Eilenberg–Mac Lane spaces 𝐾(ℤ, 𝑛) which classify integral homology.

A dichotomy for groupoid -algebras

We study the finite versus infinite nature of C$^{\ast }$-algebras arising from étale groupoids. For an ample groupoid$G$, we relate infiniteness of the reduced C$^{\ast }$-algebra$\text{C}_{r}^{\ast }(G)$to notions of paradoxicality of a K-theoretic flavor. We construct a pre-ordered abelian monoid$S(G)$which generalizes the type semigroup introduced by Rørdam and Sierakowski for totally disconnected discrete transformation groups. This monoid characterizes the finite/infinite nature of the reduced groupoid C$^{\ast }$-algebra of$G$in the sense that if$G$is ample, minimal, topologically principal, and$S(G)$is almost unperforated, we obtain a dichotomy between the stably finite and the purely infinite for$\text{C}_{r}^{\ast }(G)$. A type semigroup for totally disconnected topological graphs is also introduced, and we prove a similar dichotomy for these graph$\text{C}^{\ast }$-algebras as well.

A special class of functional equations

We obtain in terms of additive and multi-additive functions the solutions f, h: S → H of the functional equation $$\begin{array}{} \displaystyle \sum\limits_{\lambda \in \Phi }f(x+\lambda y+a_{\lambda })=Nf(x)+h(y),\quad x,y\in S, \end{array} $$ where (S, +) is an abelian monoid, Φ is a finite group of automorphisms of S, N = | Φ | designates the number of its elements, {aλ, λ ∈ Φ} are arbitrary elements of S and (H, +) is an abelian group. In addition, some applications are given. This equation provides a joint generalization of many functional equations such as Cauchy’s, Jensen’s, Łukasik’s, quadratic or Φ-quadratic equations.

PERIODIC -GRAPH ALGEBRAS REVISITED

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph ${\rm\Lambda}$ is a natural generalization of a $k$-graph. A pullback of ${\rm\Lambda}$ is constructed by pulling it back over a given monoid morphism to $P$, while a pushout of ${\rm\Lambda}$ is obtained by modding out its periodicity, which is deduced from a natural equivalence relation on ${\rm\Lambda}$. One of our main results in this paper shows that, for some $k$-graphs ${\rm\Lambda}$, ${\rm\Lambda}$ is isomorphic to the pullback of its pushout via a natural quotient map, and that its graph $\text{C}^{\ast }$-algebra can be embedded into the tensor product of the graph $\text{C}^{\ast }$-algebra of its pushout and $\text{C}^{\ast }(\text{Per}\,{\rm\Lambda})$. As a consequence, in this case, the cycline algebra generated by the standard generators corresponding to equivalent pairs is a maximal abelian subalgebra, and there is a faithful conditional expectation from the graph $\text{C}^{\ast }$-algebra onto it.

A NEW EXAMPLE FOR MINIMALITY OF MONOIDS

By considering the split extension of a free abelian monoid having finite rank by a finite monogenic monoid, the main purposes of this paper are to present examples of efficient monoids and, also, minimal but inefficient monoids. Although results presented in this paper seem as in the branch of pure mathematics, they are actually related to applications of Combinatorial and Geometric Group-Semigroup Theory, especially computer science, network systems, cryptography and physics etc., which will not be handled here.