Related papers: Classification of Minimal Polygons with Specified …

We describe a family of new algorithms for finding the canonical image of a set of points under the action of a permutation group. This family of algorithms makes use of the orbit structure of the group, and a chain of subgroups of the…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…

A property $\Pi$ on a finite set $U$ is \emph{monotone} if for every $X \subseteq U$ satisfying $\Pi$, every superset $Y \subseteq U$ of $X$ also satisfies $\Pi$. Many combinatorial properties can be seen as monotone properties. The problem…

The uniqueness theorem for static, spherically symmetric, asymptotically flat, higher dimensional phantom black holes, with non-degenerate event horizon , being the solutions of Einstein phantom/dilaton Maxwell/anti-Maxwell gravity systems…

We propose a taxonomy for quantum algorithms grounded in the fundamental symmetries, both continuous and discrete, underlying quantum state spaces, oracles, and circuit dynamics. By organizing algorithms according to their symmetry groups…

We classify primitive, rank 1, omega-categorical structures having polynomially many types over finite sets. For a fixed number of 4-types, we show that there are only finitely many such structures and that all are built out of finitely…

We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.

We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…

A new class of functions with a unique identification minor is introduced: functions determined by content and singletons. Relationships between this class with other known classes of functions with a unique identification minor are…

We propose a general approach to classification problems in algebraic geometry via mirror duality. For Fano threefolds, a modularity conjecture describes small quantum cohomology and predicts the values of certain Gromov-Witten invariants.

In (Arnold, 1985), V.I. Arnold has obtained normal forms and has developed a classifier for, in particular, all isolated hypersurface singularities over the complex numbers up to modality 2. Building on a series of 105 theorems, this…

The classification, up to a center-affinity, of the homogeneous quadratic differential systems defined on $\mathbb{R}^{3}$ that have at least a semisimple derivation with one-dimensional kernel, is achieved. It is proved that there exist 35…

The standard coherence criterion for lower previsions is expressed using an infinite number of linear constraints. For lower previsions that are essentially defined on some finite set of gambles on a finite possibility space, we present a…

We classify semisimple rigid monoidal categories with two isomorphism classes of simple objects over the field of complex numbers. In the appendix written by P.Etingof it is proved that the number of semisimple Hopf algebras with a given…

The correspondence between Gorenstein Fano toric varieties and reflexive polytopes has been generalized by Ilten and S\"u{\ss} to a correspondence between Gorenstein Fano complexity-one $T$-varieties and Fano divisorial polytopes. Motivated…

Given a properly normalized parametrization of a genus-0 modular curve, the complex multiplication points map to algebraic numbers called singular moduli. In the classical case, the maps can be given analytically. However, in the Shimura…

This paper establishes the exact comparison complexity of finding an element repeated $n$ times in a $2n$-element array containing $n+1$ distinct values, under the equality-comparison model with $O(1)$ extra space. We present a simple…

We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…

Let $f$ be a Laurent polynomial in two variables, whose Newton polygon strictly contains the origin and whose vertices are primitive lattice points, and let $L_f$ be the minimal-order differential operator that annihilates the period…

A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly…