On multiple pattern avoiding set partitions

We study classes of set partitions determined by the avoidance of multiple patterns, applying a natural notion of partition containment that has been introduced by Sagan. We say that two sets S and T of patterns are equivalent if for each n the number of partitions of size n avoiding all the members of S is the same as the number of those that avoid all the members of T.     

Comments on Salem polynomials

Archiv der Mathematik - We strengthen a sufficient condition, due to R.S. Vieira, for a (reciprocal) polynomial $$R(x)=(x-\alpha _{1})(x-\alpha _{1}^{-1})\cdots (x-\alpha _{s})(x-\alpha...     

Projected block-wise SIC detection for communication systems with non-negativity constraints

Photonic Network Communications - Recently, a number of projected successive interference cancellation (PSIC) and projected parallel interference cancellation (PPIC) structures, which make use of...     

In vitro antioxidant activities of five β-carboline alkaloids,molecular docking,and dynamic simulations

Structural Chemistry - Experimental and computational studies were performed to determine the antioxidant activities of harmine, harmaline, harmalol, harmane, and...