相关论文: On the linear equation method for the subduction p…
Motivated by questions originating from the study of a class of shallow student-teacher neural networks, methods are developed for the analysis of spurious minima in classes of gradient equivariant dynamics related to neural nets. In the…
Young diagrams are ubiquitous in combinatorics and representation theory. Here we explain these diagrams, focusing on how they are used to classify representations of the symmetric groups $S_n$ and various "classical groups": famous groups…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
Data-driven approaches have been proven effective in solving combinatorial optimization problems over graphs such as the traveling salesman problems and the vehicle routing problem. The rationale behind such methods is that the input…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
By the Sylvester equation $\bL\bM-\bM\bK=\br\bs^{\st}$ together with an evolution equation set of $\br$ and $\bs$, generalized Cauchy matrix approach is established to investigate exact solutions for Kadomtsev-Petviashvili system, including…
Using the theory of equitable decompositions it is possible to decompose a matrix $M$ appropriately associated with a given graph. The result is a collection of smaller matrices whose collective eigenvalues are the same as the eigenvalues…
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and…
Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…
In this paper we study the equations of the elimination ideal associated with $n+1$ generic multihomogeneous polynomials defined over a product of projective spaces of dimension $n$. We first prove a duality property and then make this…
In this paper we consider a generalized Kuramoto-Sivashinsky equation. The equivalence group of the class under consideration has been constructed. This group allows us to perform a comprehensive study and a clear and concise formulation of…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
Symmetry in differential equations reveals invariances and offers a powerful means to reduce model complexity. Lie group analysis characterizes these symmetries through infinitesimal generators, which provide a local, linear criterion for…
The Subgraph Isomorphism problem asks, given a host graph G on n vertices and a pattern graph P on k vertices, whether G contains a subgraph isomorphic to P. The restriction of this problem to planar graphs has often been considered. After…
Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equations. We apply this principle by finding some \emph{affine…
Here we consider two algebras, a free unital associative complex algebra (denoted by ${\mathcal{B}}$) equiped with a multiparametric \textbf{\emph{q}}-differential structure and a twisted group algebra (denoted by ${\mathcal{A}(S_{n})}$),…