We consider the sum of squared logarithms inequality and investigate possible connections with the theory of majorization. We also discuss alternative sufficient conditions on two sets of vectors a,b ∈ R+ so that n ∑ i=1 (logai) n ∑ i=1 (logbi) . Generalizations of some inequalities from information theory are obtained, including a generalized information inequality and a generalized log sum in...

R. Häggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [1] Cichacz and Froncek established a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn,n into generalized prisms of order 2n. In [2] and [3] Cichacz, Froncek, and Kovar ...

Introduction: The aim of this study was to assess the effect of Ca2+/calmodulin-dependent kinase IIα (CaMKIIα) inhibitor (KN-93) injection into the locus coeruleus (LC) on the modulation of withdrawal signs. We also sought to study the effect of chronic morphine administration on CaMKIIα activity in the rat LC. Methods: The research was based on behavioral and molecular studies. In the behav...

_. -LWe present a comprehensive partial-wave analysis of the; processes rrN ---) &,I3 , KN + &B and TN + &., B in the 3-flavor Skyrme model, with c& an arbitrary pseudoscalar-octet meson and B a h’ octet or g’ decuplet baryon. Overall, we find good, poor, and mixed agreement, respectively, between the model and experiment for these three types of processes. We pay particular attention to assess...

Let F ,G be families of graphs. The generalized Ramsey number r(F ,G) denotes the smallest value of n for which every red-blue coloring of Kn yields a red F ∈ F or a blue G ∈ G. Let F(k) be a family of graphs with k vertex-disjoint cycles. In this paper, we deal with the case where F = F(3),G = {Kt} for some fixed t with t > 2, and prove that r(F(3),G) = 2t + 5.

In this article we explain how to easily compute gene clusters, formalized by classical or generalized nested common or conserved intervals, between a set of K genomes represented as K permutations. A b-nested common (resp. conserved) interval I of size |I| is either an interval of size 1 or a common (resp. conserved) interval that contains another b-nested common (resp. conserved) interval of ...

The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family F (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a complete graph Kn with t colors. Another area is to find the minimum number of monochromatic members of F that partition or cover the vertex set of every edge colored c...