Related papers: Splitting the Kunneth formula
We investigate entanglement production in a class of quantum baker's maps. The dynamics of these maps is constructed using strings of qubits, providing a natural tensor-product structure for application of various entanglement measures. We…
The problem of N interacting spins on a lattice is equivalent to one of N clusters linked in a specific manner. The energy of any configuration of spins can be expressed in terms of the energy levels of this cluster. A new expression is…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
A systematic procedure for generating cubic multisections of Eisenstein series is given. The relevant series are determined from Fourier expansions for Eisenstein series by restricting the congruence class of the summation index modulo…
Mixtures of product distributions are a powerful device for learning about heterogeneity within data populations. In this class of latent structure models, de Finetti's mixing measure plays the central role for describing the uncertainty…
In established theories of grain coarsening, grains disappear either by shrinking or by rotating as a rigid object to coalesce with an adjacent grain. Here we report a third mechanism for grain coarsening, in which a grain splits apart into…
In the first part we associate a periodic sequence to a partition and study the connection the distribution of elements of uniform limit of the sequences. Then some facts of statistical independence of these limits are proved
In symmetric groups, studies of permutation factorizations or triples of permutations satisfying certain conditions have a long history. One particular interesting case is when two of the involved permutations are long cycles, for which…
Invariant curves are generally closed curves in the Poincare's surface of section. Here we study an interesting dynamical phenomenon, first discovered by Binney et al. (1985) in a rotating Kepler potential, where an invariant curve of the…
We study the generalization of split, k-branch split, and intersection cuts from Mixed Integer Linear Programming to the realm of Mixed Integer Nonlinear Programming. Constructing such cuts requires calculating the convex hull of the…
A formula which only involves a partition number and elementary functions is derived by applying Burnside's Lemma to the set of idempotent maps from a set to itself. One side involves a summation over a set closely related to the partition…
We present a probabilistic graphical model formulation for the graph clustering problem. This enables to locally represent uncertainty of image partitions by approximate marginal distributions in a mathematically substantiated way, and to…
We give a new perspective of Heegaard splittings in terms square complexes and Guirardel's notion of a \textit{core} which allows for combinatorial measurement of the obstruction to being a connect sum of Heegaard diagrams. A Heegaard…
We give a necessary and sufficient condition for a mixed quantum mechanical state to be separable. The criterion is formulated as a boundedness condition in terms of the greatest cross norm on the tensor product of trace class operators.
Volume-fraction expressions are obtained for the systems of an infinite number of parallel planes arranged both regularly and randomly. As a special case of random arrangement, a non-Poissonian point process (the second-order Erlang…
A core step of every algorithm for learning regression trees is the selection of the best splitting variable from the available covariates and the corresponding split point. Early tree algorithms (e.g., AID, CART) employed greedy search…
We reduce the question whether a given quantum mixed state is separable or entangled to the problem of existence of a certain full family of commuting normal matrices whose matrix elements are partially determined by components of the pure…
Many protocols of quantum information processing use entangled states. Hence, separability criteria are of great importance. We propose new separability conditions for a bipartite finite-dimensional system. They are derived by using…
We study the problem of recovering a known cluster structure in a sparse network, also known as the planted partitioning problem, by means of statistical mechanics. We find a sharp transition from un-recoverable to recoverable structure as…
This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…