Related papers: Open and solved problems concerning polarized part…

We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…

I show that factorization for hard processes in QCD is also valid when the detected particles are polarized, and that the proof of the theorem determines the operator form for the parton densities. Particular attention is given to the case…

Some Open Problems Concerning Orthogonal Polynomials.

The problem of minimizing a multilinear function of binary variables is a well-studied NP-hard problem. The set of solutions of the standard linearization of this problem is called the multilinear set. We study a cardinality constrained…

We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's…

We introduce new entanglement monotones which generalize, to the case of many parties, those which give rise to the majorization-based partial ordering of bipartite states' entanglement. We give some examples of restrictions they impose on…

(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…

It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole…

In a series of papers N. Ma and P. Ishwar (2011-13) considered a range of distributed source coding problems that arise in the context of iterative computation of functions, characterizing the region of achievable communication rates. We…

We succeed to say something on the identities of (mu^+, mu) when mu>theta>cf(mu), mu strong limit theta--compact. This hopefully will help to prove the consistency of ``some pair (mu^+,mu) is not compact'', however, this has not been…

We describe some open problems related to homology representations of subposets of the partition lattice, beginning with questions first raised in Stanley's work on group actions on posets.

We examine the problem of projecting subsets of a commutative, positively ordered monoid into an $o$-ideal. We prove that to this end one may restrict to a sufficient subset, for whose cardinality we provide an explicit upper bound. Several…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…

We study the inverse problem for the fractional Laplace equation with multiple nonlinear lower order terms. We show that the direct problem is well-posed and the inverse problem is uniquely solvable. More specifically, the unknown…

Nodal solutions of a parametric (p_1,p_2)-Laplacian system, with Neumann boundary conditions, are obtained by chiefly constructing appropriate sub-super-solution pairs.

Tiling planar regions with dominoes is a classical problem in which the decision and counting problems are polynomial. We prove a variety of hardness results (both NP- and #P-completeness) for different generalizations of dominoes in three…

The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…

We show that for a wide class of Gaussian random fields, points are polar in the critical dimension. Examples of such random fields include solutions of systems of linear stochastic partial differential equations with deterministic…

For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…