相关论文: A topological proof of Terao's generalized Arrow's…
We equip a topological space $(X,\tau)$ with a function $\mathfrak{a}: X \to \tau$ satisfying the single axiom $x \in \mathfrak{a}(x)$. The resulting triple $(X, \tau, \mathfrak{a})$, which we call an aura topological space, provides a…
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
We introduce a class of combinatorial hypersurfaces in the complex projective space. They are submanifolds of codimension~2 in $\C P^n$ and are topologically "glued" out of algebraic hypersurfaces in $(\C^*)^n$. Our construction can be…
This paper studies a parametrized family of familiar generalized baker maps, viewed as simple models of time-reversible evolution. Mapping the unit square onto itself, the maps are partly contracting and partly expanding, but they preserve…
We extend the recent result of T.Tao to wave maps defined from the Minkowski space of dimension >4 to a target Riemannian manifold which possesses a ``bounded parallelizable'' structure. This is the case of Lie groups, homogeneous spaces as…
As a higher dimensional version of the theory of Morse functions, there have been various studies of smooth manifolds using generic smooth maps. As fundamental results, in these studies, they have found that inverse images of such maps…
We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the…
In this article we introduce generalized projective spaces (Definitions $[2.1, 2.5]$) and prove three main theorems in two different contexts. In the first context we prove, in main Theorem $A$, the surjectivity of the Chinese remainder…
We present a generalization of standard Turing machines based on allowing unusual tapes. We present a set of reasonable constraints on tape geometry and classify all tapes conforming to these constraints. Surprisingly, this generalization…
Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…
Border's theorem gives an intuitive linear characterization of the feasible interim allocation rules of a Bayesian single-item environment, and it has several applications in economic and algorithmic mechanism design. All known…
Iterated admissibility (IA) can be seen as exhibiting a minimal criterion of rationality in games. In order to make this intuition more precise, the epistemic characterization of this game-theoretic solution has been actively investigated…
Given a diagram of Pi-algebras (graded groups equipped with an action of the primary homotopy operations), we ask whether it can be realized as the homotopy groups of a diagram of spaces. The answer given here is in the form of an…
In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
Framed combinatorial topology is a novel theory describing combinatorial phenomena arising at the intersection of stratified topology, singularity theory, and higher algebra. The theory synthesizes elements of classical combinatorial…
Utility functions or their equivalents (value functions, objective functions, loss functions, reward functions, preference orderings) are a central tool in most current machine learning systems. These mechanisms for defining goals and…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
A recent paper (van Rooij et al. 2024) claims to have proved that achieving human-like intelligence using learning from data is intractable in a complexity-theoretic sense. We point out that the proof relies on an unjustified assumption…
The famous asynchronous computability theorem (ACT) relates the existence of an asynchronous wait-free shared memory protocol for solving a task with the existence of a simplicial map from a subdivision of the simplicial complex…