we regard the shearlet group as a semidirect product group andshow that its standard representation is,typically, a quasiregu-lar representation. as a result we can characterize irreducibleas well as square-integrable subrepresentations of the shearletgroup.

in this paper, some categorical properties of the category ${bf cpo}_{{bf act}text{-}s}$ of all {cpo $s$-acts}, cpo's equipped with actions of a monoid $s$ on them, and strict continuous action-preserving maps between them is considered. in particular, we describe products and coproducts in this category, and consider monomorphisms and epimorphisms. also, we show that the forgetful functor from...

We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...

in this study, the effect of environmental concern, attitudes and behaviors of the university students on the environmentally conscious purchasing behavior was investigated with the help of structural equation model (sem). sem is an effective data analysis tool that expresses the complicated causative relations between the latent variables. in this study, we collected the data from 400 univers...

we study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesx_{i}. we introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by x boxtimesy. we investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...

a subset $s$ of vertices in a graph $g$ is called a geodetic set if every vertex not in $s$ lies on a shortest path between two vertices from $s$‎. ‎a subset $d$ of vertices in $g$ is called dominating set if every vertex not in $d$ has at least one neighbor in $d$‎. ‎a geodetic dominating set $s$ is both a geodetic and a dominating set‎. ‎the geodetic (domination‎, ‎geodetic domination) number...

‎we investigate two constructions‎ - ‎the replacement and the zig-zag‎ ‎product of graphs‎ - ‎describing several fascinating connections‎ ‎with combinatorics‎, ‎via the notion of expander graph‎, ‎group‎ ‎theory‎, ‎via the notion of semidirect product and cayley graph‎, ‎and‎ ‎with markov chains‎, ‎via the lamplighter random walk‎. ‎many examples‎ ‎are provided‎.