Related papers: Confluence by Decreasing Diagrams -- Formalized
Retraction maps have been generalized to discretization maps in (Barbero Li\~n\'an and and Mart\'{\i}n de Diego, 2022). Discretization maps are used to systematically derive numerical integrators that preserve the symplectic structure, as…
For a local system and a function on a smooth complex algebraic variety, we give a proof of a conjecture of M. Kontsevich on a formula for the vanishing cycles using the twisted de Rham complex of the formal microlocalization of the…
Affine flows on vector bundles with chain transitive base flow are lifted to linear flows and the decomposition into exponentially separated subbundles provided by Selgrade's theorem is determined. The results are illustrated by an…
Many real-world datasets can be naturally represented as graphs, spanning a wide range of domains. However, the increasing complexity and size of graph datasets present significant challenges for analysis and computation. In response, graph…
We classify the surfaces translating under the flows by sub-affine-critical powers of the Gauss curvature. This, in particular, lists all translating solitons possibly model Type II singularities for convex closed solutions in all positive…
We present an exact mathematical framework able to describe site-percolation transitions in real multiplex networks. Specifically, we consider the average percolation diagram valid over an infinite number of random configurations where…
The characteristic feature of inverse problems is their instability with respect to data perturbations. In order to stabilize the inversion process, regularization methods have to be developed and applied. In this work we introduce and…
This paper develops the reduction theory of implicit Hamiltonian systems admitting a symmetry group at a singular value of the momentum map. The results naturally extend those known for (explicit) Hamiltonian systems described by Poisson…
In this work we consider a generalization of graph flows. A graph flow is, in its simplest formulation, a labeling of the directed edges with real numbers subject to various constraints. A common constraint is conservation in a vertex,…
The continuous and rapid growth of highly interconnected datasets, which are both voluminous and complex, calls for the development of adequate processing and analytical techniques. One method for condensing and simplifying such datasets is…
We offer a new structural basis for the theory of 3-connected graphs, providing a unique decomposition of every such graph into parts that are either quasi 4-connected, wheels, or thickened $K_{3,m}$'s. Our construction is explicit,…
Central issues of the Dirac constraint formalism are discussed in relation to the algorithmic methods of commutative algebra based on the Groebner basis techniques. For a wide class of finite dimensional polynomial degenerate Lagrangian…
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which adjacent vertices have different degrees. The connected…
We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…
Comparing provers on a formalization of the same problem is always a valuable exercise. In this paper, we present the formal proof of correctness of a non-trivial algorithm from graph theory that was carried out in three proof assistants:…
Geometric representations of cycles in quandle homology theory are given in terms of colored knot diagrams. Abstract knot diagrams are generalized to diagrams with exceptional points which, when colored, correspond to degenerate cycles.…
We generalize Venn diagrams in spaces of arbitrary dimension $\geq 2$ and study simple Venn diagrams with the reducing property. Three equivalent conditions for a simple Venn diagram to reduce it completely and a classification of those…
We characterize universally generalizing morphisms which satisfy descent of algebraic cycles integrally as those universally generalizing morphisms which are surjective with generically reduced fibres. In doing so, we introduce a naive…
We prove a theorem that generalizes Schmidt's Subspace Theorem in the context of metric diophantine approximation. To do so we reformulate the Subspace theorem in the framework of homogeneous dynamics by introducing and studying a slope…