We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute product two matrices with assistance honest but curious servers. construct polynomial codes for SDMM by studying recently introduced combinatorial tool called degree table. For fixed partitioning, minimizing total communication cost code is equivalent <inline-formula xmlns:mml="http://ww...

The paper is concerned with computing the B-spline basis of a multi-degree spline space, namely space piecewise functions comprised polynomial segments different degrees. To this aim, we provide general method to work out matrix representation relating sought another one easier compute. This will allow us, for example, calculate multi degree starting from local Bernstein bases degrees or where ...

A signed graph is a simple with two types of edges: positive and negative. homomorphism from G to another H mapping \(\varphi : V(G) \rightarrow V(H)\) that preserves vertex adjacencies balance closed walks (the the parity number negative edges). The chromatic \(\chi _s(G)\) order smallest such there H.