Related papers: Generalized column distances
We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to…
The calculus of finite differences is a solid foundation for the development of operations such as the derivative and the integral for infinite sequences. Here we showed a way to extend it for finite sequences. We could then define…
We generalize two classical formulas for complete intersection curves by introducing the the complete intersection discrepancy of a curve as a correction term. The first is a well-known multiplicity formula in singularity theory, due to…
The relationship between various methods to calculate the physical degrees of freedom for gauge invariant systems of a general form is established. The set of hidden parameters caused for the superfluous degrees of freedom is revealed.
Permutation codes have recently garnered substantial research interest due to their potential in various applications including cloud storage systems, genome resequencing and flash memories. In this paper, we study the theoretical bounds…
The number-theoretic codes are a class of codes defined by single or multiple congruences and are mainly used for correcting insertion and deletion errors. Since the number-theoretic codes are generally non-linear, the analysis method for…
The interleaving distance, although originally developed for persistent homology, has been generalized to measure the distance between functors modeled on many posets or even small categories. Existing theories require that such a poset…
We consider possible reconstructions of a binary image of which the row and column sums are given. For any reconstruction we can define the length of the boundary of the image. In this paper we prove a new lower bound on the length of this…
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…
We extend the notion of reticular Legendrian unfoldings in order to investigate multi-time bifurcations of wavefronts generated by an r-corner. We give a classification list of generic and stable bifurcations with two time parameter and…
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps taken to perform the Generalized Minimum Distance decoding are similar…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
We give a simple analytic criterion which characterizes linearizable 1-codimensional webs. Then we give an invariant geometrical interpretation of it, in term of projective connection. We explain then how our approach allows to study…
The generalization gap of a classifier is related to the complexity of the set of functions among which the classifier is chosen. We study a family of low-complexity classifiers consisting of thresholding a random one-dimensional feature.…
The $q$-ary block codes with two distances $d$ and $d+1$ are considered. Several constructions of such codes are given, as in the linear case all codes can be obtained by a simple modification of linear equidistant codes. Upper bounds for…
Consider a finite dimensional (generally reducible) polynomial representation \rho of GL_n. A projective compactification of GL_n is the closure of \rho(GL_n) in the space of all operators defined up to a factor (this class of spaces can be…
Comparative convexity is a generalization of convexity relying on abstract notions of means. We define the Jensen divergence and the Jensen diversity from the viewpoint of comparative convexity, and show how to obtain the generalized…
In problems involving matrix computations, the concept of leverage has found a large number of applications. In particular, leverage scores, which relate the columns of a matrix to the subspaces spanned by its leading singular vectors, are…