Related papers: The n-queens solution count Q(n) is divisible by 4
The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate…
Let L be a finite dimensional Lie algebra over an algebraically closed field k of characteristic zero. We provide necessary and also some sufficient conditions in order for its Poisson center and semi-center to be polynomial algebras over…
We determine all modular curves $X_0(N)/\langle w_d\rangle$ that admit infinitely many cubic points over the rational field $\mathbb{Q}$, when $N$ is square-free.
We show that for every positive integer n there is a simple closed curve in the plane (which can be taken infinitely differentiable and convex) which has exactly n inscribed squares.
We present a computer assisted proof of the full listing of central configurations for spatial n-body problem for n = 5 and 6, with equal masses. For each central configuration we give a full list of its euclidean symmetries. For all masses…
Fair division with unequal shares is an intensively studied recourse allocation problem. For $ i\in [n] $, let $ \mu_i $ be an atomless probability measure on the measurable space $(C,\mathcal{S}) $ and let $ t_i $ be positive numbers…
Let n_\delta be the number of \delta-nodal curves lying in a suitably ample complete linear system |L| and passing through appropriately many points on a smooth projective complex algebraic surface. A major open problem is to understand the…
Can a problem undecidable with classical resources be decidable with quantum ones? The answer expected is no; as both being Turing theories, they should not solve the Halting problem - a problem unsolvable by any Turing machine. Yet, we…
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
There are n people, each of whom is either a knight or a spy. It is known that at least k knights are present, where n/2 < k < n. Knights always tell the truth. We consider both spies who always lie and spies who answer as they see fit.…
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion…
We show that given a collection of A lines in \R^n, n\geq 2, the maximum number of their joints (points incident to at least n lines whose directions form a linearly independent set) is O(A^{n/(n-1)}). An analogous result for smooth…
Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
Quantum game theory offers a lot of interesting questions, and it is relevant to use the quantum information theory to resolve or improve games with lack of information : how to use the power of quantum entanglement to show the superiority…
In this paper one shows if the number of natural solutions of a general linear equation is limited or not. Also, it is presented a method of solving the Diophantine equation $ax-by=c$ in the set of natural numbers, and an example of solving…
Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…
We show that if $X\subseteq \mathbb{P}^{n-1}$, defined over $\mathbb{Q}$ by a cubic form that splits off two forms, with $n\geq 11$, then $X(\mathbb{Q})$ is non-empty. The same holds for an $(m_1,m_2)$-form with $m_1\geq 4$ and $m_2\geq 5$.
We solve the quantum discord completely as an optimization of certain one variable function for arbitrary two qubit X state. Exact solutions of the quantum discord are obtained for several nontrivial regions of the five parametric space for…
We study the equilibrium solutions of three player Kuhn poker with $N>3$ cards. We compute these solutions as a function of the initial pot size, $P$, using a novel method based on regularizing the system of polynomial equations and…