Related papers: A variation on bisecting the binomial coefficients
We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the…
The {\it largest angle bisection} procedure is the operation which partitions a given triangle, $T$, into two smaller triangles by constructing the angle bisector of the largest angle of $T$. Applying the procedure to each of these two…
It is well known that a binomial $(n,p)$ can be approximated by a Poisson distribution with parameter $np$. The typical approach in undergraduate probability texts is to show a convergence result for the distribution of the binomial as $n$…
We show that every source connected Lie groupoid always has global bisections through any given point. This bisection can be chosen to be the multiplication of some exponentials as close as possible to a prescribed curve. The existence of…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving…
In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we show that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result. Second, we obtain a number of new…
The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…
The usual methods for root finding of polynomials are based on the iteration of a numerical formula for improvement of successive estimations. The unpredictable nature of the iterations prevents to search roots inside a pre-specified region…
This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…
In this paper we study recurrences concerning the combinatorial sum $[n,r]_m=\sum_{k\equiv r (mod m)}\binom {n}{k}$ and the alternate sum $\sum_{k\equiv r (mod m)}(-1)^{(k-r)/m}\binom{n}{k}$, where m>0, $n\ge 0$ and r are integers. For…
The Elvis problem has been studied in [2], which proves existence of solutions. However, their computation in the non-smooth case remains unsolved. A bisection method is proposed to solve the Elvis problem in two space dimensions for…
A new parameterization and algorithm are proposed for seeking the primary relative maximum of the likelihood function in the three-parameter lognormal distribution. The parameterization yields the dimension reduction of the three-parameter…
In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…
We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…
We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face. Above, each non-oriented map…
We propose a \textit{purely combinatorial algorithm} for \mkvc{} in bipartite graphs, achieving approximation ratio~0.7. The only combinatorial algorithms currently known until now for this problem are the natural greedy algorithm, that…
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.