Related papers: Counting Nodes in Smolyak Grids
We introduce a series of $\Z_2^n$-graded quasialgebras $\bbP_n(m)$ which generalizes Clifford algebras, higher octonions, and higher Cayley algebras. The constructed series of algebras and their minor perturbations are applied to contribute…
We investigate combinatorial properties of a kind of insets we defined in an earlier paper, interpreting them now in terms of restricted ternary words. This allows us to give new combinatorial interpretations of a number of known integer…
The Chekanov-Eliashberg differential graded algebra of a Legendrian knot L is a rich source of Legendrian knot invariants, as is the theory of generating families. The set P(L) of homology groups of augmentations of the Chekanov-Eliashberg…
We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…
We completely characterize the unimodal category for functions $f:\mathbb R\to[0,\infty)$ using a decomposition theorem obtained by generalizing the sweeping algorithm of Baryshnikov and Ghrist. We also give a characterization of the…
Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…
A note that points out the possibility to have p<1 in Sobolev type of inequalities by a use of the momomial structure of polynomials or power series. The proof is simple: Triangle angle inequality p*>1, monomial estimate from p* to exponent…
The detection of clusters of galaxies in large surveys plays an important part in extragalactic astronomy, and particularly in cosmology, since cluster counts can give strong constraints on cosmological parameters. X-ray imaging is in…
We give combinatorial proofs of some enumeration formulas involving labelled threshold, quasi-threshold, loop-threshold and quasi-loop-threshold graphs. In each case we count by number of vertices and number of components. For threshold…
In this work we show how the Multiplicity Polar Theorem can be used to calculate Chern numbers for a collection of 1-forms.
We present the plactic algebra on an arbitrary alphabet set $A$ by row generators and column generators respectively. We give Gr\"{o}bner-Shirshov bases for such presentations. In the case of column generators, a finite Gr\"{o}bner-Shirshov…
We introduce a new way to tabulate knots by representing knot diagrams using a pair of planar trees. This pair of trees have their edges labeled by integers, they have no valence 2 vertices, and they have the same number of valence 1…
We provide an effective uniform upper bond for the number of zeros of the first non-vanishing Melnikov function of a polynomial perturbations of a planar polynomial Hamiltonian vector field. The bound depends on degrees of the field and of…
This text is a presentation of a set of formulae, first found by Vainsencher (for $\delta \leq 6$) and shortly after improved by Kleiman and Piene, counting $\delta$-nodal curves in a complete linear system on a smooth surface, if $\delta…
We consider the problem of graph generation guided by network statistics, i.e., the generation of graphs which have given values of various numerical measures that characterize networks, such as the clustering coefficient and the number of…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
In 1941, G. Gr\"unwald proved the convergence of a sequence of operators constructed using classical Lagrange interpolation at Chebyshev nodes. In this work, we establish a perturbed version of Gr\"unwald's result, thereby extending the…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
In this article we continue to develop the theory of generating symmetries for integrable equations. A technique for computation of generating symmetries using Maple is presented. The technique is based on the standard symmetry method. By…