Related papers: Finite partitions for several complex continued fr…
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Computer based techniques for recognizing finitely presented groups are quite powerful. Tools available for this purpose are outlined. They are available both in stand-alone programs and in more comprehensive systems. A general…
In this paper, the (infinite) direct product of fields is investigated. In particular, the finiteness of a given set is characterized in terms of some ring-theoretic observations. Next, a certain localization (whose multiplicative set…
Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…
Using exhaustion method and finite differences a new method to solve system of partial differential equations and is presented. This method allows design algorithm to solve linear and nonlinear systems in irregular domains. Applying this…
In this paper we study the possibility to define irreducible representations of the symmetric groups with the help of finitely many relations. The existence of finite bases is established for the classes of representations corresponding to…
We investigate some properties of the higher continued fractions defined recently by Musiker, Ovenhouse, Schiffler, and Zhang. We prove that the maps defining the higher continued fractions are increasing continuous functions on the…
Self-similar sets require a separation condition to admit a nice mathematical structure. The classical open set condition (OSC) is difficult to verify. Zerner proved that there is a positive and finite Hausdorff measure for a weaker…
This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.
We compare two families of continued fractions algorithms, the symmetrized Rosen algorithm and the Veech algorithm. Each of these algorithms expands real numbers in terms of certain algebraic integers. We give explicit models of the natural…
We study a two-parameter family of one-dimensional maps and related (a,b)-continued fractions suggested for consideration by Don Zagier. We prove that the associated natural extension maps have attractors with finite rectangular structure…
We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…
The aim of this article is to derive discontinuous finite elements vector spaces which can be put in a discrete de-Rham complex for which an harmonic gap property may be proven. First, discontinuous finite element spaces inspired by…
We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…
The fact that the euclidean algorithm eventually terminates is pervasive in mathematics. In the language of continued fractions, it can be stated by saying that the orbits of rational points under the Gauss map x-->{1/x} eventually reach…
The following article treats about convex geometries which are lower semi-modular and join semi-distributive lattices. Firstly, it is shown that there is a class $K$ of infinite convex geometries which can be build out of finite ones by…
We introduce the notion of accurate foundation sets and the accurate refinement property for right LCM semigroups. For right LCM semigroups with this property, we derive a more explicit presentation of the boundary quotient. In the context…
We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…
Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…
We design an algorithm to find certain partial permutation representations of a finitely presented group $G$ (the bricks) that may be combined to a transitive permutation representation of $G$ (the mosaic) on the disjoint union.