Related papers: Lavaurs algorithm for cubic symmetric polynomials
We prove that if two non-renormalizable cubic Siegel polynomials with bounded type rotation numbers are combinatorially equivalent, then they are also conformally equivalent. As a consequence, we show that in the one-parameter slice of…
We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…
Using the Darboux method and its relation with supersymmetric quantum mechanics we construct all SUSY partners of the harmonic oscillator. With the help of the SUSY transformation we introduce ladder operators for these partner Hamiltonians…
In this paper we provide, first, a general symbolic algorithm for computing the symmetries of a given rational surface, based on the classical differential invariants of surfaces, i.e. Gauss curvature and mean curvature. In practice, the…
Cubic blocks are studied assembled from linear operators $\mathcal R$ acting in the tensor product of $d$ linear "spin" spaces. Such operator is associated with a linear transformation $A$ in a vector space over a field $F$ of a finite…
We introduce an extended Kepler-Coulomb quantum model in spherical coordinates. The Schr\"{o}dinger equation of this Hamiltonian is solved in these coordinates and it is shown that the wave functions of the system can be expressed in terms…
We indicate a strategy in order to construct bilinear multiplication algorithms of type Chudnovsky in large extensions of any finite field. In particular, by using the symmetric version of the generalization of Randriambololona specialized…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…
In a previous work we showcased the factorization method to find the symmetries of superintegrable systems with spherical separability in flat spaces. Here we analyze the same problem, but in constant curvature spaces along the examples of…
We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…
In this paper we study maps (curved flats) into symmetric spaces which are tangent at each point to a flat of the symmetric space. Important examples of such maps arise from isometric immersions of space forms into space forms via their…
We define symmetric designs of dimension $n$ and propriety $d$, providing a unifying generalization of several classes of higher-dimensional symmetric designs previously studied. We focus on the case $n=d=3$, which leads to the following…
Clustering may be the most fundamental problem in unsupervised learning which is still active in machine learning research because its importance in many applications. Popular methods like K-means, may suffer from instability as they are…
Given a direct sum $A$ of full matrix algebras, if there is a combinatorial interpretation associated with both the dimension of $A$ and the dimensions of the irreducible $A$-modules, then this can be thought of as providing an analogue of…
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…
Let $K$ be a number field, let $A$ be a finite-dimensional $K$-algebra, let $\mathrm{J}(A)$ denote the Jacobson radical of $A$, and let $\Lambda$ be an $\mathcal{O}_{K}$-order in $A$. Suppose that each simple component of the semisimple…
We develop a perturbative algorithm for constructing formal flat $F$-manifold structures on the cohomologies of dGBV (differential Gerstenhaber-Batalin-Vilkovisky) algebras associated with Landau-Ginzburg models. As an application, this…
Mating is an operation to construct a rational map f from two polynomials, which are not in conjugate limbs of the Mandelbrot set. When the Thurston Algorithm for the unmodified formal mating is iterated in the case of postcritical…
A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…