Related papers: Absorbing sets of homogeneous subtractive algorith…
Many quantum algorithms, including Shor's celebrated factoring and discrete log algorithms, proceed by reduction to a Hidden Subgroup problem, in which an unknown subgroup H of a group G must be determined from a uniform superposition on a…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Mathematical diffraction theory is concerned with the analysis of the diffraction image of a given structure and the corresponding inverse problem of structure determination. In recent years, the understanding of systems with continuous and…
The spectral analysis of discretized one-dimensional Schr\"{o}dinger operators is a very difficult problem which has been studied by numerous mathematicians. A natural problem at the interface of numerical analysis and operator theory is…
This paper studies the concept of algorithmic equiresolution of a family of embedded varieties or ideals, which means a simultaneous resolution of such a family compatible with a given (suitable) algorithm of resolution in characteristic…
In algebraic geometry, there is a reduction algorithm that transforms the unreduced divisor into a unique reduced divisor, which existence is guaranteed by the Riemann-Roch theorem. We discuss application of this algorithm to construction…
Graphical models have been popularly used for capturing conditional independence structure in multivariate data, which are often built upon independent and identically distributed observations, limiting their applicability to complex…
This paper present the important role that random system with complete connections played in solving the Gauss problem associated to the regular continued fractions. Hence, using the ergodic behavior of homogeneous random system with…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
Recently, A. I. Aptekarev and his collaborators found a sequence of rational approximations to Euler's constant $\gamma$ defined by a third-order homogeneous linear recurrence. In this paper, we give a new interpretation of Aptekarev's…
The idea that symmetries simplify or reduce the complexity of a system has been remarkably fruitful in physics, and especially in quantum mechanics. On a mathematical level, symmetry groups single out a certain structure in the Hilbert…
We incorporate inertial terms in the hybrid proximal-extragradient algorithm and investigate the convergence properties of the resulting iterative scheme designed for finding the zeros of a maximally monotone operator in real Hilbert…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
We present a new probabilistic algorithm that characterizes the equidimensional components of the affine algebraic variety defined by an arbitrary sparse polynomial system with prescribed supports. For each equidimensional component, the…
An important problem in computational topology is to calculate the homology of a space from samples. In this work, we develop a statistical approach to this problem by calculating the expected rank of an induced map on homology from a…
We consider the problem of embedding the nodes of a hypergraph into Euclidean space under the assumption that the interactions arose through closeness to unknown hyperedge centres. In this way, we tackle the inverse problem associated with…
We consider the question of which zero-dimensional schemes deform to a collection of distinct points; equivalently, we ask which Artinian k-algebras deform to a product of fields. We introduce a syzygetic invariant which sheds light on this…
In this paper, we consider the problem of finding an almost surely common fixed point of a family of paracontraction maps indexed on a probability space, which we refer to as the stochastic feasibility problem. We show that a random…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…