Related papers: Bar Recursion and Products of Selection Functions

Motivated by some results in classical differential geometry, we give a constructive procedure for building up a connection over a (twisted) tensor product of two algebras, starting from connections defined on the factors. The curvature for…

We introduce an algebraic model, based on the determinantal expansion of the product of two matrices, to test combinatorial reductions of set functions. Each term of the determinantal expansion is deformed through a monomial factor in d…

Recommender systems play a fundamental role in web applications in filtering massive information and matching user interests. While many efforts have been devoted to developing more effective models in various scenarios, the exploration on…

Different automated theorem provers reason in various deductive systems and, thus, produce proof objects which are in general not compatible. To understand and analyze these objects, one needs to study the corresponding proof theory, and…

We present an efficient adaptive refinement procedure that preserves analysis-suitability of the T-mesh, this is, the linear independence of the T-spline blending functions. We prove analysis-suitability of the overlays and boundedness of…

In this paper we construct a tilting sheaf for Severi-Brauer Varieties and Involution Varieties. This sheaf relates the derived category of each variety to the derived category of modules over a ring whose semisimple component consists of…

In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…

This paper takes an axiomatic and calculational view of diversity (or "N-version programming"), where multiple implementations of the same specification are executed in parallel to increase dependability. The central notion is…

We construct an example of an iterated function system on the line, consisting of linear fractional transformations, such that two of the maps share a fixed points, but the dimension of the attractor equals the conformal dimension, so that…

The closed feedback loop in recommender systems is a common setting that can lead to different types of biases. Several studies have dealt with these biases by designing methods to mitigate their effect on the recommendations. However, most…

A typical way of analyzing the time complexity of functional programs is to extract a recurrence expressing the running time of the program in terms of the size of its input, and then to solve the recurrence to obtain a big-O bound. For…

We define and study fibrations of topological groupoids. We interpret a groupoid fibration L->H with fibre G as an action of H on G by groupoid equivalences. Our main result shows that a crossed product for an action of L is isomorphic to…

We present a general framework to learn functions in tensor product reproducing kernel Hilbert spaces (TP-RKHSs). The methodology is based on a novel representer theorem suitable for existing as well as new spectral penalties for tensors.…

Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations in categories over a base category X are considered. In particular, we illustrate the formulas (|P)x = ten(x/X,P) ; (P|)x = hom(X/x,P) which…

Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…

We discuss data representation which can be learned automatically from data, are invariant to transformations, and at the same time selective, in the sense that two points have the same representation only if they are one the transformation…

In this paper we study irreducible tensor products of representations of alternating groups in characteristics 2 and 3. In characteristic 3 we completely classify irreducible tensor products, while in characteristic 2 we completely classify…

We combine Recurrent Neural Networks with Tensor Product Representations to learn combinatorial representations of sequential data. This improves symbolic interpretation and systematic generalisation. Our architecture is trained end-to-end…

This article introduces an algebra of functions in one variable $c$ defined by iterated integrals of two specific differential forms depending on $c$, where the product is the shuffle product. This algebra can be seen as a common…

In economic theory, an agent chooses from available alternatives -- modeled as a set. In decisions in the field or in the lab, however, agents do not have access to the set of alternatives at once. Instead, alternatives are represented by…