Related papers: Non uniform (hyper/multi)coherence spaces
Linear logic has provided new perspectives on proof-theory, denotational semantics and the study of programming languages. One of its main successes are proof-nets, canonical representations of proofs that lie at the intersection between…
This paper obtains a completeness result for inequational reasoning with applicative terms without variables in a setting where the intended semantic models are the full structures, the full type hierarchies over preorders for the base…
Nonextensivity is foreseeable in network ensembles, as heterogeneous interactions generally exist in complex networked systems that need to be described by network ensembles. But this nonextensivity has not been literatured proved yet. In…
Different notions of equivalence, such as the prominent notions of strong and uniform equivalence, have been studied in Answer-Set Programming, mainly for the purpose of identifying programs that can serve as substitutes without altering…
Topological theory predicts the necessary conditions for robust dimensional reduction in a host of quantum and classical systems. Models have recently been proposed for stochastic systems which describe many biological and chemical…
We develop a denotational semantics of Linear Logic with least and greatest fixed points in coherence spaces (where both fixed points are interpreted in the same way) and in coherence spaces with totality (where they have different…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
Coherence is here demonstrated for sesquicartesian categories, which are categories with nonempty finite products and arbitrary finite sums, including the empty sum, where moreover the first and the second projection from the product of the…
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width,…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
Power system coherency refers to the phenomenon that machines in a power network exhibit similar frequency responses after disturbances, and is foundational for model reduction and control design. Despite abundant empirical observations,…
Motivated by the problem of finding resistances among vertices in a hypercube, we derive exact expressions, generating functions, and asymptotic expansions for these resistances, then study the combinatorial interpretations of the…
A major signature of quantum mechanics beyond classical physics is coherence, the existence of superposition states. The recently developed resource theory of quantum coherence allows the formalisation of incoherent operations -- those…
Coherent structures emerge from the dynamics of many kinds of dissipative, externally driven, nonlinear systems, and continue to provoke new questions that challenge our physical and mathematical understanding. In one specific sub-class of…
This is a survey of some of the consequences of the recently introduced congruences on the theory of connectednesses (radical classes) and disconnectednesses (semisimple classes) of graphs and topological spaces. In particular, it is shown…
Spectral analysis of networks states that many structural properties of graphs, such as centrality of their nodes, are given in terms of their adjacency matrices. The natural extension of such spectral analysis to higher order networks is…
The $r$-uniform linear $k$-cycle $C^r_k$ is the $r$-uniform hypergraph on $k(r-1)$ vertices whose edges are sets of $r$ consecutive vertices in a cyclic ordering of the vertex set chosen in such a way that every pair of consecutive edges…
A famous conjecture of Erd\H{o}s asserts that for $k\ge 3$, the maximum number of edges in an $n$-vertex $k$-uniform hypergraph without $s+1$ pairwise disjoint edges is $\max\{\binom{n}{k}-\binom{n-s}{k},\binom{sk+k-1}{k}\}$. This problem…
Logic rules and inference are fundamental in computer science and have been studied extensively. However, prior semantics of logic languages can have subtle implications and can disagree significantly, on even very simple programs,…
Classic grammars and regular expressions can be used for a variety of purposes, including parsing, intent detection, and matching. However, the comparisons are performed at a structural level, with constituent elements (words or characters)…