English
Related papers

Related papers: On the Groenewold-Van Hove problem for R^{2n}

200 papers

We establish that any finite extension of function fields of genus greater than 1 whose relative class group is trivial is Galois and cyclic. This depends on a result from a preceding paper which establishes a finite list of possible Weil…

Number Theory · Mathematics 2024-05-31 Kiran S. Kedlaya

Goedel Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious…

Computational Complexity · Computer Science 2018-12-18 Leonid A. Levin

We develop a Poisson geometric framework for studying the representation theory of all contragredient quantum super groups at roots of unity. This is done in a uniform fashion by treating the larger class of quantum doubles of bozonizations…

Quantum Algebra · Mathematics 2023-03-16 Nicolás Andruskiewitsch , Iván Angiono , Milen Yakimov

We present Hausdorff versions for Lie Integration Theorems 1 and 2 and apply them to study Hausdorff symplectic groupoids arising from Poisson manifolds. To prepare for these results we include a discussion on Lie equivalences and propose…

Differential Geometry · Mathematics 2021-03-17 Matias del Hoyo , Daniel López Garcia

This is the second of two papers, in which we prove a version of Conn's linearization theorem for the Lie algebra $\mathfrak{sl}_2(\mathbb{C})\simeq \mathfrak{so}(3,1)$. Namely, we show that any Poisson structure whose linear approximation…

Symplectic Geometry · Mathematics 2022-12-16 Ioan Marcut , Florian Zeiser

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

Let $\mathrm{pm}(G)$ denote the number of perfect matchings of a graph $G$, and let $K_{r\times 2n/r}$ denote the complete $r$-partite graph where each part has size $2n/r$. Johnson, Kayll, and Palmer conjectured that for any perfect…

Combinatorics · Mathematics 2022-11-04 Sam Spiro , Erlang Surya

We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl($R^{n,n}$) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between…

Mathematical Physics · Physics 2021-03-08 Marco Budinich

In this paper, we proved that any 2-convex solution $u$ of $\sigma_2(D^2u)=1$ with a quadratic growth must be a quadratic polynomial in $\mathbb{R}^n\ (n\geq 3 )$ by using a Pogorelov estimate and the global gradient estimate. And we give a…

Analysis of PDEs · Mathematics 2019-06-26 Yan He , Haoyang Sheng , Ni Xiang

If f(x_1, x_2, ..., x_n) is a polynomial dependent on a large number of independent Bernoulli random variables, what can be said about the maximum concentration of f on any single value? For linear polynomials, this reduces to one version…

Probability · Mathematics 2015-07-03 Kevin P. Costello

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Computational Geometry · Computer Science 2012-03-28 Sergio Cabello , Bojan Mohar

Chevalley's theorem states that for any simple finite dimensional Lie algebra G (1) the restriction homomorphism of the algebra of polynomials on G onto the Cartan subalgebra H induces an isomorphism between the algebra of G-invariant…

Representation Theory · Mathematics 2007-05-23 Alexander Sergeev

For random graphs, the containment problem considers the probability that a binomial random graph $G(n,p)$ contains a given graph as a substructure. When asking for the graph as a topological minor, i.e., for a copy of a subdivision of the…

Combinatorics · Mathematics 2015-05-05 Anna Gundert , Uli Wagner

Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…

Number Theory · Mathematics 2019-08-13 Karl Dilcher , Larry Ericksen

The classical Frobenius problem is to compute the largest number g not representable as a non-negative integer linear combination of non-negative integers x_1, x_2, ..., x_k, where gcd(x_1, x_2, ..., x_k) = 1. In this paper we consider…

Discrete Mathematics · Computer Science 2007-08-24 Jui-Yi Kao , Jeffrey Shallit , Zhi Xu

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Discrete Mathematics · Computer Science 2018-04-26 David Avis , David Bremner , Hans Raj Tiwary , Osamu Watanabe

Let ${\mathcal S}(\mathfrak g)$ be the symmetric algebra of a reductive Lie algebra $\mathfrak g$ equipped with the standard Poisson structure. If ${\mathcal C}\subset\mathcal S(\mathfrak g)$ is a Poisson-commutative subalgebra, then ${\rm…

Representation Theory · Mathematics 2021-02-01 Dmitri Panyushev , Oksana Yakimova

Investigating a recent positive solution of a conjecture of Grunewald and O'Halloran for complex finite dimensional nilpotent Lie algebras, we are in the position to find results of existence and uniqueness for the construction of complex…

Mathematical Physics · Physics 2026-03-04 Fabio Bagarello , Yanga Bavuma , Francesco G. Russo

Let $ (\rho, V) $ be an irreducible representation of the symmetric group $ S_n$ (or the alternating group $ A_n$), and let $ g $ be a permutation on $n$ letters with each of its cycle lengths divides the length of its largest cycle. We…

Representation Theory · Mathematics 2024-12-31 Velmurugan S

We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…

Algebraic Geometry · Mathematics 2016-12-16 Pinaki Mondal