Related papers: A skeleton model to enumerate standard puzzle sequ…

The purpose of this article is to study the relation between combinatorial equivalence and topological conjugacy, specifically how a certain type of combinatorial equivalence implies topological conjugacy. We introduce the concept of…

In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. In these problems, some tokens are placed on a subset of vertices of the graph, and there are three natural…

In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…

We propose a universal approach to a range of enumeration problems in graphs. The key point is in contracting suitably chosen symmetric tensors placed at the vertices of a graph along the edges. In particular, this leads to an algorithm…

This paper deals with a generalized Sudoku problem and investigates the unicity of a given solution. We introduce constraint sets, which is a generalization of the rows, columns and blocks of a classical Sudoku puzzle. The unicity property…

Detecting anomalous human behaviour is an important visual task in safety-critical applications such as healthcare monitoring, workplace safety, or public surveillance. In these contexts, abnormalities are often reflected with unusual human…

The medial axis transform is a well-known tool for shape recognition. Instead of the object contour, it equivalently describes a binary object in terms of a skeleton containing all centres of maximal inscribed discs. While this shape…

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

In order to achieve deep natural language understanding, syntactic constituent parsing is a vital step, highly demanded by many artificial intelligence systems to process both text and speech. One of the most recent proposals is the use of…

A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…

Strict partitions are enumerated with respect to the weight, the number of parts, and the number of sequences of odd length. We write this trivariate generating function as a double sum $q$-series. Equipped with such a combinatorial set-up,…

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…

We consider object detection using a generic model for natural shapes. A common approach for object recognition involves matching object models directly to images. Another approach involves building intermediate representations via a…

We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…

We propose a novel probabilistic dimensionality reduction framework that can naturally integrate the generative model and the locality information of data. Based on this framework, we present a new model, which is able to learn a smooth…

Distorted sums of models were introduced and discussed in [Sh:463]. This notion generalizes the notion of disjoint (or direct) sums of models by letting the summands overlap. In the first section we investigate types in distorted sums and…

We propose a new algorithm for curve skeleton computation which differs from previous algorithms by being based on the notion of local separators. The main benefits of this approach are that it is able to capture relatively fine details and…

Starting from the formulation of pseudo-Riemannian generalisation of real spectral triples we develop the data of geometries over finite-dimensional algebras with indefinite metric and their Riemannian parts. We then discuss the Standard…