Let $V$ be the complex vector space of homogeneous linear polynomials in the variables $x_1,...,x_m$. Suppose $G$ is a subgroup of $S_m$, and $\chi$ is an irreducible character of $G$. Let $H_d(G,\chi )$ be the symmetry class of polynomials of degree $d$ with respect to $G$ and $\chi$. For any linear operator $T$ acting on $V$, there is a (unique) induced operator $K_{\chi }\left(T\right)\in \mathrm{End}\left(H_d(G,\chi )\right)$ acting on symmetrized decomposable polynomials by $$K_{\chi }\left(T\right)(f_1*f_2*...*f_d)=T{f}_1*T{f}_2*...*T{f}_d.$$ In this paper, we show that the representation $T\mapsto K_{\chi }\left(T\right)$ of the general linear group $GL\left(V\right)$ is equivalent to the direct sum of $\chi \left(1\right)$ copies of a representation...

Máme-li neomezené množství mincí o předepsaných hodnotách, může se stát, že pomocí nich nelze složit některé částky. Pro jednoduchost se omezíme na případ, kdy máme k dispozici mince pouze dvou různých hodnot. V takovém případě je totiž možné poměrně snadno odvodit vzorce pro největší nereprezentovatelnou částku a zjistit počet všech takových částek. Ukážeme, jak lze ke stejnému cíli dospět různými postupy: nejprve odvodíme vzorec pro zjištění počtu všech nereprezentovatelných částek za pomoci rovinné...

For each integer $k\ge 6$ and each finite graph $L$, we construct a Coxeter group $W$ and a non positively curved polygonal complex $A$ on which $W$ acts properly cocompactly, such that each polygon of $A$ has $k$ edges, and the link of each vertex of $A$ is isomorphic to $L$. If $L$ is a “generalized $m$-gon”, then $A$ is a Tits building modelled on a reflection group of the hyperbolic plane. We give a condition on $\mathrm{Aut}\left(L\right)$ for $\mathrm{Aut}\left(A\right)$ to be non enumerable (which is satisfied if $L$ is a thick classical generalized $m$-gon). On the other hand,...

For an ordered set $W=\{w_1,w_2,\cdots ,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the (metric) representation of $v$ with respect to $W$ is the $k$-vector $r\left(v\right|W)=(d(v,w_1),d(v,w_2),\cdots ,d(v,w_k))$, where $d(x,y)$ represents the distance between the vertices $x$ and $y$. The set $W$ is a resolving set for $G$ if distinct vertices of $G$ have distinct representations with respect to $W$. A resolving set of minimum cardinality is called a minimum resolving set or a basis and the cardinality of a basis for $G$ is its dimension $dimG$. A set $S$ of vertices in $G$ is a dominating set...

A directed Cayley graph $C(\Gamma ,...$

We analyse the spectral phase diagram of Schrödinger operators $T+\lambda V$ on regular tree graphs, with $T$ the graph adjacency operator and $V$ a random potential given by $iid$ random variables. The main result is a criterion for the emergence of absolutely continuous $\left(ac\right)$ spectrum due to fluctuation-enabled resonances between distant sites. Using it we prove that for unbounded random potentials $ac$ spectrum appears at arbitrarily weak disorder $(\lambda \ll 1)$ in an energy regime which extends beyond the spectrum of$\sim T$. Incorporating...