相关论文: A topological proof of Terao's generalized Arrow's…

Many complex networks in real world can be formulated as hypergraphs where community detection has been widely used. However, the fundamental question of whether communities exist or not in an observed hypergraph still remains unresolved.…

We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important…

We prove an arithmetic removal result for all compact abelian groups, generalizing a finitary removal result of Kr\'al', Serra and the third author. To this end, we consider infinite measurable hypergraphs that are invariant under certain…

This note shows how Condition 1 in Okumura (2025) can be tested efficiently using a standard graph-theoretic algorithm. It also describes an efficient implementation of Okumura's mechanism.

The theory of flag algebras, introduced by Razborov in 2007, has opened the way to a systematic approach to the development of computer-assisted proofs in extremal combinatorics. It makes it possible to derive bounds for parameters in…

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…

We study a variety of natural constructions from topological combinatorics, including matching complexes as well as other graph complexes, from the perspective of the graph minor category of \parencite{MiProRa}. We prove that these…

We conjecture a multi-parameter generalization of the toric inequalities of \cite{Czech:2023xed}. We then extend their proof methods for the generalized toric inequalities in two ways. The first extension constructs the graph corresponding…

Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…

Three themes of general topology: quotient spaces; absolute retracts; and inverse limits - are reapproached here in the setting of metrizable uniform spaces, with an eye to applications in geometric and algebraic topology. The results…

A classification is a surjective mapping from a set of objects to a set of categories. A classification aggregation function aggregates every vector of classifications into a single one. We show that every citizen sovereign and independent…

We develop a theory of $\times$-homotopy, fundamental groupoids and covering spaces that apply to non-simple graphs, generalizing existing results for simple graphs. We prove that $\times$-homotopies from finite graphs can be decomposed…

This note outlines a constructive proof of a proposition in Mochizuki's paper "Arithmetic elliptic curves in general position," making a direct use of computable non-critical Belyi maps to effectively reduce the full $abc$-conjecture to a…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

We generalize a preceding simple proof of the Jamiolkowski criterion to check whether a given linear map between algebras of operators is completely positive or not. The generalization is performed to embrace all algebras of Hilbert-Schmidt…

Spaces in the genus of infinite quaternionic projective space which admit essential maps from infinite complex projective space are classified. In these cases the sets of homotopy classes of maps are described explicitly. These results…

Atiyah's formulation of what is nowadays called the convexity theorem of Atiyah-Guillemin-Sternberg has two parts: (a) the image of the moment map arising from a Hamiltonian action of a torus on a symplectic manifold is a convex polytope,…

A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…

Explaining why aggregated measures change is a critical challenge in data analytics that existing systems struggle to address. While current attribution methods exist, they lack a unified solution that is simultaneously general for…