Related papers: The Higman operations and embeddings of recursive …
We study the complexity of the following related computational tasks concerning a fixed countable graph G: 1. Does a countable graph H provided as input have a(n induced) subgraph isomorphic to G? 2. Given a countable graph H that has a(n…
Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
We classify irreducible representations of the special linear groups in positive characteristic with small weight multiplicities with respect to the group rank and give estimates for the maximal weight multiplicities. For the natural…
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
Biclustering involves the simultaneous clustering of objects and their attributes, thus defining local two-way clustering models. Recently, efficient algorithms were conceived to enumerate all biclusters in real-valued datasets. In this…
It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…
One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we continue the work of [7] to adapt the machinery of globular operads [4] to…
Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…
We use algebraic methods to compute the simple Hurwitz numbers for arbitrary source and target Riemann surfaces. For an elliptic curve target, we reproduce the results previously obtained by string theorists. Motivated by the Gromov-Witten…
We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore,…
We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…
A circular program creates a data structure whose computation depends upon itself or refers to itself. The technique is used to implement the classic data structures circular and doubly-linked lists, threaded trees and queues, in a…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
The Hilbert spaces $\mathscr{H}_{w}$ consisiting of Dirichlet series $F(s)=\sum_{ n = 1}^\infty a_n n^{ -s }$ that satisfty $\sum_{ n=1 }^\infty | a_n |^2/ w_n < \infty$, with $\{w_n\}_n$ of average order $\log_j n$ (the $j$-fold logarithm…
Algorithms to generate various combinatorial structures find tremendous importance in computer science. In this paper, we begin by reviewing an algorithm proposed by Rohl that generates all unique permutations of a list of elements which…