Related papers: Embedding Unicritical Connectedness Loci
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nature, another important challenge is effective modeling of…
In this paper we investigate the problem of non-analytic embeddings of Lorentzian manifolds in Ricci-flat semi-Riemannian spaces. In order to do this, we first review some relevant results in the area, and then motivate both the…
Neural networks are widely used as a model for classification in a large variety of tasks. Typically, a learnable transformation (i.e. the classifier) is placed at the end of such models returning a value for each class used for…
This paper is concerned with achieving optimal coherence for highly redundant real unit-norm frames. As the redundancy grows, the number of vectors in the frame becomes too large to admit equiangular arrangements. In this case, other…
The notion of relatedness loci in the parabolic slices Per_1(e^{2\pi i p/q}) in moduli space of quadratic rational maps is introduced. They are counterparts of the disconnectedness or escape locus in the slice of quadratic polynomials. A…
McDuff and Schlenk determined when a four-dimensional ellipsoid can be symplectically embedded into a four-dimensional ball, and found that when the ellipsoid is close to round, the answer is given by an "infinite staircase" determined by…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
A step 2 branching decomposition of spaces of homogeneous Hermitian monogenic polynomials in C^n is established with explicit embedding factors in terms of the generalized Jacobi polynomials, which allows for an inductive construction of an…
We describe a primary limb structure in the connectedness locus of complex cubic polynomials, where the limbs are indexed by the periodic points of the doubling map $t \mapsto 2t \ (\operatorname{mod} {\mathbb Z})$. The main renormalization…
In this note, we explain in some detail how one can fiberwise localize a (co)lax symmetric monoidal infinity-category. This construction was tacitly used in Section 5 of our recent paper "On the equivalence of the Lurie's infinity-operads…
We consider the family $\mathrm{MP}_d$ of affine conjugacy classes of polynomial maps of one complex variable with degree $d \geq 2$, and study the map $\Phi_d:\mathrm{MP}_d\to \widetilde{\Lambda}_d \subset \mathbb{C}^d / \mathfrak{S}_d$…
Given an arbitrary complex-valued infinite matrix A and a positive integer n we introduce a naturally associated polynomial basis B_A of C[x0...xn]. We discuss some properties of the locus of common zeros of all polynomials in B_A having a…
Using the braided version of Lawvere's algebraic theories and Mac Lane's PROPs, we introduce polynomial identities for arbitrary algebraic structures in a braided monoidal category C as well as their codimensions in the case when C is…
A new technique for the study of geodesic connectedness in a class of Lorentzian manifolds is introduced. It is based on arguments of Brouwer's topological degree for the solution of functional equations. It is shown to be very useful for…
Pickands dependence functions characterize bivariate extreme value copulas. In this paper, we study the class of polynomial Pickands functions. We provide a solution for the characterization of such polynomials of degree at most $m+2$,…
The enumeration of combinatorial classes of the complex polynomial vector fields in C presented in [Dia13] is extended here to a closed form enumeration of combinatorial classes for degree d polynomial vector fields up to rotations of…
We show that for a monic polynomial p of degree d, the length of the level set {z: |p(z)|=1} is at most 9.2 d, which improves an earlier estimate due to P. Borwein. For d=2 we show that the extremal level set is the Bernoullis' Lemniscate.…
We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials and indicate potential for extensions. As our main tool, we show that for a large class of Newton maps that includes all hyperbolic…
We modify our previous construction of link homology in order to include a natural duality functor $\mathfrak{F}$. To a link $L$ we associate a triply-graded module $HXY(L)$ over the graded polynomial ring…