Related papers: Sparse fusion systems
We construct a rigid, rank 1, prime transformation that is not quasi-simple and whose self-joinings form a Paulsen simplex. This seems to be the first example of a prime system whose self-joinings form a Paulsen simplex.
In crowded systems, particle currents can be mediated by propagating collective excitations which are generated as rare events, are localized and have a finite lifetime. The theoretical description of such excitations is hampered by the…
Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and…
We consider the possibility of semisimple tensor categories whose fusion rule includes exactly one noninvertible simple object. Conditions are given for the existence or nonexistence of coherent associative structures for such fusion rules,…
This work proposes a research problem of finding sparse solution of undetermined Linear system with some applications. Two approaches how to solve the compressive sensing problem: using l_1 approach , the l_q approach with 0 < q < 1.…
In this paper we give a classification of the rank two p-local finite groups for odd p. This study requires the analisis of the possible saturated fusion systems in terms of the outer automorphism group ant the proper F-radical subgroups.…
Let $X$ be a quasi-projective variety over a number field, admitting (after passage to $\mathbb{C}$) a geometric variation of Hodge structure whose period mapping has zero-dimensional fibers. Then the integral points of $X$ are sparse: the…
We show that a coded system is mixing if and only if it is totally transitive and if in addition it has a relatively prime generator, then it has strong property P. We continue by showing that a mixing half-synchronized system has such a…
We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…
Let $\mathcal{P}$ denote the set of all primes, and let $\underline\delta(P)$ denote the relative lower density of a subset $P$ in $\mathcal{P}$. Suppose that $P_1, P_2, P_3, P_4$ are four subsets of primes with…
We show that there is an hierarchy of intersection rigidity properties of sets in a closed symplectic manifold: some sets cannot be displaced by symplectomorphisms from more sets than the others. We also find new examples of rigidity of…
A system of hard spheres exhibits physics that is controlled only by their density. This comes about because the interaction energy is either infinite or zero, so all allowed configurations have exactly the same energy. The low density…
This thesis is divided into two parts. In the first part we study completely integrable systems, and their underlying structures, in detail. We study their deformation theory and the different equivalence relations surrounding it. We…
Non-holonomic mechanical systems can be described by a degenerate almost-Poisson structure (dropping the Jacobi identity) in the constrained space. If enough symmetries transversal to the constraints are present, the system reduces to a…
We study higher limits over the centric orbit category of a fusion system realized by an amalgamated product. In so doing we provide a novel technique for studying the Diaz-Park sharpness conjecture and prove it (in the case of the…
Sparse interpolation} refers to the exact recovery of a function as a short linear combination of basis functions from a limited number of evaluations. For multivariate functions, the case of the monomial basis is well studied, as is now…
Plasmas and other systems with long-range interactions are commonly found in non-equilibrium steady states that are outside traditional Boltzmann-Gibbs statistics, but can be described using generalized statistical mechanics frameworks such…
This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…
The problem of sparse linear regression is relevant in the context of linear system identification from large datasets. When data are collected from real-world experiments, measurements are always affected by perturbations or low-precision…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…