Related papers: Sparse fusion systems
We propose an elegant formulation of parafermionic algebra and parasupersymmetry of arbitrary order in quantum many-body systems without recourse to any specific matrix representation of parafermionic operators and any kind of deformed…
We investigate sumset decompositions of quite general sets with restricted prime factors. We manage to handle certain sets, such as the smooth numbers, even though they have little sieve amenability, and conclude that these sets cannot be…
We consider a class of dynamical systems, which we call weakly coarse expanding, which is a generalization to the postcritically infinite case of expanding Thurston maps as discussed by Bonk-Meyer and is closely related to coarse expanding…
A. Chermak has recently proved that to each saturated fusion system over a finite $p$-group, there is a unique associated centric linking system. B. Oliver extended Chermak's proof by showing that all the higher cohomological obstruction…
Nowadays sparse systems of equations occur frequently in science and engineering. In this contribution we deal with sparse systems common in cryptanalysis. Given a cipher system, one converts it into a system of sparse equations, and then…
Sparse representations have emerged as a powerful tool in signal and information processing, culminated by the success of new acquisition and processing techniques such as Compressed Sensing (CS). Fusion frames are very rich new signal…
In this work, we consider the controllability of a discrete-time linear dynamical system with sparse control inputs. Sparsity constraints on the input arises naturally in networked systems, where activating each input variable adds to the…
We develop a perturbation theory of quantum (and classical) master equations with slowly varying parameters, applicable to systems which are externally controlled on a time scale much longer than their characteristic relaxation time. We…
Fusion rules generalize groups by allowing multivalued multiplication. Groups are fusion rules of simple current index 1. We classify nilpotent (in the sense of Gelaki and Nikshych) fusion rules of simple current index 2, and characterize…
Generalizing a construction of P. Vanhaecke, we introduce a large class of degenerate (i.e., associated to a degenerate Poisson bracket) completely integrable systems on (a dense subset of) the space $\R^{2d+n+1}$, called the generalized…
We use deep sparsely connected neural networks to measure the complexity of a function class in $L^2(\mathbb R^d)$ by restricting connectivity and memory requirement for storing the neural networks. We also introduce representation system -…
Opacity is a notion that describes an eavesdropper's inability to estimate a system's 'secret' states by observing the system's outputs. In this paper, we propose algorithms to compute the minimum sparse perturbation to be added to a system…
Nonnegative matrix factorization (NMF) has become a very popular technique in machine learning because it automatically extracts meaningful features through a sparse and part-based representation. However, NMF has the drawback of being…
We introduce sparse polynomial zonotopes, a new set representation for formal verification of hybrid systems. Sparse polynomial zonotopes can represent non-convex sets and are generalizations of zonotopes, polytopes, and Taylor models.…
We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…
We study sparse domination for operators defined with respect to an atomic filtration on a space equipped with a general measure $\mu$. In the case of Haar shifts, $L^p$-boundedness is known to require a weak regularity condition, which we…
Let $G$ be a finite group and let $(P_i)_{i=1}^n$ be Sylow subgroups for distinct primes $p_1,\ldots,p_n$. We conjecture that there exists $x \in G$ such that $P_i \cap P_i^x$ is inclusion-minimal in $\{ P_i \cap P_i^g : g \in G\}$ for all…
We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are…
Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of generically rigid structures. We define a new family called {\bf graded sparse graphs}, arising from generically…
Summary. A simple derivation of finite Schmidt decomposition of pure states describing finite dimensional systems interacting with the infinite dimensional ones is presented. In particular, maximally entangled pure states in such systems…