English
Related papers

Related papers: A full complexity dichotomy for immanant families

200 papers

Let lambda be an infinite cardinal number and let C = {H_i| i in I} be a family of nontrivial groups. Assume that |I|<=lambda, |H_i|<= lambda, for i in I, and at least one member of C achieves the cardinality lambda. We show that there…

Group Theory · Mathematics 2008-02-07 Zoran Sunic

An integer partition \lambda of n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition \lambda corresponds to an integrally closed ideal we call…

Combinatorics · Mathematics 2007-05-23 Jan Snellman , Michael Paulsen

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

Algebraic Geometry · Mathematics 2014-11-12 Susan Margulies , Shmuel Onn , Dmitrii Pasechnik

In this document, some structured operator approximation theoretical methods for system identification of nearly eventually periodic systems, are presented. Let $\mathbb{C}^{n\times m}$ denote the algebra of $n\times m$ complex matrices.…

Numerical Analysis · Mathematics 2020-01-31 Fredy Vides

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

Combinatorics · Mathematics 2023-10-31 Jonas Iskander

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…

Combinatorics · Mathematics 2011-03-01 Steven Widmer

We investigate the descriptive set-theoretic complexity of the solvability of a Borel family of linear equations over a finite field. Answering a question of Thornton, we show that this problem is already hard, namely $\Sigma^1_2$-complete.…

Logic · Mathematics 2025-01-13 Jan Grebík , Zoltán Vidnyánszky

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial…

Number Theory · Mathematics 2026-03-26 Alina Ostafe , Igor E. Shparlinski

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

Discrete Mathematics · Computer Science 2018-01-08 Ranveer Singh , R. B. Bapat

We associate with a matrix over an arbitrary field an infinite family of matrices whose sizes vary from one to infinity; their entries are traces of powers of the original matrix. We explicitly evaluate the determinants of matrices in our…

Combinatorics · Mathematics 2008-10-23 Eugene Gutkin

We introduce a new notion of the determinant, called symmetrized determinant, for a square matrix with the entries in an associative algebra $\AA$. The monomial expansion of the symmetrized determinant is obtained from the standard…

Combinatorics · Mathematics 2007-05-23 Alexander Barvinok

Let $S_n$ denote a symmetric group, $\chi$ an irreducible character of $S_n$, and $g\in S_n$ an element which decomposes into $k$ disjoint cycles, where $1$-cycles are included. Then $|\chi(g)|\le k!$, and this upper bound is sharp for…

Representation Theory · Mathematics 2024-11-14 Michael Larsen

The authors and Fischer recently proved that any hereditary property of two-dimensional matrices (where the row and column order is not ignored) over a finite alphabet is testable with a constant number of queries, by establishing the…

Combinatorics · Mathematics 2017-06-14 Noga Alon , Omri Ben-Eliezer

For any finite dimensional C*-algebra A with any trace vector {\vec s} whose components are rational numbers, we give an endomorphism {\Phi} of the hyperfinite II_1 factor R such that: forall k in {\mathbb N} {\Phi}^k (R)' \cap R= \otimes^k…

Operator Algebras · Mathematics 2007-05-23 Hsiang-Ping Huang

In recent papers, R. Bhatia, T. Jain and P. Grover obtained formulas for directional derivatives, of all orders, of the determinant, the permanent, the $m$-th compound map and the $m$-th induced power map. In this paper we generalize these…

Commutative Algebra · Mathematics 2013-05-07 Sónia Carvalho , Pedro J. Freitas

The main purpose of this note is to establish an effective version of the Grunwald--Wang Theorem, which asserts that given a family of local characters $\chi^{v}$ of $K_{v}^{*}$ of exponent $m$ where $v \in S$ for a finite set $S$ of primes…

Number Theory · Mathematics 2023-07-19 Song Wang

In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…

Rings and Algebras · Mathematics 2017-02-02 Parinyawat Choosuwan , Somphong Jitman , Patanee Udomkavanich

We prove an identity about partitions, previously conjectured in the study of shifted Jack polynomials (math.CO/9903020). The proof given is using $\lambda$-ring techniques. It would be interesting to obtain a bijective proof.

Combinatorics · Mathematics 2007-05-23 Alain Lascoux , Michel Lassalle

We give a new formula for the values of an irreducible character of the symmetric group S_n indexed by a partition of rectangular shape. Some observations and a conjecture are given concerning a generalization to arbitrary shapes.

Combinatorics · Mathematics 2007-05-23 Richard P. Stanley