Related papers: Open and solved problems concerning polarized part…
We describe a general methods to localize any sort of k-separability and therefore also the corresponding partial entanglement in genuinely multipartite mixed quantum states. Our methods are based exclusively on the known twopartite methods…
A generalization of the polar coding scheme called mixed-kernels is introduced. This generalization exploits several homogeneous kernels over alphabets of different sizes. An asymptotic analysis of the proposed scheme shows that its…
We prove combinatorial theorems concerning the stick principle and cardinal characteristics.
Point polarizable molecules at fixed spatial positions have solvable electrostatic properties in classical approximation, the most familiar being the Clausius-Mossotti (CM) formula. This paper generalizes the model and imagines various…
We establish a coloring theorem for successors of a singular cardinals, and use it prove that for any such cardinal $\mu$, we have $\mu^+\nrightarrow[\mu^+]^2_{\mu^+}$ if and only if $\mu^+\nrightarrow[\mu^+]^2_{\theta}$ for arbitrarily…
We try to control many cardinal characteristics by working with a notion of orthogonality between two families of forcings. We show that b^+<g is consistent
The paper deals with two notions: polarized partition relations and product of generalized strong sequences. Strong sequences were introduced by Efimov in 1965 as a usefull tool for proving famous theorems in dyadic spaces, i.e. continuous…
We find that the solution of the polar angular differential equation can be written as the universal associated Legendre polynomials. Its generating function is applied to obtain an analytical result for a class of interesting integrals…
We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…
Consider the problem of constructing a polar code of block length $N$ for the transmission over a given channel $W$. Typically this requires to compute the reliability of all the $N$ synthetic channels and then to include those that are…
The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this…
Several open problems in algebraic logic are solved.
We give short elementary expositions of combinatorial proofs of some variants of Euler's partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a…
The Bipartite Polarization Problem is an optimization problem where the goal is to find the highest polarized bipartition on a weighted and labelled graph that represents a debate developed through some social network, where nodes represent…
We review the problem of discriminating entangled states from separable states for bipartite systems. We formally define what entangled states are, present some important criteria to detect entanglement, and show how they can be classified…
The angular part of the Schrodinger equation for a central potential is brought to the one-dimensional 'Schrodinger form' where one has a kinetic energy plus potential energy terms. The resulting polar potential is seen to be a family of…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
We introduce and study blob and framed blob monoids. In particular, several realizations of these monoids are given. We compute the cardinality of the framed blob monoid and derive some combinatorial formulas involving this cardinality.
Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…