Related papers: How to construct generalized van der Corput sequen…
Given a set of $n$ points $P$ in the plane, the first layer $L_1$ of $P$ is formed by the points that appear on $P$'s convex hull. In general, a point belongs to layer $L_i$, if it lies on the convex hull of the set $P \setminus…
We describe a general purpose algorithm for counting simple cycles and simple paths of any length $\ell$ on a (weighted di)graph on $N$ vertices and $M$ edges, achieving a time complexity of $O\left(N+M+\big(\ell^\omega+\ell\Delta\big)…
In the present paper the authors construct normal numbers in base $q$ by concatenating $q$-adic expansions of prime powers $\lfloor\alpha p^\theta\rfloor$ with $\alpha>0$ and $\theta>1$.
The authors recently introduced so-called Vandermonde nets. These digital nets share properties with the well-known polynomial lattices. For example, both can be constructed via component-by-component search algorithms. A striking…
We rely on the framework of Morse sequences to enable the direct computation of gradient vector fields on simplicial complexes. A Morse sequence is a filtration from a subcomplex $L$ to a complex $K$ via elementary expansions and fillings,…
This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x- / y- coordinates separately, and later create a group…
Key to structured prediction is exploiting the problem structure to simplify the learning process. A major challenge arises when data exhibit a local structure (e.g., are made by "parts") that can be leveraged to better approximate the…
In the relativistic and the nonrelativistic theoretical treatment of moderate and high-power laser-matter interaction, the generalized Bessel function occurs naturally when a Schr\"odinger-Volkov and Dirac-Volkov solution is expanded into…
Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…
In this paper, we present a stable and efficient approach for constructing Laguerre pseudospectral differentiation matrices. The proposed method reformulates the off-diagonal entries and computes all required quantities simultaneously using…
We define a compilation scheme for a constructor-based, strongly-sequential, graph rewriting system which shortcuts some needed steps. The object code is another constructor-based graph rewriting system. This system is normalizing for the…
In the paper, we represent a comparison analysis of the methods of the topological alignment and extract the main mathematical principles forming the base of the concept. The main narrative is devoted to the so-called coupled methods…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
This paper describes the application of the method of probabilistic solutions (MPS) to numerically solve the Dirichlet generalized and classical harmonic problems for irregular n sided pyramidal domains. Here, generalized means that the…
We investigate a family of $4$-regular graphs constructed to test for the presence of combinatorial structure in a sequence of distinct real numbers. We show that the graphs constructed from the Kronecker sequence can be embedded into the…
We give a detailed account of the classical Van Kampen method for computing presentations of fundamental groups of complements of complex algebraic curves, and of a variant of this method, working with arbitrary projections (even with…
This paper explores a full generalization of the classical corner-vector method for constructing weighted spherical designs, which we call the {\it generalized corner-vector method}. First we establish a uniform upper bound for the degree…
This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…
We give a number of theoretical and practical methods related to the computation of L-functions, both in the local case (counting points on varieties over finite fields, involving in particular a detailed study of Gauss and Jacobi sums),…
A standard assumption in the study of logarithmic structures is "fineness", but this assumption is not preserved by intersections, fiber products, and more general limits. We explain how a coherent logarithmic scheme $X$ has a natural…