相关论文: A Gale-Berlekamp permutation-switching problem in …
Zeckendorf proved that every positive integer $n$ can be written uniquely as the sum of non-adjacent Fibonacci numbers; a similar result, though with a different notion of a legal decomposition, holds for many other sequences. We use these…
For a symmetric system, we want to study the problem of crossing an hypersurface in the neighborhood of a given point, when we suppose that all of the available vector fields are tangent to the hypersurface at the point. Classically one…
Let $(X_i, \mathcal{F}_i)_{i\geq1}$ be a martingale difference sequence in a smooth Banach space. Let $S_n=\sum_{i=1}^nX_i, n\geq 1,$ be the partial sums of $(X_i, \mathcal{F}_i)_{i\geq 1}$. We give upper bounds on the quantity…
This work introduces a multidimensional generalization of the maximum bisection problem. A mixed integer linear programming formulation is proposed with the proof of its correctness. The numerical tests, made on the randomly generated…
Let $S$ be a connected graph which contains an induced path of $n-1$ vertices, where $n$ is the order of $S.$ We consider a puzzle on $S$. A configuration of the puzzle is simply an $n$-dimensional column vector over $\{0, 1\}$ with…
The benefits of transmission line switching are well-known in terms of reducing operational cost and improving system reliability of power systems. However, finding the optimal power network configuration is a challenging task due to the…
We compare thoroughly the Berlekamp -- Massey -- Sakata algorithm and the Scalar-FGLM algorithm, which compute both the ideal of relations of a multi-dimensional linear recurrent sequence. Suprisingly, their behaviors differ. We detail in…
The concept of switching has arisen in several different areas within combinatorics. The act of switching usually transforms a combinatorial object into a non-isomorphic object of the same type, in a way that some key property is preserved.…
We show that the low energy limit of the minimal supersymmetric Left-Right models is the supersymmetric standard model with an exact R-parity. The theory predicts a number of light Higgs scalars and fermions with masses much below the $B-L$…
Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its players. The \emph{signaling problem} abstracts the task faced…
In the present work, the problem about shadow, generalized on domains of space $\mathbb{R}^n$, $n\le 3$, is investigated. Here the shadow problem means to find the minimal number of balls satisfying some conditions an such that every line…
The Hall--Post inequalities provide lower bounds on $N$-body energies in terms of $N'$-body energies with $N'<N$. They are rewritten and generalized to be tested with exactly-solvable models of Calogero-Sutherland type in one and higher…
The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for…
A method for constructing optical potentials with an arbitrary distribution of gain and loss and completely real spectrum is presented. For each arbitrary distribution of gain and loss, several classes of refractive-index profiles with…
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving list colouring of permutation graphs with a bounded…
This work tackles the problem of energy-efficient distributed power control in wireless networks with a large number of transmitters. The problem is modeled by a dynamic game. Each transmitter-receiver communication is characterized by a…
In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reconfiguration. We give a polynomial-time algorithm for…
Let M(n, d) be the maximum size of a permutation array on n symbols with pairwise Hamming distance at least d. We use various combinatorial, algebraic, and computational methods to improve lower bounds for M(n, d). We compute the Hamming…
Universal vector wave equations allowing for a unified description of anyons, and also of usual bosons and fermions in the plane are proposed. The existence of two essentially different types of anyons, based on unitary and also on…
In this paper we study higher-order difference equations which can be written as follows: $$ \mathbf{J} (y_0,y_1,...)^T = \lambda^N (y_0,y_1,...)^T, $$ where $\mathbf{J}$ is a $(2N+1)$-diagonal bounded banded matrix…