arXiv research

Grid homology properties for MOY graphs studied.

The study explores convex unions and completions in simplicial pseudomanifolds, revealing unexpected behavior.

New graph shows edge deletion/contraction doesn't always result in intrinsically linked graphs.

Paper determines Assouad-Nagata dimension for all minor-closed metrics.

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps.

Graph Neural Network (GNN) research has concentrated on improving convolutional layers, with little attention paid to developing graph pooling layers. Yet pooling layers can enable GNNs to reason over abstracted groups of nodes instead of single nodes. To close this gap, we propose a graph pooling layer relying on the …

We present a necessary and sufficient condition for existence of a contractible, non-separating and noncontractible separating Hamiltonian cycle in the edge graph of polyhedral maps on surfaces. In particular, we show the existence of contractible Hamiltonian cycle in equivelar triangulated maps. We also present an alg…

Bayesian KANs achieve near-minimax posterior contraction rates in anisotropic Besov spaces.

Kakimizu complex of a knot is a flag simplicial complex whose vertices correspond to minimal genus Seifert surfaces and edges to disjoint pairs of such surfaces. We discuss a general setting in which one can define a similar complex. We prove that this complex is contractible, which was conjectured by Kakimizu. More ge…

There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call the noncrossing partition link because it is the link of an edge in the former. …

Characterizes Forman curvature bounds and proves curvature equivalence.

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that $G/e$ is planar, as well as the analogues with a universal quantifier: $\forall v$…

We extend average edge order results to normal 3-pseudomanifolds.

Two algorithms learn Gaussian graphical models from Glauber dynamics trajectories.

The paper examines how edge subdivisions affect the vanishing of $L^2$-homology in Coxeter groups.

A triangulation of a surface with fixed topological type is called irreducible if no edge can be contracted to a vertex while remaining in the category of simplicial complexes and preserving the topology of the surface. A complete list of combinatorial structures of irreducible triangulations is made by hand for the on…

The study characterizes homology 4-manifolds with $g_2\leq 5$ combinatorially.

Filling length measures the length of the contracting closed loops in a null-homotopy. The filling length function of Gromov for a finitely presented group measures the filling length as a function of length of edge-loops in the Cayley 2-complex. We give a bound on the filling length function in terms of the log of an …

In this paper Legendrian graphs in $(\mathbb{R}^3,ξ_{\mathrm{st}})$ are considered modulo Legendrian isotopy and edge contraction. To a Legendrian graph we associate a (generalized) rectangular diagram --- a purely combinatorial object. Moves of rectangular diagrams are introduced so that equivalence classes of Legendr…

The study characterizes 3-pseudomanifolds with up to two singularities.

We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically 3-linked and 4-linked directed graphs. We introduce two operations, consistent edg…

This short review is the result of a minicourse at the Sapienza University of Rome the author gave about the proof of the $g$-theorem. We review the hard Lefschetz theorem for simplicial spheres, as well as the theory at its core: perturbations of maps, biased Poincaré pairings and a cobordism argument that relates the…

A plane graph $H$ is a {\em plane minor} of a plane graph $G$ if there is a sequence of vertex and edge deletions, and edge contractions performed on the plane, that takes $G$ to $H$. Motivated by knot theory problems, it has been asked if the plane minor relation is a well-quasi-order. We settle this in the affirmativ…

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$ marked points on the boundary) with an arbitrary oriented surface with a number of la…

Foresight Arena benchmarks AI forecasting on real-world markets, isolating predictive edge.

Paper proposes new methods for improving interatomic potentials.

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a number of known results. New results include a combinatorial characterization of c…

We introduce tensor network contraction algorithms for the evaluation of the Jones polynomial of arbitrary knots. The value of the Jones polynomial of a knot maps to the partition function of a $q$-state Potts model defined as a planar graph with weighted edges that corresponds to the knot. For any integer $q$, we cast…

Hierarchical graph learning for calendar spread strategies in commodity futures markets

The spectral geometry of mesh matrices of graphs is explored, leading to new formulas and eigenvalue estimates.

This paper optimizes portfolio compression by reducing excess notional in market contracts.

Machine learning algorithms learn from data and use data from databases that are mutable; therefore, the data and the results of machine learning cannot be fully trusted. Also, the machine learning process is often difficult to automate. A unified analytical framework for trustable machine learning has been presented i…

The study examines how gamma positivity and PL homeomorphism types affect simplicial spheres.

The paper explores coalescent contractions in contractible spaces, providing criteria and examples.

Computable contracts simplify financial transactions and reduce legal costs.

The seniority of debt, which determines the order in which a bankrupt institution repays its debts, is an important and sometimes contentious feature of financial crises, yet its impact on system-wide stability is not well understood. We capture seniority of debt in a multiplex network, a graph of nodes connected by mu…

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

Debt swaps improve financial networks by optimizing clearing payments and stability.

Optimal execution strategy for merger & acquisition contracts with price impact.

Minimal crystallizations of simply connected PL 4-manifolds are very natural objects. Many of their topological features are reflected in their combinatorial structure which, in addition, is preserved under the connected sum operation. We present a minimal crystallization of the standard PL K3 surface. In combination w…

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

Proposes a probabilistic framework for smart contract risk quantification.

We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centralized contracting implemented via mechanisms is equivalent to delegat…

Proposes a Bayesian approach for automatic node selection in sparse neural networks.

This is an account of the theory of JSJ decompositions of finitely generated groups, as developed in the last twenty years or so. We give a simple general definition of JSJ decompositions (or rather of their Bass-Serre trees), as maximal universally elliptic trees. In general, there is no preferred JSJ decomposition, a…

Improved security of smart contracts by classifying them into four categories.

Study on contracting maps and their rigidity under curvature constraints.

We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also prove a related structure theorem for locally compact contractive local groups whic…