Related papers: Finding non-minority balls with majority and plura…
Linearized deformations of the thick-walled (low-amplitude) (1+1)-dimensional Q-ball may be decomposed into relativistic modes, which are roughly plane waves, and also long-wavelength corotating and counterrotating Floquet modes. Each mode…
The quantum even-dimensional balls are defined as the $C^*$-algebras generated by certain graphs. We exhibit a polynomial algebra for each even-dimensional quantum ball, and classify the irreducible representations of it.
The moment problem in probability theory asks for criteria for when there exists a unique measure with a given tuple of moments. We study a variant of this problem for random objects in a category, where a moment is given by the average…
Non-topological solitons, such as Q-balls, may contribute to the cosmological dark matter. The formation and evolution of Q-balls in the early universe requires an understanding of solitons with nonzero angular momentum. We derive (rather…
We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…
Justified representation (JR) is a standard notion of representation in multiwinner approval voting. Not only does a JR committee always exist, but previous work has also shown through experiments that the JR condition can typically be…
Given a linear equation $\mathcal{L}$, a set $A \subseteq [n]$ is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. We determine the precise size of the largest $\mathcal{L}$-free subset of $[n]$ for…
Morphological image analysis is applied to the time evolution of the probability distribution of a quantum particle moving in two and three-dimensional billiards. It is shown that the time-averaged Euler characteristic of the probability…
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
Enumeration problems aim at outputting, without repetition, the set of solutions to a given problem instance. However, outputting the entire solution set may be prohibitively expensive if it is too big. In this case, outputting a small,…
Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum…
Balls and bins models are classical probabilistic models where balls are added to bins at random according to a certain rule. The balls and bins model with feedback is a non-linear generalisation of the P\'olya urn, where the probability of…
Examples of games between two partners with mixed strategies, calculated by the use of the probability amplitude as some vector in Hilbert space are given. The games are macroscopic, no microscopic quantum agent is supposed. The reason for…
The properties of Q-balls in the general case of a sixth order potential have been studied using analytic methods. In particular, for a given potential, the initial field value that leads to the soliton solution has been derived and the…
We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.
We give a converging semidefinite programming hierarchy of outer approximations for the set of quantum correlations of fixed dimension and derive analytical bounds on the convergence speed of the hierarchy. In particular, we give a…
We study the problem of when a Brownian motion in the unit ball has a positive probability of avoiding a countable collection of spherical obstacles. We give a necessary and sufficient integral condition for such a collection to be…
We consider a variant of the planted clique problem where we are allowed unbounded computational time but can only investigate a small part of the graph by adaptive edge queries. We determine (up to logarithmic factors) the number of…
The main purpose of part (III) is to give explicit geodesics and billiard orbits in polysquares that exhibit time-quantitative density. In many instances, we can even establish a best possible form of time-quantitative density called…
A new box ball system associated with an antisymmetric tensor crystal of the quantum affine algebra of type A is considered. This includes the so-called colored box ball system with capacity 1 as the simplest case. Infinite number of…