We study Lelong numbers of currents full mass intersection on a compact K\"ahler manifold in mixed setting. Our main theorems cover some recent results due to Darvas-Di Nezza-Lu. The key ingredient our approach is new notion products pseudoeffective $(1,1)$-classes which captures ``pluripolar part'' the ``total intersection'' given $(1,1)$-classes.

In this paper, we extend the concept of classical f -divergence (for a pair of measures) to mixed f -divergence (for multiple pairs of measures). Mixed f -divergence provides a way to measure the difference between multiple pairs of probability distributions. Properties for mixed f -divergence are established, such as permutation invariance and symmetry in distributions. We also provide an Alex...

This demonstration will present recently completed research for a practice based PhD that explores the psycho-topographical relationship between bodies of matter, embodied data and data bodies, presenting a contribution to the field of mixed reality art, with a particular focus on post-biological identity. It will consist of the presentation of a body of practical outcomes that aim to provide a...

In integer programming, the elementary closure associated with a family of cuts is the convex set de ned by the intersection of all the cuts in the family. In this paper, we compare the elementary closures arising from several classical families of cuts: three versions of Gomory's fractional cuts, three versions of Gomory's mixed integer cuts, two versions of intersection cuts and their strengt...

In this paper, low-complexity distributed fusion filtering algorithm for mixed continuous-discrete multisensory dynamic systems is proposed. To implement the algorithm a new recursive equations for local cross-covariances are derived. To achieve an effective fusion filtering the covariance intersection (CI) algorithm is used. The CI algorithm is useful due to its low-computational complexity fo...

We consider mixed integer linear programs where free integer variables are expressed in terms of nonnegative continuous variables. When this model only has two integer variables, Dey and Louveaux characterized the intersection cuts that have infinite split rank. We show that, for any number of integer variables, the split rank of an intersection cut generated from a rational lattice-free polyto...

let $g$ be a finite group with the identity $e$‎. ‎the subgroup intersection graph $gamma_{si}(g)$ of $g$ is the graph with vertex set $v(gamma_{si}(g)) = g-e$ and two distinct vertices $x$ and $y$ are adjacent in $gamma_{si}(g)$ if and only if $|leftlangle xrightrangle capleftlangle yrightrangle|>1$‎, ‎where $leftlangle xrightrangle $ is the cyclic subgroup of $g$ generated by $xin g$‎. ‎in th...

We describe the missing class of the hierarchy of mixed unit interval graphs, generated by the intersection graphs of closed, open and one type of half-open intervals of the real line. This class lies strictly between unit interval graphs and mixed unit interval graphs. We give a complete characterization of this new class, as well as quadratic-time algorithms that recognize graphs from this cl...

The cutting-plane approach to integer programming was initiated more that 40 years ago: Gomory introduced the corner polyhedron as a relaxation of a mixed integer set in tableau form and Balas introduced intersection cuts for the corner polyhedron. This line of research was left dormant for several decades until relatively recently, when a paper of Andersen, Louveaux, Weismantel and Wolsey gene...