Related papers: A Note on Switching Conditions for the Generalized…

We introduce a 'grading switching' for arbitrary nonassociative algebras of prime characteristic p, aimed at producing a new grading of an algebra from a given one. We take inspiration from a fundamental tool in the classification theory of…

In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…

We extend the edge version of the classical Menger's Theorem for undirected graphs to $n$-dimensional simplicial complexes with chains over the field $\mathbb{F}_2$. The classical Menger's Theorem states that two different vertices in an…

This paper extends the univariate Theory of Connections, introduced in (Mortari,2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface,…

The original idea of proof nets can be formulated by means of interaction nets syntax. Additional machinery as switching, jumps and graph connectivity is needed in order to ensure correspondence between a proof structure and a correct proof…

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the…

Recently, data abstraction has been studied in the context of separation logic, with noticeable practical successes: the developed logics have enabled clean proofs of tricky challenging programs, such as subject-observer patterns, and they…

In [Fortini et al., Stoch. Proc. Appl. 100 (2002), 147--165] it is demonstrated that a recurrent Markov exchangeable process in the sense of Diaconis and Freedman is essentially a partially exchangeable process in the sense of de Finetti.…

We present a novel technique to remove spurious ambiguity from transition systems for dependency parsing. Our technique chooses a canonical sequence of transition operations (computation) for a given dependency tree. Our technique can be…

Based on the relation between the notions of Lie triple systems and Jordan algebras, we introduce the $n$-ary Jordan algebras,an $n$-ary generalization of Jordan algebras obtained via the generalization of the following property $\left[…

Linearizability is the de facto consistency condition for concurrent objects, widely used in theory and practice. Loosely speaking, linearizability classifies concurrent executions as correct if operations on shared objects appear to take…

We carefully analyze the N=2 dual pair of string theories in four dimensions introduced by Ferrara, Harvey, Strominger and Vafa. The analysis shows that a second discrete degree of freedom must be switched on in addition to the known…

A universal schema for diagonalization was popularized by N. S. Yanofsky (2003) in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many…

The power spectrum is traditionally parameterized by a truncated Taylor series: $ln P(k) = ln P_* + (n_*-1) ln(k/k_*) + {1/2} n'_* ln^2(k/k_*)$. It is reasonable to truncate the Taylor series if $|n'_* ln(k/k_*)| << |n_*-1|$, but it is not…

Universal cycles are generalizations of de Bruijn cycles and Gray codes that were introduced originally by Chung, Diaconis, and Graham in 1992. They have been developed by many authors since, for various combinatorial objects such as…

Sambin et al. (2000) introduced Basic Logic as a uniform framework for various logics. At the same time, they also introduced the principle of reflection as a criterion for being a connective in Basic Logic. In this paper, we make explicit…

Let $(S_n)_n$ be a $R^d$-valued random walk ($d\geq2$). Using Babillot's method [2], we give general conditions on the characteristic function of $S_n$ under which $(S_n)_n$ satisfies the same renewal theorem as the classical one obtained…

We prove a conjecture of Diaconis and Freedman (Ann. Probab. 1980) characterising the extreme points of the set of partially-exchangeable processes on a countable set. More concretely, we prove that the partially exchangeable sigma-algebra…

With the overwhelming popularity of Knowledge Graphs (KGs), researchers have poured attention to link prediction to fill in missing facts for a long time. However, they mainly focus on link prediction on binary relational data, where facts…