An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral indentities.
An almost naive algorithm for finding relative neighbourhood graphs in metrics
An alternative construction of normal numbers
A new class of -adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the -adic block determined by the path contains the maximal number of different -adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known concatenative...
An alternative definition of the notion valuation in the theory of near polygons.
An analogon of the fixed-point theorem and its application for graphs
An analogue of covering space theory for ranked posets.
An analogue of Jeu de taquin for Littelmann's crystal paths.
An analogue to Robinson-Schensted correspondence for oscillating tableaux.
An analytic formula for the Jack polynomials.
An answer to a question by Wilf on packing distinct patterns in a permutation.
An anti-Ramsey condition on trees.
An anti-Ramsey theorem on edge-cuts
Let G = (V(G), E(G)) be a connected multigraph and let h(G) be the minimum integer k such that for every edge-colouring of G, using exactly k colours, there is at least one edge-cut of G all of whose edges receive different colours. In this note it is proved that if G has at least 2 vertices and has no bridges, then h(G) = |E(G)| -|V(G)| + 2.
An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs
An application of Halls' theorems to matrices
An application of nonprarametric Cox regression model in reliability analysis: a case study
The contribution deals with an application of the nonparametric version of Cox regression model to the analysis and modeling of the failure rate of technical devices. The objective is to recall the method of statistical analysis of such a model, to adapt it to the real–case study, and in such a way to demonstrate the flexibility of the Cox model. The goodness-of-fit of the model is tested, too, with the aid of the graphical test procedure based on generalized residuals.
An application of Pólya’s enumeration theorem to partitions of subsets of positive integers
Let be a non-empty subset of positive integers. A partition of a positive integer into is a finite nondecreasing sequence of positive integers in with repetitions allowed such that . Here we apply Pólya’s enumeration theorem to find the number of partitions of into , and the number of distinct partitions of into . We also present recursive formulas for computing and .
An application of Ramanujan graphs to C*-algebra tensor products, II
An application of Ramsey's theory to partition in groups. - II
An application of Ramsey's theory to partitions in groups - I
An application of set-pair systems for multitransversals