We investigate the problem of multi-party private set intersection (MP-PSI). In MP-PSI, there are M parties, each storing a data P i over N replicated and non-colluding databases, we want to calculate sets ∩ xmlns:xlink="http://www.w3.org/1999/xl...

we consider a 2-dimensional representation of the hecke algebra h(g7; u), whereg7 is the complex re ection group and u is the set of indeterminatesu = (x1; x2; y1; y2; y3; z1; z2; z3):after specializing the indetrminates to non zero complex numbers, we then determine a nec-essary and sucient condition that guarantees the irreducibility of the complex specializationof the representation of the ...

‎ Let $(X,d)$ be a metric space and $Jsubseteq (0,infty)$ be a nonempty set. We study the structure of the arbitrary intersection of vector-valued Lipschitz algebras, and define a special Banach subalgebra of $cap{Lip_gamma (X,E):gammain J}$, where $E$ is a Banach algebra, denoted by $ILip_J (X,E)$. Mainly, we investigate $C-$character amenability of $ILip_J (X,E)$.

Matroid union and matroid intersection are closely related in the sense that one can be derived from the other. However they are from different perspectives and have different applications. To motivate matroid union theorem we state a well known theorem of Tutte and Nash-Williams on packing disjoint spanning trees in graphs. Theorem 1 (Nash-Williams and Tutte) An undirected multi-graph G = (V, ...