Related papers: Algorithmic design of self-assembling structures

Motivated by the minimax concave penalty based variable selection in high-dimensional linear regression, we introduce a simple scheme to construct structured semiconvex sparsity promoting functions from convex sparsity promoting functions…

A rotation-based synthesis framework for reversible logic is proposed. We develop a canonical representation based on binary decision diagrams and introduce operators to manipulate the developed representation model. Furthermore, a…

The self-similar potentials are formulated in terms of the shape-invariance. Based on it, a coherent state associated with the shape-invariant potentials is calculated in case of the self-similar potentials. It is shown that it reduces to…

State space is widely used for modeling power systems and analyzing their dynamics but it is limited to representing causal and proper systems in which the number of zeros does not exceed the number of poles. In other words, the system…

This paper is devoted to a study of mathematical structures arising from choice functions satisfying the path independence property (Plott functions). We broaden the notion of a choice function by allowing of empty choice. This enables us…

In this research summary we present our recent work on implementing functional patterns with inverse functions in the lazy functional-logic programming language Curry. Our goal is the synthesis of the inverse of any given function in Curry…

We consider a Hamilton operator which describes a finite dimensional quantum mechanical system with degenerate eigenvalues coupled to a field of relativistic bosons. We show that the ground state projection and the ground state energy are…

We typically construct optimal designs based on a single objective function. To better capture the breadth of an experiment's goals, we could instead construct a multiple objective optimal design based on multiple objective functions. While…

In dynamical systems governed by differential equations, a guarantee that trajectories emanating from a given set of initial conditions do not enter another given set can be obtained by constructing a barrier function that satisfies certain…

We prove for the first time that, if a linear inverse problem exhibits a group symmetry structure, gradient-based optimizers can be designed to exploit this structure for faster convergence rates. This theoretical finding demonstrates the…

Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…

We consider a quantum algorithm for ground-state preparation based on a Chebyshev series approximation to the wall function. In a classical setting, this approach is appealing as it guarantees rapid convergence. We analyze the asymptotic…

Folding is emerging as a promising manufacturing process to transform flat materials into functional structures, offering efficiency by reducing the need for welding, gluing, and molding, while minimizing waste and enabling automation.…

There are several known constructions of equilibrium states for H\"older continuous potentials in the context of both subshifts of finite type and uniformly hyperbolic systems. In this article we present another method of building such…

Although eigenspectra of one dimensional shape invariant potentials with unbroken supersymmetry are easily obtained, this procedure is not applicable when the parameters in these potentials correspond to broken supersymmetry, since there is…

External biasing forces are often applied to enhance sampling in regions of phase space which would otherwise be rarely observed. While the typical goal of these experiments is to calculate the potential of mean force (PMF) along the…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…

Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…

We propose and test several tensor network based algorithms for reconstructing the ground state of an (unknown) local Hamiltonian starting from a random sample of the wavefunction amplitudes. These algorithms, which are based on completing…