相关论文: Complete enumeration of two-Level orthogonal array…
In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…
In this paper, we propose a family of nonconforming finite elements for $2m$-th order partial differential equations in $\mathbb{R}^n$ on simplicial grids when $m=n+1$. This family of nonconforming elements naturally extends the elements…
We propose a new topological invariant of unlabeled trees of N nodes. The invariant is a set of Nx2 matrices of integers, with sum_j k^{d_{i,j}} and v_i as the matrix elements, where d_{i,j} are the elements of the distance matrix and v_i…
Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…
We introduce a new family of algebraic varieties, $L_{d,n}$, which we call the unsquared measurement varieties. This family is parameterized by a number of points $n$ and a dimension $d$. These varieties arise naturally from problems in…
Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…
We generalize the array orthogonality property for perfect autocorrelation sequences to $n$-dimensional arrays. The generalized array orthogonality property is used to derive a number of $n$-dimensional perfect array constructions.
Determining the number of realisations of a graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we prove that the $d$-dimensional realisation number of an Erd\H{o}s-Renyi random graph…
The paper presents a classification of quadratic extension algebras, also known as algebras of degree 2, as well as several characterizations of quaternion algebras over a field (of characteristic not 2). The presentation is not restricted…
Continuing results from JCDCGGG 2016 and 2017, we solve several new cases of the simple foldability problem -- deciding which crease patterns can be folded flat by a sequence of (some model of) simple folds. We give new efficient algorithms…
As a type of search design, a detecting array can be used to generate test suites to identify and detect faults caused by interactions of factors in a component-based system. Recently, the construction and optimality of detecting arrays…
We address the problem of finding sets of integers of a given size with a maximum number of pairs summing to powers of $2$. By fixing particular pairs, this problem reduces to finding a labeling of the vertices of a given graph with…
We consider an ordinal tree $T$ on $n$ nodes, with each node assigned a $d$-dimensional weight vector $\pnt{w} \in \{1,2,\ldots,n\}^d,$ where $d \in \mathbb{N}$ is a constant. We study path queries as generalizations of well-known…
The $d=2$ critical Ising model is described by an exactly solvable Conformal Field Theory (CFT). The deformation to $d=2+\epsilon$ is a relatively simple system at strong coupling outside of even dimensions. Using novel numerical and…
This paper studies the problem of enumerating all maximal collinear subsets of size at least three in a given set of $n$ points. An algorithm for this problem, besides solving degeneracy testing and the exact fitting problem, can also help…
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of…
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is useful not only to find one solution but also to enumerate all the solutions with good values of objectives. However,…
This paper introduces lax orthogonal algebraic weak factorisation systems on 2-categories and describes a method of constructing them. This method rests in the notion of simple 2-monad, that is a generalisation of the simple reflections…
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on $n$ vertices and $m$ edges, provided that $m-n\to\infty$ and $m=O(n\log n)$ as $n\to\infty$. This is the entire range of $m$ not covered by…
We study the problem of enumerating the satisfying valuations of a circuit while bounding the delay, i.e., the time needed to compute each successive valuation. We focus on the class of structured d-DNNF circuits originally introduced in…