Related papers: Complete enumeration of two-Level orthogonal array…
We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden…
A dimensionless parameter $\Lambda$ is proposed to describe a hierarchy of morphologies in two-dimensional (2D) aggregates formed due to varying competition between short-range attraction and long-range repul- sion. Structural transitions…
It is well-known that gauging a finite 0-form symmetry in a quantum field theory leads to a dual symmetry generated by topological Wilson line defects. These are described by the representations of the 0-form symmetry group which form a…
In this paper, we asymptotically enumerate graphs with a given degree sequence d=(d_1,...,d_n) satisfying restrictions designed to permit heavy-tailed sequences in the sparse case (i.e. where the average degree is rather small). Our general…
In the analysis of qualification data from the FIRST Robotics Competition, the ratio of the number of observations to the number of parameters has been found to be quite small for the commonly used winning margin power rating (WMPR) model.…
The paper is devoted to classify nilpotent Jordan algebras of dimension up to five over an algebraically closed field of characteristic not 2. We obtained a list of 35 isolated non-isomorphic 5-dimensional nilpotent non-associative Jordan…
We investigate the modular properties of a new partition rank, the $M_d$-rank of overpartitions. In fact this is an infinite family of ranks, indexed by the positive integer $d$, that gives both the Dyson rank of overpartitions and the…
The goal of feature selection is to choose the optimal subset of features for a recognition task by evaluating the importance of each feature, thereby achieving effective dimensionality reduction. Currently, proposed feature selection…
In a given 4d spacetime bakcground, one can often construct not one but a family of distinct N=2 string theories. This is due to the multiple ways N=2 superconformal algebra can be embedded in a given worldsheet theory. We formulate the…
Recently, we presented a new Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generalization of the Bin Packing Problem and 2-D…
While tensor-based methods excel at Direction-of-Arrival (DOA) estimation, their performance degrades severely with faulty or sparse arrays that violate the required manifold structure. To address this challenge, we propose Tensor…
Multidimensional persistence has been proposed to study the persistence of topological features in data indexed by multiple parameters. In this work, we further explore its algebraic complications from the point of view of higher…
We prove that an additive form of degree $d=2m$, $m$ odd over any totally ramified extension of $\mathbb{Q}_2$ has a nontrivial zero if the number of variables $s$ satisifies $s \ge \frac{d^2}{4} + 3d + 1$.
In \cite{Castoldi}, $q^t \by (q+1)t$ ordered orthogonal arrays (OOAs) of strength $t$ over the alphabet $\FF_q$ were constructed using linear feedback shift register sequences (LFSRs) defined by {\em primitive} polynomials in $\FF_q[x]$. In…
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO-arrays.…
Orthogonal minimally aliased response surface (OMARS) designs permit the study of quantitative factors at three levels using an economical number of runs. In these designs, the linear effects of the factors are neither aliased with each…
Traditional orthogonal range problems allow queries over a static set of points, each with some value. Dynamic variants allow points to be added or removed, one at a time. To support more powerful updates, we introduce the Grid Range class…
Let $\operatorname{r_{max}}(n,d)$ be the maximum Waring rank for the set of all homogeneous polynomials of degree $d>0$ in $n$ indeterminates with coefficients in an algebraically closed field of characteristic zero. To our knowledge, when…
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…
We study the computational complexity of constrained nonnegative Gram feasibility. Given a partially specified symmetric matrix together with affine relations among selected entries, the problem asks whether there exists a nonnegative…