Related papers: A Minimum Doubly Resolving Set and Strong Resolvin…
A class of recovering algorithms for 1-bit compressive sensing (CS) named Soft Consistency Reconstructions (SCRs) are proposed. Recognizing that CS recovery is essentially an optimization problem, we endeavor to improve the characteristics…
We show that there are CNF formulas which can be refuted in resolution in both small space and small width, but for which any small-width proof must have space exceeding by far the linear worst-case upper bound. This significantly…
We introduce the notion of coupled link cube complex (CLCC) as a means of constructing interesting cocompactly cubulated groups. CLCCs are defined locally, making them a useful tool when precise control over the links is required. In this…
We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…
This paper presents new results about the optimization based generation of chemical reaction networks (CRNs) of higher deficiency. Firstly, it is shown that the graph structure of the realization containing the maximal number of reactions…
According to the structural balance theory, a signed graph is considered structurally balanced when it can be partitioned into a number of modules such that positive and negative edges are respectively located inside and between the…
We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols) have a special structure that allows for an…
In this paper we are interested in the solution of Compressed Sensing (CS) problems where the signals to be recovered are sparse in coherent and redundant dictionaries. CS problems of this type are convex with non-smooth and non-separable…
Carbon nanostructures technology has recently emerged as a key enabler for next-generation optoelectronic devices including deep UV detectors and light sources which is promising in health and environment monitoring. Here, we report the…
Coiled Carbon Nanotubes (CCNTs) are increasingly set to become a vital factor in the new generation of nanodevices and energy-absorbing materials due to their outstanding properties. In the following work, the multi-objective optimization…
A set of $N$ permutations of $\{1,2,\ldots,v\}$ is $t$-suitable, if each symbol precedes each subset of $t-1$ others in at least one permutation. The extremal problem of determining the smallest size $N$ of such sets for given $v$ and $t$…
The traditional clustering problem of renewable energy profiles is typically formulated as a combinatorial optimization that suffers from the Curse of Dimensionality (CoD) on classical computers. To address this issue, this paper first…
We address the question of whether three-dimensional crystals are minimizers of classical many-body energies. This problem is of conceptual relevance as it presents a significant milestone towards understanding, on the atomistic level,…
We study a new hypothetical form of solid carbon \csc, with a unit cell which is composed of the \cs \ fullerene cluster and an additional single carbon atom arranged in the zincblende structure. Using {\it ab initio} calculations, we show…
Identifying local structural motifs and packing patterns of molecular solids is a challenging task for both simulation and experiment. We demonstrate two novel approaches to characterize local environments in different polymorphs of…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
Quadric complexes are square complexes satisfying a certain combinatorial nonpositive curvature condition. These complexes generalize 2-dimensional CAT(0) cube complexes and are a square analog of systolic complexes. We introduce and study…
This work proposes a causal and recursive algorithm for solving the "robust" principal components' analysis (PCA) problem. We primarily focus on robustness to correlated outliers. In recent work, we proposed a new way to look at this…
In order to study real-world systems, many applied works model them through signed graphs, i.e. graphs whose edges are labeled as either positive or negative. Such a graph is considered as structurally balanced when it can be partitioned…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…