is paper presents results of a control annotation of the Topic-Focus Articulation of Czech sentences based on the notion of “aboutness”. is is one of the steps testing the hypothesis about the relation between contextual boundness and “aboutness”. We suppose that the bipartition of the sentence into its Topic and Focus (“aboutness”) can be automatically derived from the values of contextual b...

Let Kn,n denote the complete bipartite graph with n vertices in each bipartition set and Kn,n − I denote Kn,n with a 1-factor removed. An m-cycle system of Kn,n − I is a collection T of m-cycles such that each edge of Kn,n − I is contained in a unique m-cycle of T . In this paper, it is proved that the necessary and sufficient conditions for the existence of an m-cycle system of Kn,n − I are n ...

For the terminology and notation we follow Bondy and Murty [1] in graph theory and Welsh [3] in matroid theory. All sets considered are finite. Let G be a bipartite graph with bipartition (X, Y) and let V and E denote, respectively, the vertex and edge sets of G. A matching M in G is called a matching of X into Y if every vertex in X is M-saturated. If S is any subset of V, we shall write <5(S)...

1 The First Counterexample Let ρ be a quantum state on the space (C) of n qudits (d-dimensional quantum systems). Denote by ρS the reduced state of ρ onto some subset S of the qudits. We partition S further into two nonempty subsets of qudits A and A := S\A (thus S must contain at least two qudits). Denote by Sep(A) the convex set of quantum states which are bipartite separable on S across the ...

A bstract We study the geometric action of some modular conjugations in two dimensional (2D) conformal field theories. investigate bipartition given by an interval when system is ground state, either on line or circle, and thermal Gibbs state line. find that restriction corresponding inversion maps to a spatial slice obtained also gauge/gravity correspondence through geodesic bit threads consta...

Incongruence, or topological conflict, is prevalent in genome-scale data sets but relatively few measures have been developed to quantify it. Internode Certainty (IC) and related measures were recently introduced to explicitly quantify the level of incongruence of a given internode (or internal branch) among a set of phylogenetic trees and complement regular branch support statistics in assessi...

The image segmentation problem is to delineate, or segment, a salient feature in an image. As such, this is a bipartition problem with the goal of separating the foreground from the background. An NP-hard optimization problem, the Normalized Cut problem, is often used as a model for image segmentation. The common approach for solving the normalized cut problem is the spectral method which gener...

If only limited control over a multiparticle quantum system is available, viable method to characterize correlations perform random measurements and consider the moments of resulting probability distribution. We present systematic methods analyze different forms entanglement with these in an optimized manner. First, we find optimal criteria for three-qubit systems using second randomized measur...

The detection of phase transitions in quantum many-body systems with lowest possible prior knowledge their details is among the most rousing goals flourishing application machine-learning techniques to physical questions. Here, we train a Generative Adversarial Network (GAN) Entanglement Spectrum system bipartition, as extracted by means Matrix Product States ansätze. We are able identify gaple...

In the online bipartite matching problem with replacements, all the vertices on one side of the bipartition are given, and the vertices on the other side arrive one by one with all their incident edges. The goal is to maintain a maximum matching while minimizing the number of changes (replacements) to the matching. We show that the greedy algorithm that always takes the shortest augmenting path...