English
Related papers

Related papers: Permanent versus determinant: not via saturations

200 papers

The problem of construction of irreducible representations of quantum $A^q_n$ algebras is solved at the level of explicit integration of the linear (inhomogeneous) system in finite differences in the n-dimensional space. The general…

solv-int · Physics 2007-05-23 A. N. Leznov

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

Let $L_c$ be simple vertex operator superalgebra(SVOA) associated to the vacuum representation of N=2 superconformal algebra with the central charge $c$. Let $c_m = {3m}/{m+2}$. We classify all irreducible modules for the SVOA $L_{c_m}$.…

Quantum Algebra · Mathematics 2007-05-23 Drazen Adamovic

Suppose that G is a finite, unitary reflection group acting on a complex vector space V and X is the fixed point subspace of an element of G. Define N to be the setwise stabilizer of X in G, Z to be the pointwise stabilizer, and C=N/Z. Then…

Representation Theory · Mathematics 2016-11-22 Nils Amend , Angela Berardinelli , J. Matthew Douglass , Gerhard Roehrle

In this paper we study higher Deligne--Lusztig representations of reductive groups over finite quotients of discrete valuation rings. At even levels, we show that these geometrically constructed representations coincide with certain induced…

Representation Theory · Mathematics 2016-04-07 Zhe Chen , Alexander Stasinski

The Orbit Problem consists of determining, given a matrix $A\in \mathbb{R}^{d\times d}$ and vectors $x,y\in \mathbb{R}^d$, whether there exists $n\in \mathbb{N}$ such that $A^n=y$. This problem was shown to be decidable in a seminal work of…

Computational Complexity · Computer Science 2016-11-07 Shaull Almagor , Joël Ouaknine , James Worrell

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

Logic · Mathematics 2015-03-17 Murray Neuzerling

Consider a finite dimensional real vector space and a finite group acting unitarily on it. We study the general problem of constructing Euclidean stable embeddings of the quotient space of orbits. Our embedding is based on subsets of sorted…

Representation Theory · Mathematics 2025-08-18 Radu Balan , Efstratios Tsoukanis

We study two-parameter oscillator variations of the classical theorem on harmonic polynomials, associated with noncanonical oscillator representations of sl(n) and o(n). We find the condition when the homogeneous solution spaces of the…

Representation Theory · Mathematics 2010-12-15 Cuiling Luo , Xiaoping Xu

Let G denote either a special orthogonal group or a symplectic group defined over the complex numbers. We prove the following saturation result for G: given dominant weights \lambda^1, ..., \lambda^r such that the tensor product…

Representation Theory · Mathematics 2011-11-24 Steven V Sam

The Laplace expansion expresses the $n \times n$ determinant $\det_n$ as a sum of $n$ products. Do shorter expansions exist? In this paper we: - Fully determine the slice rank decompositions of $\det_n$ (where each product must contain a…

Combinatorics · Mathematics 2025-09-09 Amichai Lampert , Guy Moshkovitz

The injective polynomial modules for a general linear group $G$ of degree $n$ are labelled by the partitions with at most $n$ parts. Working over an algebraically closed field of characteristic $p$, we consider the question of which…

Representation Theory · Mathematics 2017-04-11 Stephen Donkin , Haralampos Geranios

For some monoids, we give a method of composing invertibility preserving maps associated to "partial involutions." Also, we define the notion of "determinants for finite dimensional algebras over a field." As examples, we give invertibility…

Rings and Algebras · Mathematics 2023-03-03 Naoya Yamaguchi , Yuka Yamaguchi

We show that an irreducible polynomial $p$ with no zeros on the closure of a matrix unit polyball, a.k.a. a cartesian product of Cartan domains of type I, and such that $p(0)=1$, admits a strictly contractive determinantal representation,…

Functional Analysis · Mathematics 2015-03-23 Anatolii Grinshpan , Dmitry S. Kaliuzhnyi-Verbovetskyi , Victor Vinnikov , Hugo J. Woerdeman

If V is a finitely generated variety such that the first-order theory of the finite members of V is decidable, we show that V is residually finite, and in fact has a finite bound on the sizes of subdirectly irreducible algebras. This result…

Logic · Mathematics 2013-11-13 Ralph McKenzie , Matthew Smedberg

We consider the following problem: given $d \times d$ rational matrices $A_1, \ldots, A_k$ and a polyhedral cone $\mathcal{C} \subset \mathbb{R}^d$, decide whether there exists a non-zero vector whose orbit under multiplication by $A_1,…

Logic in Computer Science · Computer Science 2023-04-20 Ruiwen Dong

The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…

Optimization and Control · Mathematics 2011-04-08 Tim Netzer , Andreas Thom

In [APS], the authors characterize the partitions of $n$ whose corresponding representations of $S_n$ have nontrivial determinant. The present paper extends this work to all irreducible finite Coxeter groups $W$. Namely, given a nontrivial…

Representation Theory · Mathematics 2017-10-10 Debarun Ghosh , Steven Spallone

From an irreducible representation of GL(n, C) there is a natural way to construct an irreducible representations of GL(n + 1, C) by adding a zero at the end of the highest weight of the irreducible representation of GL(n, C). The paper…

Representation Theory · Mathematics 2022-11-18 Dibyendu Biswas

We show that for every finite nonempty set L of integers greater than or equal to 2 there are a numerical monoid H and a squarefree element a $\in$ H whose set of lengths L(a) is equal to L.

Commutative Algebra · Mathematics 2018-01-18 Alfred Geroldinger , Wolfgang Schmid
‹ Prev 1 3 4 5 6 7 10 Next ›