Related papers: Classification of Minimal Polygons with Specified …
In this note, a criterion for a class of binomials to be permutation polynomials is proposed. As a consequence, many classes of binomial permutation polynomials and monomial complete permutation polynomials are obtained. The exponents in…
The positive semidefinite (psd) rank of a polytope is the size of the smallest psd cone that admits an affine slice that projects linearly onto the polytope. The psd rank of a d-polytope is at least d+1, and when equality holds we say that…
We describe the families of minimal rational curves on any complete symmetric variety, and the corresponding varieties of minimal rational tangents (VMRT). In particular, we prove that these varieties are homogeneous and that for…
The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed…
We study fine structural properties related to the interior regularity of $m$-dimensional area minimizing currents mod$(q)$ in arbitrary codimension. We show: (i) the set of points where at least one tangent cone is translation invariant…
Let $\Lambda$ be an artin algebra. We are going to consider full subcategories of $\mod\Lambda$ closed under finite direct sums and under submodules with infinitely many isomorphism classes of indecomposable modules. The main result asserts…
The study of complexity and optimization in decision theory involves both partial and complete characterizations of preferences over decision spaces in terms of real-valued monotones. With this motivation, and following the recent…
Let ${\mathcal P}\subset{\mathbb Z}^2$ be a convex polygon with each vertex in it labeled by an element from a finite set and such that the labeling of each vertex $v\in {\mathcal P}$ is uniquely determined by the labeling of all other…
A necessary condition for uniqueness of factorizations of elements of a finite group $G$ with factors belonging to a union of some conjugacy classes of $G$ is given. This condition is sufficient if the number of factors belonging to each…
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…
Learning to recognize novel visual categories from a few examples is a challenging task for machines in real-world industrial applications. In contrast, humans have the ability to discriminate even similar objects with little supervision.…
This paper studies the structure of core sets under different similarity classes. We investigate the influence of factors of the minimal polynomial with different degrees on the structure of core sets. When $F$ is a finite field of prime…
In this paper, based on results of exact learning, test theory, and rough set theory, we study arbitrary infinite families of concepts each of which consists of an infinite set of elements and an infinite set of subsets of this set called…
We characterise those permutation classes whose simple permutations are monotone griddable. This characterisation is obtained by identifying a set of nine substructures, at least one of which must occur in any simple permutation containing…
For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…
It is known that monoidal categories have a finite definition, whereas multicategories have an infinite (albeit finitary) definition. Since monoidal categories correspond to representable multicategories, it goes without saying that…
The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple nonsingular derivation, is achieved. It is proved that there exist four…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We find all $P$-resolutions of quotient surface singularities (especially, tetrahedral, octahedral, and icosahedral singularities) together with their dual graphs, which reproduces Jan Steven's list [Manuscripta Math. 1993] of the numbers…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…