Related papers: Topological Connectedness and Behavioral Assumptio…
We take the first steps towards a better understanding of continuous orbit equivalence, i.e., topological orbit equivalence with continuous cocycles. First, we characterise continuous orbit equivalence in terms of isomorphisms of C*-crossed…
Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…
Topology captures the essence of what remains unchanged under a transformation. In this study, a topological invariant called super conformality was found to preserve a critical angle between the constitutive plane and its second order…
In this essay, I attempt to provide supporting evidence as well as some balance for the thesis on `Transforming socio-economics with a new epistemology' presented by Hollingworth and Mueller (2008). First, I review a personal highlight of…
There have been many generalizations of Shoenfield's Theorem on the absoluteness of $\Sigma^1_2$ sentences between uncountable transitive models of $\mathrm{ZFC}$. One of the strongest versions currently known deals with $\Sigma^2_1$…
This article introduces strongly proximal continuous (s.p.c.) functions, strong proximal equivalence (s.p.e.) and strong connectedness. A main result is that if topological spaces $X,Y$ are endowed with compatible strong proximities and…
This paper provides a general characterization of preferences that admit a Richter-Peleg representation without imposing completeness or transitivity. We establish that a binary relation on a nonempty set admits a Richter-Peleg…
We give a bijective correspondence between the number of nilpotent matrices over a Boolean semiring and the number of directed acyclic graphs on ordered vertices. We then enumerate pairs of maps between two finite sets whose composites are…
Monadic decomposibility --- the ability to determine whether a formula in a given logical theory can be decomposed into a boolean combination of monadic formulas --- is a powerful tool for devising a decision procedure for a given logical…
We model a social network by a random graph whose nodes represent agents and links between two of them stand for a reciprocal interaction; each agent is also associated to a binary variable which represents a dichotomic opinion or…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…
This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "optimal transport theory" as a starting point, and a way as…
Networks offer a powerful approach to modeling complex systems by representing the underlying set of pairwise interactions. Link prediction is the task that predicts links of a network that are not directly visible, with profound…
We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…
We consider methods for aggregating preferences that are based on the resolution of discrete optimization problems. The preferences are represented by arbitrary binary relations (possibly weighted) or incomplete paired comparison matrices.…
Completeness and transitivity are standard rationality conditions in economics. However, under ambiguity, decision makers sometimes violate these requirements because of the difficulty of forming accurate predictions about ambiguous events.…
The tractability conjecture for finite domain Constraint Satisfaction Problems (CSPs) stated that such CSPs are solvable in polynomial time whenever there is no natural reduction, in some precise technical sense, from the 3-SAT problem;…
We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIME-complete. Furthermore, we show that the validity problem…
There has been recent interest in conformal twisted boundary conditions and their realisations in solvable lattice models. For the Ising and Potts quantum chains, these amount to boundary terms that are related to duality, which is a proper…