Related papers: Numerical study of optimal partitioning problems i…
We give a detailed description of a polynomial optimization method allowing to solve a problem in continuum mechanics: the determination of the elasticity or the piezoelectricity tensor of a specific isotropy stratum the closest to a given…
We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quantum mechanical description of the electrons. Several advanced…
We explore an optimal partition problem on surfaces using a computational approach. The problem is to minimise the sum of the first Dirichlet Laplace--Beltrami operator eigenvalues over a given number of partitions of a surface. We consider…
We suggest a reduction of the combinatorial problem of hypergraph partitioning to a continuous optimization problem.
The control of ensembles of dynamical systems is an intriguing and challenging problem, arising for example in quantum control. We initiate the investigation of optimal control of ensembles of discrete-time systems, focusing on minimising…
We provide a constructive algorithm to find the best separable approximation to an arbitrary density matrix of a composite quantum system of finite dimensions. The method leads to a condition of separability and to a measure of…
Traditional problems in computational geometry involve aspects that are both discrete and continuous. One such example is nearest-neighbor searching, where the input is discrete, but the result depends on distances, which vary continuously.…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
After a quick review of the representation theory of the symmetric group, we give an exposition of the tools brought about by the so-called half-infinite wedge representation of the infinite symmetric group. We show how these can be applied…
Alternative novel measures of the distance between any two partitions of a n-set are proposed and compared, together with a main existing one, namely 'partition-distance' D(.,.). The comparison achieves by checking their restriction to…
$\Gamma$-convergence methods are used to prove homogenization results for fractional obstacle problems in periodically perforated domains. The obstacles have random sizes and shapes and their capacity scales according to a stationary…
This paper deals with the Darcy-Forchheimer problem with two kinds of boundary conditions. We discretize the system by using the finite element methods and we propose two iterative schemes to solve the discrete problems. The well-posedness…
The isotropy of space is not a logical requirement but rather is an empirical question; indeed there is suggestive evidence that universe might be anisotropic. A plausible source of these anisotropies could be quantum gravity corrections.…
We solve the graph bi-partitioning problem in dense graphs with arbitrary degree distribution using the replica method. We find the cut-size to scale universally with <k^1/2>. In contrast, earlier results studying the problem in graphs with…
$\Gamma$-convergence techniques are used to give a characterization of the behavior of a family of heterogeneous multiple scale integral functionals. Periodicity, standard growth conditions and nonconvexity are assumed whereas a stronger…
Variational data assimilation technique applied to identification of optimal approximations of derivatives near boundary is discussed in frames of one-dimensional wave equation. Simplicity of the equation and of its numerical scheme allows…
We study the complexity of constraint satisfaction problems for templates $\Gamma$ that are first-order definable in $(\Bbb Z; succ)$, the integers with the successor relation. Assuming a widely believed conjecture from finite domain…
We are interested in a class of numerical schemes for the optimization of nonlinear hyperbolic partial differential equations. We present continuous and discretized relaxation schemes for scalar, one-- conservation laws. We present…
Optimization with constraints is a typical problem in quantum physics and quantum information science that becomes especially challenging for high-dimensional systems and complex architectures like tensor networks. Here we use ideas of…