Related papers: A Note on the Subcubes of the $n$-Cube
The boundary seam algebras $\mathsf{b}_{n,k}(\beta=q+q^{-1})$ were introduced by Morin-Duchesne, Ridout and Rasmussen to formulate algebraically a large class of boundary conditions for two-dimensional statistical loop models. The…
In the Integer Quadratic Programming problem input is an n*n integer matrix Q, an m*n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x in Z^n, minimizing x^TQx, subject to Ax <= b. We give a fixed…
We study two related problems: finding a set of k vertices and minimum number of edges (kmin) and finding a graph with at least m' edges and minimum number of vertices (mvms). Goldschmidt and Hochbaum \cite{GH97} show that the mvms problem…
Given a linear unknown system with $m$ inputs, $p$ outputs, $n$ dimensional state vector, and $q$ dimensional ecosystem, the problem of the adaptive optimal output regulation of this system boils down to iteratively solving a set of linear…
Clique problem has a wide range of applications due to its pattern matching ability. There are various formulation of clique problem like $k$-clique problem, maximum clique problem, etc. The $k$-Clique problem, determines whether an…
The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class…
The maximum-cut problem is one of the fundamental problems in combinatorial optimization. With the advent of quantum computers, both the maximum-cut and the equivalent quadratic unconstrained binary optimization problem have experienced…
In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…
Consider a pyramid made out of unit cubes arranged in square horizontal layers, with a ledge of one cube's length around the perimeter of each layer. For any natural number $k$, we can count the number of ways of choosing $k$ unit cubes…
A rational perfect cuboid is a rectangular parallelepiped whose edges and face diagonals are given by rational numbers and whose space diagonal is equal to unity. Its existence is equivalent to the existence of a perfect cuboid with all…
We study the problem of optimal leader selection in consensus networks with noisy relative information. The objective is to identify the set of $k$ leaders that minimizes the formation's deviation from the desired trajectory established by…
We investigate the possibility of extending some results of Pazman and Pronzato (2014) to a larger set of optimality criteria. Namely, in a linear regression model the problem of computing D-, A-, E_k-optimal designs, of combining these…
In [1] we have constructed a [n+1/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension using a $q-$deformation of the Pascal triangle. This construction extends in particular results by S.P.…
The extended definition of the polynomial B-splines may give a chance to improve the results obtained by the classical cubic polynomial B-splines. Determination of the optimum value of the extension parameter can be achieved by scanning…
We study the problem of constructing a (near) random proper $q$-colouring of a simple k-uniform hypergraph with n vertices and maximum degree \Delta. (Proper in that no edge is mono-coloured and simple in that two edges have maximum…
Linear complementary dual (LCD) codes can provide an optimum linear coding solution for the two-user binary adder channel. LCD codes also can be used to against side-channel attacks and fault non-invasive attacks. Let $d_{LCD}(n, k)$ denote…
Recently, the duals of Federer's curvature measures, called dual curvature measures, were discovered by Huang, Lutwak, Yang, and Zhang (ACTA, 2016). In the same paper, they posed the dual Minkowski problem, the characterization problem for…
The purpose of this paper is to solve the 0-1 $k$-item quadratic knapsack problem $(kQKP)$, a problem of maximizing a quadratic function subject to two linear constraints. We propose an exact method based on semidefinite optimization. The…
Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large…
In this paper, using our bifurcational geometric approach, we solve the problem on the maximum number and distribution of limit cycles in the Kukles system representing a planar polynomial dynamical system with arbitrary linear and cubic…