Related papers: Base 3/2 and Greedily Partitioned Sequences
The fractal dimension of domain walls produced by changing the boundary conditions from periodic to anti-periodic in one spatial direction is studied using both the strong-disorder renormalization group and the greedy algorithm for the…
We present graph-based translation models which translate source graphs into target strings. Source graphs are constructed from dependency trees with extra links so that non-syntactic phrases are connected. Inspired by phrase-based models,…
The syntactic structure of a sentence can be modeled as a tree where vertices are words and edges indicate syntactic dependencies between words. It is well-known that those edges normally do not cross when drawn over the sentence. Here a…
In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an algorithm to find a variable ordering (if it exists) s.t. a…
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers- equations made of…
A graph drawing is $\textit{greedy}$ if, for every ordered pair of vertices $(x,y)$, there is a path from $x$ to $y$ such that the Euclidean distance to $y$ decreases monotonically at every vertex of the path. Greedy drawings support a…
Let $b$ be a positive integer greater than 1, $N$ a positive integer relatively prime to $b$, $ |b|_{N}$ the order of $b$ in the multiplicative group $% \mathbb{U}_{N}$ of positive integers less than $N$ and relatively primes to $% N,$ and…
The Greedy binary search tree (BST) algorithm, like the Splay tree, is a prominent candidate for the \emph{dynamic optimality conjecture}. While Greedy satisfies many desirable properties of BST, its cost and analysis to execute a search…
In this note we extend the notion of greedy bases developed by Lee, Li, and Zelevinsky to rank two generalized cluster algebras, i.e. binomial exchange relations are replaced by polynomial exchange relations. In the process we give a…
In a recent paper on a study of the Sylow 2-subgroups of the symmetric group with 2^n elements it has been show that the growth of the first (n-2) consecutive indices of a certain normalizer chain is linked to the sequence of partitions of…
Identifying the structure of a partially observed causal system is essential to various scientific fields. Recent advances have focused on constraint-based causal discovery to solve this problem, and yet in practice these methods often face…
We give heuristic arguments and computer results to support the hypothesis that, after appropriate rescaling, the statistics of spacings between adjacent prime numbers follows the Poisson distribution. The scaling transformation removes the…
Consider the Hitting Set problem where, for a given universe $\mathcal{X} = \left\{ 1, ... , n \right\}$ and a collection of subsets $\mathcal{S}_1, ... , \mathcal{S}_m$, one seeks to identify the smallest subset of $\mathcal{X}$ which has…
We prove that the set of permutations sorted by a stack of depth $t \geq 3$ and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a…
Given a graph on $n$ vertices and an integer $k$, the feedback vertex set problem asks for the deletion of at most $k$ vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided…
The main results in this paper contribute to bring to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory with the well established techniques of classical Banach…
In this paper, we present an effective method to characterize completely when a disconnected fractal square has only finitely many connected components. Our method is to establish some graph structures on fractal squares to reveal the…
In the plane, three integer points ("fleas") are given. At every tick of time, two of them (say, P,Q) instantly jump to two vacant points R,S, so that PQRS is a square with that order of vertices. Description of all integers and…
We show that normality for continued fractions expansions and normality for base-$b$ expansions are maximally logically separate. In particular, the set of numbers that are normal with respect to the continued fraction expansion but not…
In the Steiner Forest problem, we are given terminal pairs $\{s_i, t_i\}$, and need to find the cheapest subgraph which connects each of the terminal pairs together. In 1991, Agrawal, Klein, and Ravi, and Goemans and Williamson gave…