相关论文: Complete enumeration of two-Level orthogonal array…
Recent developments in storage -- especially in the area of resistive random access memory (ReRAM) -- are attempting to scale the storage density by regarding the information data as two-dimensional (2D), instead of one-dimensional (1D).…
A covering array $\rm{CA}(N;t,k,v)$ of strength $t$ is an $N \times k$ array of symbols from an alphabet of size $v$ such that in every $N \times t$ subarray, every $t$-tuple occurs in at least one row. A covering array is \emph{optimal} if…
We study the notion of a "differential 2-rig", a category R with coproducts and a monoidal structure distributing over them, also equipped with an endofunctor D : R -> R that satisfies a categorified analogue of the Leibniz rule. This is…
Waring problem for forms is important and classical in mathematics. It has been widely investigated because of its wide applications in several areas. In this paper, we consider the Waring problem for binary forms with complex coefficients.…
String theory in d dimensions has n+1=11-d parameters that may be thought of as being inherited from the geometry of an n+1 torus which may be used to construct the theory using dimensional reduction from eleven dimensions. We give the…
We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as…
In this paper, we present enumeration algorithms to list all preferred extensions of an argumentation framework. This task is equivalent to enumerating all maximal semikernels of a directed graph. For directed graphs on $n$ vertices, all…
We consider the problem of enumerating all instances of a given pattern graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges in the data graph, $k=O(1)$…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…
Tensor completion recovers a multi-dimensional array from a limited number of measurements. Using the recently proposed tensor ring (TR) decomposition, in this paper we show that a d-order tensor of dimensional size n and TR rank r can be…
We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…
The main result of the paper is the classification of all (nonassociative) algebras of level two, i.e. such algebras that maximal chains of nontrivial degenerations starting at them have length two. During this classification we obtain an…
We study a further refinement of the standard refined enumeration of alternating sign matrices (ASMs) according to their first two rows instead of just the first row, and more general "d-refined" enumerations of ASMs according to the first…
We show that a rank reduction technique for string C-group representations first used for the symmetric groups generalizes to arbitrary settings. The technique permits us, among other things, to prove that orthogonal groups defined on…
The classification of algebraic vector bundles of rank 2 over smooth affine fourfolds is a notoriously difficult problem. Isomorphism classes of such vector bundles are not uniquely determined by their Chern classes, in contrast to the…
The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The core idea is to encode the two-dimensional array of…
It is known that a best low-rank approximation to multi-way arrays or higher-order tensors may not exist. This is due to the fact that the set of multi-way arrays with rank at most $R$ is not closed. Nonexistence of the best low-rank…
An exact solution to the problem of parametric level statistics in non-Gaussian ensembles of N by N Hermitian random matrices with either soft or strong level confinement is formulated within the framework of the orthogonal polynomial…
Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different structural tools than those used for symmetric orthogonal arrays…