Related papers: Sparse fusion systems

It is a long-standing open problem raised by Starostin to describe all finite groups with soluble centralizers of involutions. One can observe that if the centralizer fusion system of an involution is nilpotent, then the centralizer of that…

We show how to construct sparse polynomial systems that have non-trivial lower bounds on their numbers of real solutions. These are unmixed systems associated to certain polytopes. For the order polytope of a poset P this lower bound is the…

An $\mathcal{F}$-essential subgroup is called a pearl if it is either elementary abelian of order $p^2$ or non-abelian of order $p^3$. In this paper we start the investigation of fusion systems containing pearls: we determine a bound for…

We prove the conjecture that exotic and block-exotic fusion systems coincide holds for all fusion systems on exceptional $p$-groups of maximal nilpotency class, where $p \geq 5$. This is done by considering a family of exotic fusion systems…

The first well founded perturbation theory for classical solid systems is presented. Theoretical approaches to thermodynamic and structural properties of the hard-sphere solid provide us with the reference system. The traditional…

Let $p$ be an odd prime and $S$ a nonabelian finite $p$-group. In [9, 10], they proposed the following conjecture: if $\mathcal{F}$ be a transitive fusion system over a finite $p$-group $S$, then $S$ is either extraspecial of order $p^{3}$…

We prove that the D\'iaz-Park's sharpness conjecture holds for saturated fusion systems defined on a Sylow $p$-subgroup of the group ${\rm G}_2(p)$, for $p\geq 5$.

Given a saturated fusion system $\mathcal{F}$ over a finite $p$-group $S$, we provide criteria to determine when uniqueness of factorization into irreducible $\mathcal{F}$--invariant representations holds. We use them to prove uniqueness of…

Linking systems are crucial for studying the homotopy theory of fusion systems, but are also of interest from an algebraic point of view. We propose a definition of a linking system associated to a saturated fusion system which is more…

We consider the problem of sparse atomic optimization, where the notion of "sparsity" is generalized to meaning some linear combination of few atoms. The definition of atomic set is very broad; popular examples include the standard basis,…

We introduce new sufficient conditions for verifying stability and recurrence properties in singularly perturbed stochastic hybrid dynamical systems. Specifically, we focus on hybrid systems with deterministic continuous-time dynamics that…

We explore two questions about pseudo-polynomials, which are functions $f:\mathbb N \to \mathbb Z$ such that $k$ divides $f(n+k) - f(n)$ for all $n,k$. First, for certain arbitrarily sparse sets $R$, we construct pseudo-polynomials $f$ with…

Several learning applications require solving high-dimensional regression problems where the relevant features belong to a small number of (overlapping) groups. For very large datasets and under standard sparsity constraints, hard…

We consider complex characters of a p-group P, which are invariant under a fusion system F on P. Extending a theorem of B\'arcenas--Cantarero to non-saturated fusion systems, we show that the number of indecomposable F-invariant characters…

Non-perturbative constraints on many body physics--such as the famous Lieb-Schultz-Mattis theorem--are valuable tools for studying strongly correlated systems. To this end, we present a number of non-perturbative results that constrain the…

We complete the determination of saturated fusion systems on maximal class 3-groups of rank two.

We introduce a uniform method of proof for the following results. For {\em each} of the following conditions, there are $2^{\aleph_0}$ families of Steiner systems, satisfying that condition: i) Theorem~2.2.4: (extending \cite{Chicoetal})…

The problem of estimating the frequencies of an exponential sum has been studied extensively over the last years. It can be understood as a sparse estimation problem, as it strives to identify the sparse representation of a signal using…

Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding…

Transfer systems are combinatorial objects which classify $N_\infty$ operads up to homotopy. By results of A. Blumberg and M. Hill, every transfer system associated to a linear isometries operad is also saturated (closed under a particular…