Related papers: A Combinatorial Algorithm for Computing Higher Ord…
Given a closed, oriented, connected 3-manifold, M, we define higher-order linking forms on the higher-order Alexander modules of M. These higher-order linking forms generalize similar linking forms for knots previously studied by the…
We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…
A bi-level optimization framework (BiOPT) was proposed in [3] for convex composite optimization, which is a generalization of bi-level unconstrained minimization framework (BLUM) given in [20]. In this continuation paper, we introduce a…
Link prediction has been widely studied as an important research direction. Higher-order link prediction has gained especially significant attention since higher-order networks provide a more accurate description of real-world complex…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
This paper presents a significant advancement in the estimation of the Composite Link Model within a penalized likelihood framework, specifically designed to address indirect observations of grouped count data. While the model is effective…
This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…
Hypergraphs offer flexible and robust data representations for many applications, but methods that work directly on hypergraphs are not readily available and tend to be prohibitively expensive. Much of the current analysis of hypergraphs…
Three-component links in the 3-dimensional sphere were classified up to link homotopy by John Milnor in his senior thesis, published in 1954. A complete set of invariants is given by the pairwise linking numbers p, q and r of the…
We revisit the discrete additive and multiplicative coalescents, starting with $n$ particles with unit mass. These cases are known to be related to some "combinatorial coalescent processes": a time reversal of a fragmentation of Cayley…
It is natural to try to place the new polynomial invariants of links in algebraic topology (e.g. to try to interpret them using homology or homotopy groups). However, one can think that these new polynomial invariants are byproducts of a…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
Identifying patterns of relations among the units of a complex system from measurements of their activities in time is a fundamental problem with many practical applications. Here, we introduce a method that detects dependencies of any…
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the…
We prove an NP upper bound on a theory of integer-indexed integer-valued arrays that extends combinatory array logic with an ordering relation on the index set and the ability to express sums of elements. We compare our fragment with seven…
We extend the methods developed in our earlier work to algorithmically compute the intersection cohomology Betti numbers of reductive varieties. These form a class of highly symmetric varieties that includes equivariant compactifications of…
From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…
High order cumulant tensors carry information about statistics of non-normally distributed multivariate data. In this work we present a new efficient algorithm for calculation of cumulants of arbitrary order in a sliding window for data…
In this paper, we present the algorithm that alters the subset of marginals of multivariate standard distributed data into such modelled by an Archimedean copula. Proposed algorithm leaves a correlation matrix almost unchanged, but…
Networks can describe the structure of a wide variety of complex systems by specifying which pairs of entities in the system are connected. While such pairwise representations are flexible, they are not necessarily appropriate when the…