Related papers: Absorbing sets of homogeneous subtractive algorith…
We study the ergodic theory of a one-parameter family of interval maps T_alpha arising from generalized continued fraction algorithms. First of all, we prove the dependence of the metric entropy of T_alpha to be Hoelder-continuous in the…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
Biological and physical systems often exhibit distinct structures at different spatial/temporal scales. Persistent homology is an algebraic tool that provides a mathematical framework for analyzing the multi-scale structures frequently…
We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be…
Using the slow triangle map (a type of multi-dimensional continued fraction algorithm), we exhibit a method for generating any number of new identities for subsets of integer partitions.
We analyze the embedding dimension of a normal weighted homogeneous surface singularity, and more generally, the Poincar\'e series of the minimal set of generators of the graded algebra of regular functions, provided that the link of the…
A basic result in the elementary theory of continued fractions says that two real numbers share the same tail in their continued fraction expansions iff they belong to the same orbit under the projective action of PGL(2,Z). This result was…
One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of…
In this paper, we study the nonnegative matrix factorization problem under the separability assumption (that is, there exists a cone spanned by a small subset of the columns of the input nonnegative data matrix containing all columns),…
Most well-known multidimensional continued fractions, including the M\"{o}nkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by…
We introduce the notion of matrices graph, defining continued fraction algorithms where the past and the future are almost independent. We provide an algorithm to convert more general algorithms into matrices graphs. We present an algorithm…
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…
In this paper we give a geometric interpretation of the renormalization algorithm and of the continued fraction map that we introduced in arxiv:0905.0871 to give a characterization of symbolic sequences for linear flows in the regular…
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
F.~Schweiger introduced the fibred system in \cite{Schweiger-MCF}, to unify and generalize many known continued fraction algorithms. An advantage of a fibred system is that it often provides a systematic construction of absolutely…
We study bihomogeneous systems defining, non-zero dimensional, biprojective varieties for which the projection onto the first group of variables results in a finite set of points. To compute (with) the 0-dimensional projection and the…
We study the thresholds for the property of containing a solution to a linear homogeneous system in random sets. We expand a previous sparse Sz\'emeredi-type result of Schacht to the broadest class of matrices possible. We also provide a…
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…
In the present paper, we study a set that can be treated as a generalised set of subsums for a geometric series. This object was discovered independently in various mathematical aspects. For instance, it is closely related to various…
We develop a continued fraction algorithm in finite extensions of $\Q_p$ generalising certain algorithms in $\Q_p$, and prove the finiteness property for certain small degree extensions. We also discuss the metrical properties of the…