English
Related papers

Related papers: A combinatorial formula for the coefficients of mu…

200 papers

The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…

Combinatorics · Mathematics 2017-06-07 Sören Berg , Katharina Jochemko , Laura Silverstein

We illustrate a rigorous approach to express the totally symmetric isotropic tensors of arbitrary rank in the $n$-dimensional Euclidean space as a linear combination of products of Kronecker deltas. By making full use of the symmetries, one…

Mathematical Physics · Physics 2017-01-18 June-Haak Ee , Dong-Won Jung , U-Rae Kim , Jungil Lee

Both a general and a diagonal u-invariant for forms of higher degree are defined, generalizing the u-invariant of quadratic forms. Both old and new results on these invariants are collected.

Number Theory · Mathematics 2007-05-23 S. Pumpluen

We define and compute explicitly the classical limit of the realizations of $W_n$ appearing as hamiltonian structures of generalized KdV hierarchies. The classical limit is obtained by taking the commutative limit of the ring of…

High Energy Physics - Theory · Physics 2009-10-22 Jose M. Figueroa-O'Farrill , Eduardo Ramos

This paper deals with global dispersive properties of Schr\"odinger equations with real-valued potentials exhibiting critical singularities, where our class of potentials is more general than inverse-square type potentials and includes…

Analysis of PDEs · Mathematics 2016-07-13 Jean-Marc Bouclet , Haruya Mizutani

We consider a generalization of representations of quivers that can be derived from the ordinary representations of quivers by considering a product of arbitrary classical groups instead of a product of the general linear groups and by…

Representation Theory · Mathematics 2009-04-27 A. A. Lopatin

We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem…

Algebraic Geometry · Mathematics 2010-10-05 Motohico Mulase , Naizhen Zhang

Consider the conjugation action of the general linear group $\operatorname{GL}_{2}(K)$ on the polynomial ring $K[X_{2 \times 2}]$. When $K$ is an infinite field, the ring of invariants is a polynomial ring generated by the trace and the…

Commutative Algebra · Mathematics 2025-04-04 Aryaman Maithani

We derive a matrix product formula for symmetric Macdonald polynomials. Our results are obtained by constructing polynomial solutions of deformed Knizhnik--Zamolodchikov equations, which arise by considering representations of the…

Mathematical Physics · Physics 2015-09-30 Luigi Cantini , Jan de Gier , Michael Wheeler

A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…

Complex Variables · Mathematics 2020-03-17 Sung-Yeon Kim , Dmitri Zaitsev

We solve direct and inverse problems for two-dimensional (quasi) canonical systems related to exponential polynomials of a specific but sufficiently general type. The approach to the inverse problem in this paper provides an interpretation…

Functional Analysis · Mathematics 2025-10-21 Masatoshi Suzuki

New theorems about the existence of solution for a system of infinite linear equations with a Vandermonde type matrix of coefficients are proved. Some examples and applications of these results are shown. In particular, a kind of these…

General Relativity and Quantum Cosmology · Physics 2015-06-17 J. L. Hernandez-Pastora

What polynomial in the coefficients of a system of algebraic equations should be called its discriminant? We prove a package of facts that provide a possible answer. Let us call a system typical, if the homeomorphic type of its set of…

Algebraic Geometry · Mathematics 2013-08-22 Alexander Esterov

This paper presents a powerfull method to integrate general monomials on the classical groups with respect to their invariant (Haar) measure. The method has first been applied to the orthogonal group in [J. Math. Phys. 43, 3342 (2002)], and…

Mathematical Physics · Physics 2008-02-27 T. Gorin , G. V. Lopez

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

The derivative polynomials introduced by Knuth and Buckholtz in their calculations of the tangent and secant numbers are extended to a multivariable $q$--environment. The $n$-th $q$-derivatives of the classical $q$-tangent and $q$-secant…

Combinatorics · Mathematics 2013-04-10 Dominique Foata , Guo-Niu Han

This article deals with nonrelativistic study of a D-dimensional superintegrable system, which generalizes the ordinary isotropic oscillator system. The coefficients for the expansion between the hyperspherical and Cartesian bases…

Quantum Physics · Physics 2014-11-18 Ye. M. Hakobyan , G. S. Pogosyan , A. N. Sissakian

We are interested in finding a solution to the tensor complementarity problem with a strong M-tensor, which we call the M-tensor complementarity problem. We propose a lower dimensional linear equation approach to solve that problem. At each…

Optimization and Control · Mathematics 2020-07-28 Dong-Hui Li , Cui-Dan Chen , Hong-Bo Guan

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

Differential Geometry · Mathematics 2026-05-19 Boris Kruglikov , Eivind Schneider

In April 2025 GMV announced a competition for finding the best method to solve a particular polynomial system over a finite field. In this paper we provide a method for solving the given equation system significantly faster than what is…

Computational Complexity · Computer Science 2026-03-06 Àngela Barbero , Ragnar Freij-Hollanti , Camilla Hollanti , Håvard Raddum , Øyvind Ytrehus , Morten Øygarden
‹ Prev 1 8 9 10 Next ›