English
Related papers

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

200 papers

We investigate computational problems involving large weights through the lens of kernelization, which is a framework of polynomial-time preprocessing aimed at compressing the instance size. Our main focus is the weighted Clique problem,…

Data Structures and Algorithms · Computer Science 2021-07-07 Bart M. P. Jansen , Shivesh K. Roy , Michał Włodarczyk

We show that there is a polynomial space algorithm that counts the number of perfect matchings in an $n$-vertex graph in $O^*(2^{n/2})\subset O(1.415^n)$ time. ($O^*(f(n))$ suppresses functions polylogarithmic in $f(n)$).The previously…

Data Structures and Algorithms · Computer Science 2011-10-17 Andreas Björklund

In this paper, we develop a construction of Poisson $n$-Lie algebras arising from $n$-Lie algebras of Jacobians and establish conditions under which this construction yields a Poisson $n$-Lie algebra. We also formulate a general conjecture…

Rings and Algebras · Mathematics 2026-05-13 Xinru Cao , Zafar Normatov , Bakhrom Omirov

We show that there does not exist a generalised polynomial which vanishes precisely on the set of powers of two. In fact, if $k \geq 2$ is and integer and $g \colon \mathbb{N} \to \mathbb{R}$ is a generalised polynomial such that $g(k^n) =…

Number Theory · Mathematics 2022-02-02 Jakub Konieczny

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…

Rings and Algebras · Mathematics 2009-12-08 Marla Slusky

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

Optimization and Control · Mathematics 2015-05-07 Alberto Del Pia , Robert Hildebrand , Robert Weismantel , Kevin Zemmer

Let $P$ be a partially ordered set. We prove that if $n$ is sufficiently large, then there exists a packing $\mathcal{P}$ of copies of $P$ in the Boolean lattice $(2^{[n]},\subset)$ that covers almost every element of $2^{[n]}$:…

Combinatorics · Mathematics 2019-09-11 Istvan Tomon

Of the $(2H+1)^n$ monic integer polynomials $f(x)=x^n+a_1 x^{n-1}+\cdots+a_n$ with $\max\{|a_1|,\ldots,|a_n|\}\leq H$, how many have associated Galois group that is not the full symmetric group $S_n$? There are clearly $\gg H^{n-1}$ such…

Number Theory · Mathematics 2024-10-22 Manjul Bhargava

What is the maximum number of holes that a polyomino with $n$ tiles can enclose? Call this number $f(n)$. We show that if $n_k = \left( 2^{2k+1} + 3 \cdot 2^{k+1}+4 \right) / 3$ and $h_k = \left( 2^{2k}-1 \right) /3$, then $f(n_k) = h_k$…

Combinatorics · Mathematics 2018-07-27 Matthew Kahle , Érika Roldán

We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…

Classical Analysis and ODEs · Mathematics 2020-07-02 Codruţ Grosu , Corina Grosu

How often is a quintic polynomial solvable by radicals? We establish that the number of such polynomials, monic and irreducible with integer coefficients in $[-H,H]$, is $O(H^{3.91})$. More generally, we show that if $n \ge 3$ and $n \notin…

Number Theory · Mathematics 2023-02-01 Sam Chow , Rainer Dietmann

For any cocommutative Hopf algebra $H$ and a left $H$-module $V$, we construct an operad $\mathcal{P}^{cl}_H(V)$, which in the special case when $H$ is the algebra of polynomials in one variable reduces to the classical operad…

Quantum Algebra · Mathematics 2023-08-01 Bojko Bakalov , Ju Wang

For every $n >0$, we show the existence of a CNF tautology over $O(n^2)$ variables of width $O(\log n)$ such that it has a Polynomial Calculus Resolution refutation over $\{0,1\}$ variables of size $O(n^3polylog(n))$ but any Polynomial…

Computational Complexity · Computer Science 2024-07-02 Sasank Mouli

We present several sparsification lower and upper bounds for classic problems in graph theory and logic. For the problems 4-Coloring, (Directed) Hamiltonian Cycle, and (Connected) Dominating Set, we prove that there is no polynomial-time…

Computational Complexity · Computer Science 2015-09-25 Bart M. P. Jansen , Astrid Pieterse

It is well known that the Poisson Lie algebra is isomorphic to the Hamiltonian Lie algebra. We show that the Poisson Lie algebra can be embedded properly in the special type Lie algebra. We also generalize the Hamiltonian Lie algebra using…

Representation Theory · Mathematics 2009-09-25 Ki-Bong Nam

Take the matrix Lie superalgebra $gl_{N|N}$ with the standard generators $E_{ij}$ where $i,j=-N,...,-1,1,...,N$. Define an involutive automorphism of $gl_{N|N}$ by sending $E_{ij}$ to $E_{-i,-j}$. Then the corresponding twisted subalgebra…

Quantum Algebra · Mathematics 2009-10-31 Maxim Nazarov

We describe two types of Poisson pencils generated by a linear bracket and a quadratic one arising from a classical R-matrix. A quantization scheme is discussed for each. The quantum algebras are represented as the enveloping algebras of…

q-alg · Mathematics 2016-09-08 D. Gurevich , V. Rubtsov

In this paper, we study the generalized derivation of a Lie sub-algebra of the Lie algebra of polynomial vector fields on $\mathbb{R}^n$ where $n\geq1$, containing all constant vector fields and the Euler vector field, under some conditions…

Differential Geometry · Mathematics 2023-06-22 Princy Randriambololondrantomalala , Sania Asif

Let $P_k:= \mathbb F_2[x_1,x_2,\ldots,x_k]$ be the polynomial algebra over the prime field of two elements, $\mathbb F_2$, in $k$ variables $x_1, x_2, \ldots, x_k$, each of degree 1. We are interested in the Peterson hit problem of finding…

Algebraic Topology · Mathematics 2016-07-06 Dang Vo Phuc , Nguyen Sum

Motivated by higher vanishing multiplicity generalizations of Alon's Combinatorial Nullstellensatz and its applications, we study the following problem: for fixed $k\geq 1$ and $n$ large with respect to $k$, what is the minimum possible…

Combinatorics · Mathematics 2022-03-29 Lisa Sauermann , Yuval Wigderson