Related papers: An optimal representation for the trace zero subgr…
Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…
Compressed sensing is an image reconstruction technique to achieve high-quality results from limited amount of data. In order to achieve this, it utilizes prior knowledge about the samples that shall be reconstructed. Focusing on image…
We show the following algebraicity result for a complex projective variety $X$ with big representation of $\pi_1$ into a semi-simple algebraic group: There exists a proper subvariety $Z \subset X$ such that for any algebraic curve $C$, any…
The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…
In this paper, we study the reducibility of degenerate principal series of the simple, simply-connected exceptional group of type $E_8$. Furthermore, we calculate the maximal semi-simple subrepresentation and quotient of these…
We present a novel global compression framework for deep neural networks that automatically analyzes each layer to identify the optimal per-layer compression ratio, while simultaneously achieving the desired overall compression. Our…
Suppose that there is a ground set which consists of a large number of vectors in a Hilbert space. Consider the problem of selecting a subset of the ground set such that the projection of a vector of interest onto the subspace spanned by…
In this paper we report a new promising idea on the design and manufacturing of ply composite structures, tailored to exhibit maximum stiffness under given weight constraints and loading conditions. It is based on the idea behind an…
Let $F$ be a local field over $\mathbf{Q}_p$ or $\mathbf{F}_p((t))$, and let $D$ be a central simple division algebra over $F$ of degree $d$. In the $p$-adic case, we assume $p>de+1$ where $e$ is the ramification degree over $\mathbf{Q}_p$;…
Subgraph isomorphism counting is known as #P-complete and requires exponential time to find the accurate solution. Utilizing representation learning has been shown as a promising direction to represent substructures and approximate the…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Let G be a semi-simple non-compact Lie group with unitary lowest/highest weight representations. We consider explicitly the relation between three types of representations of G: positive energy (unitary lowest weight)representations,…
In this paper, we construct a new family of generalization of the positive representations of split-real quantum groups based on the degeneration of the Casimir operators acting as zero on some Hilbert spaces. It is motivated by a new…
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The structure of CSPs is best described by hypergraphs. Therefore,…
We show that the cuspidal component of the stable trace formula of a special odd orthogonal group over a number field, satisfies a weak form of beyond endoscopic decomposition. We also study the $r$-stable trace formula, when $r$ is the…
Let k be a field of characteristic zero. We consider graded subalgebras A of k[x_1,...,x_m]/(x_1^2,...,x_m^2) generated by d linearly independant linear forms. Representations of matroids over k provide a natural description of the…
Low-precision number formats are widely used in modern machine learning systems due to their efficiency. Accurate direction representation is key to the accuracy of vector operations. This work precisely explores the extent to which the…
We provide a procedure for generating the irreducible representations of crystallography groups in any dimension. We also furnish a strategy to investigate the topology of the unitary dual of a crystallography group using sequences of…
Various tensor decomposition methods have been proposed for data compression. In real world applications of the tensor decomposition, selecting the tensor shape for the given data poses a challenge and the shape of the tensor may affect the…
We extend the algorithm of Darmon-Green and Darmon-Pollack for computing p-adic Darmon points on elliptic curves to the case of composite conductor. We also extend the algorithm of Darmon-Logan for computing ATR Darmon points to treat…