Related papers: A discreteness algorithm for 4-punctured sphere gr…
In this paper we study the construction of a discrete solution for a hyperbolic system of partial differentials of the strongly coupled type. In its construction, the discrete separation of matricial variable method was followed. Two…
We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…
Let $H^n$ be the hyperbolic n-space with $n\geq 2$. Suppose that $\Gamma<Isom H^n$ is a discrete, torsion free subgroup and $a$ is a point in the domain of discontinuity $\Omega(\Gamma)$. Let $p$ be the projection map from $H^n$ to the…
Classification of differential-difference equation of the form $\ddot{u}_{nm}=F_{nm}\big(t, \{u_{pq}\}|_{(p,q)\in \Gamma}\big)$ are considered according to their Lie point symmetry groups. The set $\Gamma$ represents the point $(n,m)$ and…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
The cornerstone underpinning deep learning is the guarantee that gradient descent on an objective converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, where there are multiple…
The density matrix renormalization group (DMRG) algorithm was originally designed to efficiently compute the zero temperature or ground-state properties of one dimensional strongly correlated quantum systems. The development of the…
We study pseudo-simple heteroclinic cycles for a $\Gamma$-equivariant system in $R^4$ with finite $\Gamma\subset O(4)$, and their nearby dynamics. In particular, in a first step towards a full classification - analogous to that which exists…
The discrete ordinates method with angular parameters is discussed in light of the recent extension of its underlying hypothesis. The analysis shows that the method, although it compares very well with the trajectory of photons model, it…
The gradient discretisation method (GDM) is a generic framework designed recently, as a discretise in spatial space, to partial differential equations. This paper aims to use the GDM to establish a first general error estimate for numerical…
Discrete gradient methods are a powerful tool for the time discretization of dynamical systems, since they are structure-preserving regardless of the form of the total energy. In this work, we discuss the application of discrete gradient…
A new field of discrete differential geometry is presently emerging on the border between differential and discrete geometry. Whereas classical differential geometry investigates smooth geometric shapes (such as surfaces), and discrete…
Let SL(2, $\mathbb H$) be the group of $2 \times 2$ quaternionic matrices $A=\begin{pmatrix} a & b \\ c & d \end{pmatrix}$ with quaternionic determinant $\det A=|ad-aca^{-1} b|=1$. This group acts by the orientation-preserving isometries of…
A new systematic method is developed to study to what extent the symmetry requirements alone, above all the invariance under 16 supersymmetries (SUSY), determine the completely off-shell effective action $\Gamma$ of a D-particle, i.e.…
We address some conjectures and open problems in "analysis of symmetries" which include the study of non-commutative harmonic analysis and discontinuous groups for reductive homogeneous spaces beyond the classical framework: (1) discrete…
The pure braid group \Gamma of a quadruply-punctured Riemann sphere acts on the SL(2,C)-moduli M of the representation variety of such sphere. The points in M are classified into \Gamma-orbits. We show that, in this case, the monodromy…
We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…
Motivated by growing concerns over ensuring privacy on social networks, we develop new algorithms and impossibility results for fitting complex statistical models to network data subject to rigorous privacy guarantees. We consider the…
Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many algorithms…
In this exploration paper, we design algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete sphere. Such a contraction is a kind of shrinking or reducing process. In our algorithms, we need to…