中文
相关论文

相关论文: Subrepresentations of Kronecker representations

200 篇论文

A cofactor representation of an ideal element, that is, a representation in terms of the generators, can be considered as a certificate for ideal membership. Such a representation is typically not unique, and some can be a lot more…

符号计算 · 计算机科学 2024-04-10 Clemens Hofstadler , Thibaut Verron

This paper is a survey on invariants of representations of quivers and their generalizations. We present the description of generating systems for invariants and relations between generators.

表示论 · 数学 2009-04-27 A. A. Lopatin , A. N. Zubkov

Assume that samples of a filtered version of a function in a shift-invariant space are avalaible. This work deals with the existence of a sampling formula involving these samples and having reconstruction functions with compact support.…

信息论 · 计算机科学 2008-06-13 A. G. Garcia , M. A. Hernandez-Medina , G. Perez-Villalon

These notes are an expanded version of a talk given by the second author. Our main interest is focused on the challenging problem of computing Kronecker coefficients. We decided, at the beginning, to take a very general approach to the…

表示论 · 数学 2015-06-09 Velleda Baldoni , Michele Vergne

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

表示论 · 数学 2009-03-10 Ryan Kinser

In this paper, we develop a new technique which we call representation theory of the real hyperrectangle, which describes how to compute the eigenvectors and eigenvalues of certain matrices arising from hyperrectangles. We show that these…

计算几何 · 计算机科学 2021-08-06 Josh Alman , Timothy Chu , Gary Miller , Shyam Narayanan , Mark Sellke , Zhao Song

We present a way of computing Kronecker coefficients that uses a new family of rational convex polytopes, called column-row polytopes. We give several different formulas for the computation. They are alternating sums of numbers of integer…

组合数学 · 数学 2026-01-05 Ernesto Vallejo , Pedro David Sánchez Salazar

Let $\mathbb{k}$ be an algebraically closed field. Connections between representations of the generalized Kronecker quivers $K_r$ and vector bundles on $\mathbb{P}^{r-1}$ have been known for quite some time. This article is concerned with a…

表示论 · 数学 2024-04-10 Daniel Bissinger , Rolf Farnsteiner

We consider matrix problems in Hilbert spaces (orthoscalar representations of quivers and posets). A criterion of tameness of the problem of classification of indecomposable orthoscalar representations of a quiver is given.

表示论 · 数学 2007-05-23 A. V. Roiter , S. A. Kruglyak , L. A. Nazarova

Convenient parameterizations of matrices in terms of vectors transform (certain classes of) matrix equations into covariant (hence rotation-invariant) vector equations. Certain recently introduced such parameterizations are tersely…

可精确求解与可积系统 · 物理学 2009-11-10 M. Bruschi , F. Calogero

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Multivariate versions of the Kronecker theorem in the continuous multivariate setting has recently been published. These theorems characterize the symbols that give rise to finite rank multidimensional Hankel and Toeplitz type operators…

泛函分析 · 数学 2015-08-17 Fredrik Andersson , Marcus Carlsson

A fundamental problem in the representation theory of the symmetric group, Sn, is to describe the coefficients in the decomposition of a tensor product of two simple representations. These coefficients are known in the literature as the…

表示论 · 数学 2018-07-31 C. Bowman , M. De Visscher , J. Enyang

We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of matrices. We provide a complete…

代数几何 · 数学 2026-02-18 Alessandra Bernardi , Fulvio Gesmundo

A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…

Low rank matrix approximation is an important tool in machine learning. Given a data matrix, low rank approximation helps to find factors, patterns and provides concise representations for the data. Research on low rank approximation…

计算复杂性 · 计算机科学 2017-04-21 Chen Dan , Kristoffer Arnsfelt Hansen , He Jiang , Liwei Wang , Yuchen Zhou

We introduce the notion of ''maximal rank type'' for representations of quivers, which requires certain collections of maps involved in the representation to be of maximal rank. We show that real root representations of quivers are of…

表示论 · 数学 2008-07-14 Marcel Wiedemann

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then…

组合数学 · 数学 2011-09-07 Peter J. Cameron , Maximilien Gadouleau , Søren Riis

Let $\mathcal{K}_n$ be the so-called wild Kronecker quiver, i.e., a quiver with one source and one sink and $n\geq 3$ arrows from the source to the sink. The following problems will be studied for an arbitrary regular component…

表示论 · 数学 2012-09-05 Bo Chen

Many complicated real-world tasks can be broken down into smaller, more manageable parts, and planning with prior knowledge extracted from these simplified pieces is crucial for humans to make accurate decisions. However, replicating this…

人工智能 · 计算机科学 2024-05-21 Jingqing Ruan , Kaishen Wang , Qingyang Zhang , Dengpeng Xing , Bo Xu