Related papers: Reconstructing Polyatomic Structures from Discrete…
We study generalized complex structures and $T$-duality (in the sense of Bouwknegt, Evslin, Hannabuss and Mathai) on Lie algebras and construct the corresponding Cavalcanti and Gualtieri map. Such a construction is called "Infinitesimal…
In this paper we study the class of bi-arc digraphs, important from two seemingly unrelated perspectives. On the one hand, they are precisely the digraphs that admit certain polymorphisms of interest in the study of constraint satisfaction…
Let $L$ be an integral lattice in the Euclidean space $\mathbb{R}^n$ and $W$ an irreducible representation of the orthogonal group of $\mathbb{R}^n$. We give an implemented algorithm computing the dimension of the subspace of invariants in…
For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…
If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice…
In this paper, we count all non-isomorphic lattices on $n$ elements, containing four reducible elements and having nullity three. This work is in respect of Birkhoff's open problem (which is NP-complete) of counting all finite lattices on…
Motivated by Chudnovsky's structure theorem of bull-free graphs, Abu-Khzam, Feghali, and M\"uller have recently proved that deciding if a graph has a vertex partition into disjoint cliques and a triangle-free graph is NP-complete for five…
While the P vs NP problem is mainly approached form the point of view of discrete mathematics, this paper proposes reformulations into the field of abstract algebra, geometry, fourier analysis and of continuous global optimization - which…
Deciphering the three-dimensional atomic structure of solid-solid interfaces in core-shell nanomaterials is the key to understand their remarkable catalytical, optical and electronic properties. Here, we probe the three-dimensional atomic…
We present a class of photonic lattices with an underlying symmetry given by a finite-dimensional representation of the 2+1D Lorentz group. In order to construct such a finite-dimensional representation of a non-compact group, we have to…
Let P be a lattice polytope in R^n, and let P \cap Z^n = {v_1,...,v_N}. If the N + \binom N2 points 2v_1,...,2v_N; v_1+v_2,...v_{N-1}+v_N are distinct, we say that P is a "distinct pair-sum" or "dps" polytope. We show that, if P is a dsp…
We give a new, direct proof of the tetrachotomy classification for the model-checking problem of positive equality-free logic parameterised by the model. The four complexity classes are Logspace, NP-complete, co-NP-complete and…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
Discrete tomography is concerned with the reconstruction of images that are defined on a discrete set of lattice points from their projections in several directions. The range of values that can be assigned to each lattice point is…
We reconsider the geometry of pure and mixed states in a finite quantum system. The rangesof eigenvalues of the density matrices delimit a regular simplex (Hypertetrahedron TN) in any dimension N; the polytope isometry group is the…
Let ${\mathbf P}$ be the class of polynomial-time decision problems and $\mathbf{NP}$ be the class of nondeterministic polynomial time decision problems. We prove the following: Theorem 3. The classes ${\mathbf P}$ and $\mathbf{NP}$ are…
Given a vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given a set of weighted vertices V and a multiset of splits S, we…
We consider the problem of deciding, given a sequence of regions, if there is a choice of points, one for each region, such that the induced polyline is simple or weakly simple, meaning that it can touch but not cross itself. Specifically,…
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
We prove the title by constructing 2-colourable completely positive approximations for the Toeplitz algebra. Besides results about nuclear dimension and completely positive contractive order zero maps, our argument involves projectivity of…