Related papers: A counterexample to a conjecture on simultaneous W…

DTW calculates the similarity or alignment between two signals, subject to temporal warping. However, its computational complexity grows exponentially with the number of time-series. Although there have been algorithms developed that are…

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

We give estimates on the number of combinatorial designs, which prove (and generalise) a conjecture of Wilson from 1974 on the number of Steiner Triple Systems. This paper also serves as an expository treatment of our recently developed…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

We determine the structure of the graded ring of Siegel modular forms of degree 3. It is generated by 19 modular forms, among which we identify a homogeneous system of parameters with 7 forms of weights 4, 12, 12, 14, 18, 20 and 30. We also…

Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…

We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…

Handwritten characters can be trickier to classify due to their complex and cursive nature compared to simple and non-cursive characters. We present an external classifier along with a Generative Adversarial Network that can classify highly…

In this paper, we study the real and the complex Waring rank of reducible cubic forms. In particular, we compute the complex rank of all reducible cubic forms. In the real case, for all reducible cubics, we either compute or bound the real…

A set of generalized superalgebras containing arbitrary tensor p-form operators is considered in dimensions $D=2n+1$ for $n=1,4 mod 4$ and the general conditions for its existence expressed in the form of generalized Jacobi identities is…

We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…

The Witt ring of a complex flag variety describes the interesting -- i.e. torsion -- part of its topological KO-theory. We show that for a large class of flag varieties, these Witt rings are exterior algebras, and that the degrees of the…

We prove a constant term conjecture of Robbins and Zeilberger (J. Combin. Theory Ser. A 66 (1994), 17-27), by translating the problem into a determinant evaluation problem and evaluating the determinant. This determinant generalizes the…

In Part 1, we describe six projective-type model structures on the category of differential graded modules over a differential graded algebra A over a commutative ring R. When R is a field, the six collapse to three and are well-known, at…

We show that the Killing spinor equations of all supergravity theories which may include higher order corrections on a (r,s)-signature spacetime are associated with twisted covariant form hierarchies. These hierarchies are characterized by…

This short note shows that many of the results derived by Pravda et al (Class. Quant. Grav. 24 4407-4428) for higher-dimensional Type D Einstein spacetimes can be generalized to all Einstein spacetimes admitting a multiple WAND; the main…

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

This paper considers a challenging problem of identifying a causal graphical model under the presence of latent variables. While various identifiability conditions have been proposed in the literature, they often require multiple pure…

Inference of phylogenetic networks is of increasing interest in the genomic era. However, the extent to which phylogenetic networks are identifiable from various types of data remains poorly understood, despite its crucial role in…

We study alternating good-for-games (GFG) automata, i.e., alternating automata where both conjunctive and disjunctive choices can be resolved in an online manner, without knowledge of the suffix of the input word still to be read. We show…