Related papers: Counting Nodes in Smolyak Grids
We show that the discrete versions of the systolic inequality that estimate the number of vertices of a simplicial complex from below have substantial applications to graphs, the one-dimensional simplicial complexes. Almost directly they…
By extending the notion of grid classes to include infinite grids, we establish a structural characterisation of the simple permutations in Av(4231, 35142, 42513, 351624), a pattern class which has three different connections with algebraic…
We present relations between some recently proposed methods for the solution of a nonlinear system of equations. In particular, we review the Shamanskii's m method, that is an iterative method derived from Newton's method that converge with…
We review some important results by Gross, Hacking, Keel, and Kontsevich on cluster algebra theory, namely, the column sign-coherence of $C$-matrices and the Laurent positivity, both of which were conjectured by Fomin and Zelevinsky. We…
When analyzing complex networks a key target is to uncover their modular structure, which means searching for a family of modules, namely node subsets spanning each a subnetwork more densely connected than the average. This work proposes a…
Ardila and Block used tropical results of Brugalle and Mikhalkin to count nodal curves on a certain family of toric surfaces. Building on a linearity result of the first author, we revisit their work in the context of the…
In 1964, Golod and Shafarevich found that, provided that the number of relations of each degree satisfy some bounds, there exist infinitely dimensional algebras satisfying the relations. These algebras are called Golod-Shafarevich algebras.…
New sets (typically found by computer search) with Sidon constant equal to the square root of their cardinalities are given. For each integer $N$ there are only a finite number of groups of prime order containing $N$-element extreme sets.…
In this paper we give an asymptotic bound of the cardinality of Zariski multiples of particular plane singular curves. These curves have only nodes and cusps as singularities and are obtained as branched curves of ramified covering of the…
Gaussian mixture model is very useful in many practical problems. Nevertheless, it cannot be directly generalized to non Euclidean spaces. To overcome this problem we present a spherical Gaussian-based clustering approach for partitioning…
Clustering is a commonplace problem in many areas of data science, with applications in biology and bioinformatics, understanding chemical structure, image segmentation, building recommender systems, and many more fields. While there are…
A new one-parameter family of iterative method for solving nonlinear equations is constructed and studied. Two variants, both with cubic convergence, are developed, one for finding simple zeros and other for multiple zeros of known…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
In network theory, a triad census is a method designed to categorize and enumerate the various types of subgraphs with three nodes and their connecting edges within a network. Triads serve as fundamental building blocks for comprehending…
We generalize a formula on the counting of prime geodesics, due to Kuznetsov-Bykovskii, used in the work of Soundararajan-Young on the prime geodesic theorem. The method works over any number field and for any congruence subgroup. We give…
Closed formulae for all Gaussian or optimal, 1-parameter quadrature rules in a compact interval [a, b] with non uniform, asymmetric subintervals, arbitrary number of nodes per subinterval for the spline classes $S_{2N, 0}$ and $S_{2N+1,…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a stochastic maximal inequality derived by using It\^o's formula and on a new…
This paper provides a detailed expository and computational account of the elementary methods developed by P. L. Chebyshev and J. J. Sylvester to establish explicit bounds on the prime counting function. The core of the method involves…
The aim of this paper is to construct general forms of ordinary generating functions for special numbers and polynomials involving Fibonacci type numbers and polynomials, Lucas numbers and polynomials, Chebyshev polynomials, Sextet…
For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…