We study edge-sum distinguishing labeling, a type of labeling recently introduced by Z. Tuza (2017) in context games. An ESD an $n$-vertex graph $G$ is injective mapping integers $1$ to $l$ its vertices such that for every edge, the sum on endpoints unique. If $ l$ equals $n$, we speak about canonical labeling. focus primarily structural properties this and show several classes graphs if they h...

A bstract We give a unified treatment of dispersive sum rules for four-point correlators in conformal field theory. call rule “dispersive” if it has double zeros at all double-twist operators above fixed twist gap. Dispersive have their conceptual origin Lorentzian kinematics and absorptive physics (the notion discontinuity). They been discussed using three seemingly different methods: analytic...

As large amounts of data are circulated both from users to a cloud server and between users, privately aggregating the shared is critical. This article considers problem private weighted sum aggregation with secret weights, where an aggregator wants compute local some agents. Based on privacy requirements posed weights, there different secure multiparty computation schemes exploiting kno...