Related papers: Parametrizing the Grassmannian using pipe dreams

Graph isomorphism is a problem for which there is no known polynomial-time solution. Nevertheless, assessing (dis)similarity between two or more networks is a key task in many areas, such as image recognition, biology, chemistry, computer…

Embedding networks into a fixed dimensional feature space, while preserving its essential structural properties is a fundamental task in graph analytics. These feature vectors (graph descriptors) are used to measure the pairwise similarity…

We classify proper holomorphic mappings between generalized pseudoellipsoids of different dimensions. Those domains are parametrized by the exponents. The relations among them are also obtained. Main tool is the orthogonal decomposition of…

In the constraint programming framework, state-of-the-art static and dynamic decomposition techniques are hard to apply to problems with complete initial constraint graphs. For such problems, we propose a hybrid approach of these techniques…

We introduce a general implementation of the recently proposed homogenization theory [Tsukerman, J. Opt. Soc. Am. B 28, 577 (2011)] allowing one to retrieve all 36 linear constitutive parameters of any 3D metamaterial with parallelepipedal…

Convergence guarantees for optimization over bounded-rank matrices are delicate to obtain because the feasible set is a non-smooth and non-convex algebraic variety. Existing techniques include projected gradient descent, fixed-rank…

Let G be a quasi-split reductive group over a non-archimedean local field. We establish a local Langlands correspondence for all irreducible smooth complex G-representations in the principal series. The parametrization map is injective, and…

This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the…

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…

Understanding feature-outcome associations in high-dimensional data remains challenging when relationships vary across subpopulations, yet standard methods assuming global associations miss context-dependent patterns, reducing statistical…

A key step in reverse engineering neural networks is to decompose them into simpler parts that can be studied in relative isolation. Linear parameter decomposition -- a framework that has been proposed to resolve several issues with current…

We give a local parametric description of all holomorphic hypersurfaces in complex Euclidean and projective spaces with constant index of relative nullity, together with applications. This is a complex analogue to the parametrization for…

It turns out that a parametrization of degenerate density matrices requires a parametrization of $\mathfrak{F}=U(n)/({U(k_1)\times U(k_2)\times \cdots \times U(k_m)})\quad n=k_1 +\cdots + k_m $ where $U(k)$ denotes the set of all unitary…

Graph embedding algorithms are used to efficiently represent (encode) a graph in a low-dimensional continuous vector space that preserves the most important properties of the graph. One aspect that is often overlooked is whether the graph…

A decomposition of a graph is a set of subgraphs whose edges partition those of $G$. The 3-decomposition conjecture posed by Hoffmann-Ostenhof in 2011 states that every connected cubic graph can be decomposed into a spanning tree, a…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

This article is on the parametrization of the local Langlands correspondence over local fields for non-quasi-split groups according to the philosophy of Vogan. We show that a parametrization indexed by the basic part of the Kottwitz set…

This work pioneers the systematic study and classification (up to Lie algebra automorphisms) of finite-dimensional coboundary Lie bialgebras through Grassmann algebras. Several mathematical structures on Lie algebras, e.g. Killing forms or…

A frame approach to determining the most general solution admitting a desired symmetry group has been examined previously in Riemannian and teleparallel geometries with some success. In teleparallel geometries, one must determine the…

It is shown that graphs that generalize the ADE Dynkin diagrams and have appeared in various contexts of two-dimensional field theory may be regarded in a natural way as encoding the geometry of a root system. After recalling what are the…