English
Related papers

Related papers: Symmetric Determinantal Representation of Formulas…

200 papers

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…

Computational Complexity · Computer Science 2018-11-13 Iddo Tzameret , Stephen A. Cook

This work provides a quaternioinc reprsentation for real symplectic matrices in dimension four, analogous to the pair of unit quaternions representation for special orthogonal matrices. In the process of finding formulae for this…

Mathematical Physics · Physics 2008-01-30 Yassmin Ansari , Viswanath Ramakrishna

We classify globally irreducible representations of alternating groups and double covers of symmetric and alternating groups. In order to achieve this classification we also completely characterise irreducible representations of such groups…

Representation Theory · Mathematics 2024-10-29 Matthew Fayers , Lucia Morotti

We study the problem of deciding whether some PSPACE-complete problems have models of bounded size. Contrary to problems in NP, models of PSPACE-complete problems may be exponentially large. However, such models may take polynomial space in…

Artificial Intelligence · Computer Science 2007-05-23 Paolo Liberatore

In this paper, we study the estimation of partially linear models for spatial data distributed over complex domains. We use bivariate splines over triangulations to represent the nonparametric component on an irregular two-dimensional…

Statistics Theory · Mathematics 2021-06-03 Li Wang , Guannan Wang , Min-Jun Lai , Lei Gao

We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…

General Mathematics · Mathematics 2018-08-08 Garret Sobczyk

Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…

Category Theory · Mathematics 2019-09-18 Amar Hadzihasanovic

This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…

Algebraic Geometry · Mathematics 2025-09-17 Cosimo Flavi , Fulvio Gesmundo , Alessandro Oneto , Emanuele Ventura

We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{\gamma+1}\simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a…

Combinatorics · Mathematics 2017-04-13 Nima Anari , Leonid Gurvits , Shayan Oveis Gharan , Amin Saberi

We use group representation theory to give algebraic formulae to compute complete transversals of singularities of vector fields, either in the nonsymmetric or in the reversible equivariant contexts. This computation produces normal forms…

Dynamical Systems · Mathematics 2013-09-10 Miriam Manoel , Iris de Oliveira Zeli

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

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…

Symbolic Computation · Computer Science 2014-05-05 Danko Adrovic , Jan Verschelde

In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…

Representation Theory · Mathematics 2015-08-18 M. Rovinsky

We combine recent developments on weakly symmetric pseudo--riemannian nilmanifolds with with geometric methods for construction of unitary representations on square integrable Dolbeault cohomology spaces. This runs parallel to construction…

Representation Theory · Mathematics 2019-09-17 Joseph A. Wolf

We present an abstract framework for analyzing the weak error of fully discrete approximation schemes for linear evolution equations driven by additive Gaussian noise. First, an abstract representation formula is derived for sufficiently…

Numerical Analysis · Mathematics 2013-07-17 M. Kovács , S. Larsson , F. Lindgren

In this work, we establish a representation theorem for multivariable totally symmetric functions: a multisymmetric continuous function must be the composition of a continuous function and a set of generators of the multisymmetric…

Classical Analysis and ODEs · Mathematics 2024-12-25 Chongyao Chen , Ziang Chen , Jianfeng Lu

We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…

Group Theory · Mathematics 2024-10-30 Antoni Puch , Daniel Smertnig

Weak proregularity of an ideal in a commutative ring is a subtle generalization of the noetherian property of the ring. Weak proregularity is of special importance for the study of derived completion, and it occurs quite often in…

Commutative Algebra · Mathematics 2024-08-06 Amnon Yekutieli

This paper defines a linear representation for nonlinear maps $F:\mathbb{F}^n\rightarrow\mathbb{F}^n$ where $\mathbb{F}$ is a finite field, in terms of matrices over $\mathbb{F}$. This linear representation of the map $F$ associates a…

Symbolic Computation · Computer Science 2024-04-04 Ramachandran Anantharaman , Virendra Sule
‹ Prev 1 3 4 5 6 7 10 Next ›