English
Related papers

Related papers: Monotone Classes Beyond VNP

200 papers

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

Computational Complexity · Computer Science 2026-01-09 Gábor Kun , Jaroslav Nešetřil

We study metrically projective and metrically free matricially normed spaces. We describe these spaces in terms of a special space $\widehat M_n$, the space of $n\times n$ matrices, endowed with a special matrix-norm. We show that…

Functional Analysis · Mathematics 2017-06-05 A. Ya. Helemskii

We deal with the presence of magnetic monopoles in a non Abelian model that generalizes the standard 't~Hooft-Polyakov model in three spatial dimensions. We investigate the energy density of the static and spherically symmetric solutions to…

High Energy Physics - Theory · Physics 2018-08-08 D. Bazeia , M. A. Marques , Gonzalo J. Olmo

We say that a linear space is harmonious if it is resolvable and admits an automorphism group acting sharply transitively on the points and transitively on the parallel classes. Generalizing old results by the first author et al. we present…

Combinatorics · Mathematics 2023-03-22 Marco Buratti , Dieter Jungnickel

Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomials over rings of integers model counting problems.…

Computational Complexity · Computer Science 2026-05-12 Balagopal Komarath , Harshil Mittal , Jayalal Sarma

We show that the category of truncated spaces with finite homotopy invariants ($\pi$\=/finite spaces) has many of the features expected of an elementary \oo topos. It should be thought of as the natural higher analogue of the elementary…

Category Theory · Mathematics 2025-03-05 Mathieu Anel

Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…

Logic in Computer Science · Computer Science 2014-05-01 Amir M. Ben-Amram , Michael Vainer

In IWOCA 2019, Ruangwises and Itoh introduced stable noncrossing matchings, where participants of each side are aligned on each of two parallel lines, and no two matching edges are allowed to cross each other. They defined two stability…

Data Structures and Algorithms · Computer Science 2020-06-29 Koki Hamada , Shuichi Miyazaki , Kazuya Okamoto

Nisan showed in 1991 that the width of a smallest noncommutative single-(source,sink) algebraic branching program (ABP) to compute a noncommutative polynomial is given by the ranks of specific matrices. This means that the set of…

Computational Complexity · Computer Science 2020-03-11 Markus Bläser , Christian Ikenmeyer , Meena Mahajan , Anurag Pandey , Nitin Saurabh

Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…

Computational Complexity · Computer Science 2025-05-26 Neil Thapen

Let $d$ and $n$ be natural numbers greater or equal to $2$. Let $\langle \boldsymbol{a}, \nu_{d,n}(\boldsymbol{x})\rangle\in \mathbb{Z}[\boldsymbol{x}]$ be a homogeneous polynomial in $n$ variables of degree $d$ with integer coefficients…

Number Theory · Mathematics 2025-09-10 Heejong Lee , Seungsu Lee , Kiseok Yeon

We give Ramsey expansions of classes of generalised metric spaces where distances come from a linearly ordered commutative monoid. This complements results of Conant about the extension property for partial automorphisms and extends an…

Combinatorics · Mathematics 2021-07-06 Jan Hubička , Matěj Konečný , Jaroslav Nešetřil

A polynomial matrix inequality is a formula asserting that a polynomial matrix is positive semidefinite. Polynomial matrix optimization concerns minimizing the smallest eigenvalue of a symmetric polynomial matrix subject to a tuple of…

Optimization and Control · Mathematics 2025-06-06 Jared Miller , Jie Wang , Feng Guo

For positive integers $d,m,n\geq 1$ with $(m,n)\not= (1,1)$ and $\Bbb K=\Bbb R$ or $\Bbb C$, let $Q^{d,m}_{n}(\Bbb K)$ denote the space of $m$-tuples $(f_1(z),\cdots ,f_m(z))\in \Bbb K [z]^m$ of $\Bbb K$-coefficients monic polynomials of…

Algebraic Topology · Mathematics 2021-04-07 Andrzej Kozlowski , Kohhei Yamaguchi

Given an autohomeomorphism on an ordered topological space or its subspace, we show that it is sometimes possible to introduce a new topology-compatible order on that space so that the same map is monotonic with respect to the new ordering.…

General Topology · Mathematics 2023-06-27 Raushan Buzyakova

This paper is a sequel to [Caine A., Pickrell D., arXiv:0710.4484], where we studied the Hamiltonian systems which arise from the Evens-Lu construction of homogeneous Poisson structures on both compact and noncompact type symmetric spaces.…

Symplectic Geometry · Mathematics 2008-10-07 Doug Pickrell

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

Algebraic Geometry · Mathematics 2019-03-19 Nathália Moraes de Oliveira , Enric Nart

The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…

Algebraic Geometry · Mathematics 2011-11-28 E. Arrondo , A. Bernardi

We study the problem of whether $\mathcal{P}_w(^nE)$, the space of $n$-homogeneous polynomials which are weakly continuous on bounded sets, is an $M$-ideal in the space of continuous $n$-homogeneous polynomials $\mathcal{P}(^nE)$. We obtain…

Functional Analysis · Mathematics 2011-02-04 Veronica Dimant

We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…

Algebraic Topology · Mathematics 2019-05-07 Amit Kumar Paul
‹ Prev 1 8 9 10 Next ›