Related papers: On the growth of hypergeometric sequences
We show that every continuous homogeneous quasimorphism on a finite-dimensional 1-connected simple Lie group arises as the relative growth of any continuous bi-invariant partial order on that group. More generally we show, that an arbitrary…
In this paper, we propose a simple and effective {geometric} model fitting method to fit and segment multi-structure data even in the presence of severe outliers. We cast the task of geometric model fitting as a representative mode-seeking…
We consider hypergraph network design problems where the goal is to construct a hypergraph that satisfies certain connectivity requirements. For graph network design problems where the goal is to construct a graph that satisfies certain…
The Hales numbered $n$-dimensional hypercube and the corresponding adjacency matrix exhibit interesting recursive structures in $n$. These structures lead to a very simple proof of the well-known bandwidth formula for hypercube, whose proof…
A class of associative (super) algebras is presented, which naturally generalize both the symmetric algebra $Sym(V)$ and the wedge algebra $\wedge (V)$, where $V$ is a vector-space. These algebras are in a bijection with those subsets of…
The rational points of a smooth curve $X$ over a number field $k$ map to the set of augmentations of the associated motivic algebra. An expectation, related to Kim's conjecture, is that for $X$ hyperbolic, the set of augmentations which…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Pin sequences play an important role in the structural study of permutation classes. In this paper, we study the permutation classes that comprise all the finite subpermutations contained in an infinite pin sequence. We prove that these…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
Model selection for regression problems with an increasing number of covariates continues to be an important problem both theoretically and in applications. Model selection consistency and mean structure reconstruction depend on the…
We present a general class of geometric network growth mechanisms by homogeneous attachment in which the links created at a given time $t$ are distributed homogeneously between a new node and the exising nodes selected uniformly. This is…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
Geometric constraints impact the formation of a broad range of spatial networks, from amino acid chains folding to proteins structures to rearranging particle aggregates. How the network of interactions dynamically self-organizes in such…
Several systems can be represented by hypergraphs, an extension of graphs with associations between any number of vertices. These natural hypergraphs doe not appear at once. They are generated by some dynamical process of hypergraph…
For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
We propose a distributional theory of how hypernymy -- the ``is-a'' relation between general and specific concepts -- is encoded geometrically in language representations. Starting from the empirically verified assumption that words closer…
The study of sequences of polynomials satisfying high order recurrence relations is connected with the asymptotic behavior of multiple orthogonal polynomials, the convergence properties of type II Hermite-Pad\'e approximation, and…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem…