It is well known that, given a point-line geometry Γ and a projective embedding ε : Γ → PG(V ), if dim(V ) equals the size of a generating set of Γ, then ε is not derived from any other embedding. Thus, if Γ admits an absolutely universal embedding, then ε is absolutely universal. In this paper, without assuming the existence of any absolutely universal embedding, we give sufficient conditions ...

‎in this paper we give a new condition for a sylow $p$-subgroup of a finite group to control transfer‎. ‎then it is deduced a characteri-zation of supersoluble groups that can be seen as a generalization of the well known result concerning the supersolubility of finite groups with cyclic sylow subgroups‎. moreover a condition for a normal embedding of a strongly closed $p$-subgroup is given‎. ...

Large scale distributed computing infrastructures pose challenging resource management problems, which could be addressed by adopting one of two perspectives. On the one hand, the problem could be framed as a global optimization that aims to minimize some notion of system-wide (social) cost. On the other hand, the problem could be framed in a game-theoretic setting whereby rational, selfish use...

We present hash embeddings, an efficient method for representing words in a continuous vector form. A hash embedding may be seen as an interpolation between a standard word embedding and a word embedding created using a random hash function (the hashing trick). In hash embeddings each token is represented by k d-dimensional embeddings vectors and one k dimensional weight vector. The final d dim...