English
Related papers

Related papers: Symmetric Determinantal Representation of Formulas…

200 papers

We study the existence of diagonal representatives in each equivalence class of representation matrices of boundary conditions in $SU(n)$ or $U(n)$ gauge theories compactified on the orbifolds $T^2/{\mathbb Z}_N$ ($N = 2, 3, 4, 6$). We…

High Energy Physics - Theory · Physics 2023-05-10 Yoshiharu Kawamura , Eiji Kodaira , Kentaro Kojima , Toshifumi Yamashita

The purpose of this paper is to discuss representations of high order $C^0$ finite element spaces on simplicial meshes in any dimension. When computing with high order piecewise polynomials the conditioning of the basis is likely to be…

Numerical Analysis · Mathematics 2020-01-16 Kaibo Hu , Ragnar Winther

Let $k$ be a perfect field of characteristic $p > 2$, and let $K$ be a finite totally ramified extension over $W(k)[\frac{1}{p}]$. Let $R_0$ be an unramified relative base ring over $W(k)\langle X_1^{\pm 1}, \ldots, X_d^{\pm 1}\rangle$, and…

Number Theory · Mathematics 2018-10-16 Yong Suk Moon

We compute all massive partition functions or characteristic polynomials and their complex eigenvalue correlation functions for non-Hermitean extensions of the symplectic and chiral symplectic ensemble of random matrices. Our results are…

Mathematical Physics · Physics 2008-11-26 G. Akemann , F. Basile

We study the nonsymmetric Macdonald polynomials specialized at infinity from various points of view. First, we define a family of modules of the Iwahori algebra whose characters are equal to the nonsymmetric Macdonald polynomials…

Representation Theory · Mathematics 2017-12-11 Evgeny Feigin , Syu Kato , Ievgen Makedonskyi

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

We prove a closed character formula for the symmetric powers $S^N V(\lambda)$ of a fixed irreducible representation $V(\lambda)$ of a complex semi-simple Lie algebra $\mathfrak{g}$ by means of partial fraction decomposition. The formula…

Representation Theory · Mathematics 2010-09-22 Stavros Kousidis

For the unitary ensembles of $N\times N$ Hermitian matrices associated with a weight function $w$ there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For…

solv-int · Physics 2015-06-26 Harold Widom

We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…

Algebraic Geometry · Mathematics 2022-09-07 Sandra Di Rocco , Parker B. Edwards , David Eklund , Oliver Gäfvert , Jonathan D. Hauenstein

We compute the twisted cohomology of the mapping class group with level structures, with coefficients in the $r$-tensor powers of the Prym representations for any positive integer $r$. When $r\ge 2$, we show that the cohomology exhibits…

Geometric Topology · Mathematics 2026-01-21 Xiyan Zhong

Let K be an algebraically closed field of characteristic p>0 and let Sp(2m) be the symplectic group of rank m over K. The main theorem of this article gives the character of the rational simple Sp(2m)-modules with fundamental highest weight…

Representation Theory · Mathematics 2007-05-23 Sebastien Foulle

We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…

Optimization and Control · Mathematics 2012-03-02 Feng Guo , Erich L. Kaltofen , Lihong Zhi

Schur Polynomials are families of symmetric polynomials that have been classically studied in Combinatorics and Algebra alike. They play a central role in the study of Symmetric functions, in Representation theory [Sta99], in Schubert…

Computational Complexity · Computer Science 2019-12-02 Prasad Chaugule , Mrinal Kumar , Nutan Limaye , Chandra Kanta Mohapatra , Adrian She , Srikanth Srinivasan

Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…

Commutative Algebra · Mathematics 2021-05-28 Matías R. Bender , Jean-Charles Faugère , Angelos Mantzaflaris , Elias Tsigaridas

We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…

Number Theory · Mathematics 2016-05-24 Yasuhiro Ishitsuka

We give combinatorial models for complex, smooth, non-spherical, generic, irreducible representations of the group G=PGL(2,F), where F is a non-archimedean locally compact field. They use the graphs X_k lying above the tree of G, introduced…

Representation Theory · Mathematics 2007-05-23 Paul Broussous

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

Algebraic Geometry · Mathematics 2021-05-31 Abeer Al Ahmadieh , Cynthia Vinzant

In quasi-exactly solvable problems partial analytic solution (energy spectrum and associated wavefunctions) are obtained if some potential parameters are assigned specific values. We introduce a new class in which exact solutions are…

Quantum Physics · Physics 2007-06-13 A. D. Alhaidari

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite…

Optimization and Control · Mathematics 2013-01-29 M. Laurent , A. Varvitsiotis

Approximating a function with a finite series, e.g., involving polynomials or trigonometric functions, is a critical tool in computing and data analysis. The construction of such approximations via now-standard approaches like least squares…

Optimization and Control · Mathematics 2021-08-30 Dihan Dai , Yekaterina Epshteyn , Akil Narayan
‹ Prev 1 8 9 10 Next ›