We give a direct construction of a specific central idempotent in the endomorphism algebra of a finite lattice T. This idempotent is associated with all possible sublattices of T which are totally ordered. A generalization is considered in a conjectural fa ...
We prove that, in the category of groups, the composition of a cellularization and a localization functor need not be idempotent. This provides a negative answer to a question of Emmanuel Dror Farjoun. ...
Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unknown are semi-infinite matrices belonging to a Banach algebra, are considered. These equations, where coefficients are quasi-Toeplitz matrices, are encounter ...
A bipartite graph G is semi-algebraic in R-d if its vertices are represented by point sets P,Q subset of R-d and its edges are defined as pairs of points (p,q) epsilon P x Q that satisfy a Boolean combination of a fixed number of polynomial equations and i ...
In this short note, we investigate some consequences of the vanishing of simple biset functors. As a corollary, if there is no non-trivial vanishing of simple biset functors (e.g., if the group G is commutative), then we show that kB(G,G) is a quasi-heredi ...
This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...
Let G be a finite group and let k be a field. Our purpose is to investigate the simple modules for the double Burnside ring kB(G,G). It turns out that they are evaluations at G of simple biset functors. For a fixed finite group H, we introduce a suitable b ...
Recall that a rng is a ring which is possibly non-unital. In this note, we address the problem whether every finitely generated idempotent rng (abbreviated as irng) is singly generated as an ideal. It is well-known that it is the case for a commutative irn ...
In this paper, we propose a new category of current-mode Łukasiewicz OR and AND logic neurons and ensuing logic networks along with their ultra-low power realization. The introduced circuits can operate in a wide range of the input signals varying in-betwe ...
A new property of B-p(G), permits to obtain an approximation theorem for p-convolution operators and a non-commutative version of the Lohoues monomorphism theorem concerning the norm closure of the set of all p-convolution operators with compact support. ( ...
This work deals with the study of projective Mackey functors. Mackey functors are algebraic structures with operations which behave like induction, restriction and conjugation in group representation theory. These objects have properties which generalize m ...
The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...
The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for reas ...
