Related papers: Reconstructing Polyatomic Structures from Discrete…
We propose a scheme of creating a tunable highly nonlinear defect in a one-dimensional photonic crystal. The defect consists of an atomic cell filled in with two isotopes of three-level atoms. The probe-field refractive index of the defect…
It is shown in this paper that non-conforming finite elements on the triangle using $P^{1}$-nonconforming polynomials and $P^{2}$ -conforming polynomials can be easily built and used.They appear as an 'enriched' version of the standard…
The NP-hard Metric Dimension problem is to decide for a given graph G and a positive integer k whether there is a vertex subset of size at most k that separates all vertex pairs in G. Herein, a vertex v separates a pair {u,w} if the…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial…
Our work is motivated by the challenges presented in preparing arrays of atoms for use in quantum simulation. The recently-developed process of loading atoms into traps results in approximately half of the traps being filled. To consolidate…
We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…
In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of V\"a\"an\"anen from 2007. We study a propositional variant of this logic (PDL)…
2-dimensional Matching Problem, which requires to find a matching of left- to right-vertices in a balanced $2n$-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with…
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…
We consider the problem of approximating a two-dimensional shape contour (or curve segment) using discrete assembly systems, which allow to build geometric structures based on limited sets of node and edge types subject to edge length and…
The diameter of a polytope is a fundamental geometric parameter that plays a crucial role in understanding the efficiency of the simplex method. Despite its central nature, the computational complexity of computing the diameter of a given…
Estimating high-dimensional precision matrices is a fundamental problem in modern statistics, with the graphical lasso and its $\ell_1$-penalty being a standard approach for recovering sparsity patterns. However, many statistical models,…
Discrete point sets $\mathcal{S}$ such as lattices or quasiperiodic Delone sets may permit, beyond their symmetries, certain isometries $R$ such that $\mathcal{S}\cap R\mathcal{S}$ is a subset of $\mathcal{S}$ of finite density. These are…
We present two complementary techniques called catalysis and inhibition which allow one to determine if a given pattern is TP completable or TP non-completable, respectively. Empirically, these techniques require considering only one…
Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…
We completely classify non-spanning $3$-polytopes, by which we mean lattice $3$-polytopes whose lattice points do not affinely span the lattice. We show that, except for six small polytopes (all having between five and eight lattice…
The input of the Test Cover problem consists of a set $V$ of vertices, and a collection ${\cal E}=\{E_1,..., E_m\}$ of distinct subsets of $V$, called tests. A test $E_q$ separates a pair $v_i,v_j$ of vertices if $|\{v_i,v_j\}\cap E_q|=1.$…
Functional properties of nanomaterials strongly depend on their surface atomic structure, but they often become largely different from their bulk structure, exhibiting surface reconstructions and relaxations. However, most of the surface…
Quantitative analysis of microstructural features on the nanoscale, including precipitates, local chemical orderings (LCOs) or structural defects (e.g. stacking faults) plays a pivotal role in understanding the mechanical and physical…