It is well known that the coefficients of matching polynomial are unimodal. Unimodality (or their absolute values) other graph polynomials has been studied as well. One way to prove unimodality real-rootedness. Recently I. Beaton and J. Brown (2020) proved for almost all graphs domination form a unimodal sequence, C. Barton, D. Pike forest (aka acyclic polynomial) real-rooted iff G forest. Let ...

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination of a graph G the generating function number dominating sets each cardinality in G, have been conjectured unimodal. In this paper we will show paths, cycles complete multipartite graphs unimodal, that almost every with mode $$ \lceil \frac{n}{2}\rceil .

One of the most common tasks of a robot companion in the home is communication. In order to initiate an information exchangewith its human partner, the robot needs to attract the attention of the human. This paper presents results of two user studies (N = 12) to evaluate the effectiveness of unimodal and multimodal communication cues for attracting attention. Results showed that unimodal commun...

Communicative feedback in human-human and human-computer interaction is of interest to both language and ICT researchers. In this study, unimodal and multimodal feedback, produced by Chinese and Swedish interlocutors, has been investigated in four Chinese-Chinese, four Swedish-Swedish, and eight Chinese-Swedish informal dyadic videorecorded dialogs. We are investigating two issues: First, what ...

By reexamining some initialization strategies for blind equalizers, we develop an approximation to a common contrast function for equalization which enjoys a “unimodal” property: the solution obtained from the modified criterion is unique to within standard scale factor ambiguity, and moreover yields a perfect equalizer whenever such is attainable. In the more realistic situation in which perfe...

Examples are given of tent maps T for which there exist nontrivial sets B ⊂ [0, 1] such that T : B → B is a homeomorphism.