Related papers: New light on solving the sextic by iteration: An a…
The point of this paper is to use affine automorphisms from algebraic geometry to build cryptographic multivariate mappings. We will construct groups G,H, both isomorphic to the cyclic group with a prime number of elements and multilinear…
The kinematics of a robot manipulator are described in terms of the mapping connecting its joint space and the 6-dimensional Euclidean group of motions $SE(3)$. The associated Jacobian matrices map into its Lie algebra $\mathfrak{se}(3)$,…
Chebyshev maps in the complex plane are typical chaotic maps. Veselov generalized these map. We consider a class of those maps and view them as holomorphic endomorphisms on the 3-dimensional complex projective space and make use of the…
Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…
Geometric hitting set problems, in which we seek a smallest set of points that collectively hit a given set of ranges, are ubiquitous in computational geometry. Most often, the set is discrete and is given explicitly. We propose new…
In this paper we consider maps on the plane which are similar to quadratic maps in that they are degree 2 branched covers of the plane. In fact, consider for $\alpha$ fixed, maps $f_c$ which have the following form (in polar coordinates):…
The complement of a hyperplane arrangement in $\mathbb{C}^n$ deformation retracts onto an $n$-dimensional cell complex, but the known procedures only apply to complexifications of real arrangements (Salvetti) or the cell complex produced…
In this paper we continue the analysis of equivariant wave maps from 2-dimensional hyperbolic space into surfaces of revolution that was initiated in [13, 14]. When the target is the hyperbolic plane we proved in [13] the existence and…
A graph is reconstructible if it is determined up to isomorphism from the collection of all its one-vertex-deleted subgraphs, known as the deck of G. The Reconstruction Conjecture (RC) posits that every finite simple graph with at least…
We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…
We review previous results providing sufficient conditions to determine the global dynamics for equivariant maps of the plane with a unique fixed point which is also hyperbolic.
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
For a representation of a finite group $G$ on a complex vector space $V$ we determine when a holomorphic $\binom{p}{q}$-tensor field on the principle stratum of the orbit space $V/G$ can be lifted to a holomorphic $G$-invariant tensor field…
Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…
We study the problem of determining, for a polynomial function $f$ on a vector space $V$, the linear transformations $g$ of $V$ such that $f g = f$. In case $f$ is invariant under a simple algebraic group $G$ acting irreducibly on $V$, we…
The complexity of graph homomorphisms has been a subject of intense study [11, 12, 4, 42, 21, 17, 6, 20]. The partition function $Z_{\mathbf A}(\cdot)$ of graph homomorphism is defined by a symmetric matrix $\mathbf A$ over $\mathbb C$. We…
We consider the problem of deciding if a group is the fundamental group of a smooth connected complex quasi-projective (or projective) variety using Alexander-based invariants. In particular, we solve the problem for large families of…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
Recently, the covariant formulation of the geometric bifurcation theory, developed in a previous paper, has been applied to two elementary problems: the study of limit cycles of dynamical systems and the second part of Hilbert's sixteenth…
We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…