Related papers: Method for searching higher symmetries for quad gr…
In this paper we consider the classification of dispersive linearizable partial difference equations defined on a quad-graph by the multiple scale reduction around their harmonic solution. We show that the A_1, A_2 and A_3 linearizability…
The heights of iterates of the discrete Painleve equations over number fields appear to grow no faster than polynomials while the heights of generic solutions of non-integrable discrete equations grow exponentially. This gives rise to a…
We describe a polynomial time algorithm for, given an undirected graph G, finding the minimum dimension d such that G may be isometrically embedded into the d-dimensional integer lattice Z^d.
One common type of symmetry is when values are symmetric. For example, if we are assigning colours (values) to nodes (variables) in a graph colouring problem then we can uniformly interchange the colours throughout a colouring. For a…
We use the generalized concurrence approach to investigate the general multipartite separability problem. By extending the preconcurrence matrix formalism to arbitrary multipartite systems, we show that the separability problem can be…
We analyze the classical equations of motion for a particle moving in the presence of a static magnetic field applied in the $ z $ direction, which varies as $ {1\over{x^2}} $. We find the symmetries through Lie's method of group analysis.…
A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
The study of nonlinear phenomena in systems with many degrees of freedom often relies on complex numerical simulations. In trying to model realistic situations, these systems may be coupled to an external environment which drives their…
We investigate static cylindrical solutions within an extended theory of modified gravity. By incorporating various coupling functions through a straightforward boost symmetry approach, we establish the equations of motion in a…
I review motivations for the study of supersymmetric field theories by lattice techniques. In particular, some of the more interesting potential applications are described. These are models of quantum gravity, that rely on the AdS/CFT…
Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum…
As the scope of Computational Fluid Dynamics (CFD) grows to encompass ever larger problem scales, so does the interest in whether quantum computing can provide an advantage. In recent years, Quantum Lattice Gas Automata (QLGA) and Quantum…
A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning vertices into equivalence classes, which in turn reduces the…
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…
Testing for independence between graphs is a problem that arises naturally in social network analysis and neuroscience. In this paper, we address independence testing for inhomogeneous Erd\H{o}s-R\'{e}nyi random graphs on the same vertex…
While symmetry has been exploited to analyze synchronization patterns in complex networks, the identification of symmetries in large-size network remains as a challenge. We present in the present work a new method, namely the method of…
Symmetry breaking for graphs and other combinatorial objects is notoriously hard. On the one hand, complete symmetry breaks are exponential in size. On the other hand, current, state-of-the-art, partial symmetry breaks are often considered…
In this paper we describe a methodology for the identification of symmetric quadrature rules inside of quadrilaterals, triangles, tetrahedra, prisms, pyramids, and hexahedra. The methodology is free from manual intervention and is capable…