Related papers: Open and solved problems concerning polarized part…
Under certain conditions, we obtain sharp bounds on some functionals defined in the coefficient space of starlike functions. It has been found that the functionals are closely associated with certain coefficient problems, which are of…
We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it…
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
We give necessary and sufficient conditions for majorization of realrooted polynomials sharing a common interlacer by means of residues coming from fraction decomposition. We also introduce a motivated notion called strong majorization, and…
Using a countable support product of creature forcing posets, we show that consistently, for uncountably many different functions the associated Yorioka ideals' uniformity numbers can be pairwise different. In addition we show that, in the…
We present a conjecture about partitions, with a very elementary formulation.
In this paper, we introduce and analyze a new $LU$-factorization technique for square matrices over idempotent semifields. In particular, more emphasis is put on "max-plus" algebra here, but the work is extended to other idempotent…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…
Orthogonal polynomials of degree $n$ with respect to the weight function $W_\mu(x) = (1-\|x\|^2)^\mu$ on the unit ball in $\RR^d$ are known to satisfy the partial differential equation $$ [ \Delta - \la x, \nabla \ra^2 - (2 \mu +d) \la x,…
Many results in mass partitions are proved by lifting $\mathbb{R}^d$ to a higher-dimensional space and dividing the higher-dimensional space into pieces. We extend such methods to use lifting arguments to polyhedral surfaces. Among other…
We present a set of notes, meant for quick reference, on radiative spin polarization, computer algorithms and spin matching in electron storage rings.
In "Square partitions and Catalan numbers" (arXiv0912.4983), Bennett et al. presented a recursive algorithm to create a family of partitions from one or several partitions. They were mainly interested in the cases when we begin with a…
Using relativistic tensor-bispinorial equations proposed in hep-th/0412213 we solve the Kepler problem for a charged particle with arbitrary half-integer spin interacting with the Coulomb potential.
The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…
Weak-strong coupling duality relations are shown to be present in the quantum-mechanical many-body system with the interacting potential proportional to the pair-wise inverse-squared distance in addition to the harmonic potential. Using…
Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases,…
We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…
We study the version of the C-Planarity problem in which edges connecting the same pair of clusters must be grouped into pipes, which generalizes the Strip Planarity problem. We give algorithms to decide several families of instances for…