English
Related papers

Related papers: Answering Two OPAC Problems Involving Banff Quiver…

200 papers

While the classic separable quotient problem remains open, we survey general results related to this problem and examine the existence of a particular infinitedimensional separable quotient in some Banach spaces of vector-valued functions,…

Functional Analysis · Mathematics 2017-09-28 J. C. Ferrando , J. Kakol , M. Lopez-Pellicer , W. Sliwa

We study properties of minimal mutation-infinite quivers. In particular we show that every minimal-mutation infinite quiver of at least rank 4 is Louise and has a maximal green sequence. It then follows that the cluster algebras generated…

Combinatorics · Mathematics 2016-10-27 John W. Lawson , Matthew R. Mills

In [arXiv:1405.6274, Question 5.2 & Question 5.3] Aschenbrenner, Friedl and Wilton ask: (1) Is the equation problem solvable for the fundamental group of any $3$-manifold? and (2) Is the first-order theory of the fundamental group of any…

Group Theory · Mathematics 2025-12-09 Robert D. Gray , Alex Levine

We study the Modular Isomorphism Problem applying a combination of existing and new techniques. We make use of the small group algebra to give a positive answer for two classes of groups of nilpotency class 3. We also introduce a new…

Rings and Algebras · Mathematics 2023-09-25 L. Margolis , M. Stanojkovski

We study the boundedness of a mutation class for quivers with real weights. The main result is a characterization of bounded mutation classes for real quivers of rank 3.

Combinatorics · Mathematics 2026-02-11 Roger Casals , Kenton Ke

The class of $\left(\binom{n+1}{2}_{n-1} \binom{n+1}{3}_3\right)$-configurations which contain at least $n-2$ $K_n$-graphs coincides with the class of so called systems of triangle perspectives i.e. of configurations which contain a bundle…

Combinatorics · Mathematics 2014-04-17 K. Petelczyc , M. Prażmowska , K. Prażmowski

Much of learning theory is concerned with the design and analysis of probably approximately correct (PAC) learners. The closely related transductive model of learning has recently seen more scrutiny, with its learners often used as…

Machine Learning · Statistics 2024-10-31 Shaddin Dughmi , Yusuf Kalayci , Grayson York

We develop the theory of Banach algebras whose multiplication (regarded as a bilinear map) is open. We demonstrate that such algebras must have topological stable rank 1, however the latter condition is strictly weaker and implies only that…

Functional Analysis · Mathematics 2017-10-10 Szymon Draga , Tomasz Kania

Given an infinite matrix $M=(m_{nk})$ we study a family of sequence spaces $\ell_M^p$ associated with it. When equipped with a suitable norm $\|\cdot\|_{M,p}$ we prove some basic properties of the Banach spaces of sequences…

Functional Analysis · Mathematics 2025-03-11 Arian Bërdëllima , Naim L. Braha

For several classical nonnegative integer functions, we investigate if they are members of the counting complexity class #P or not. We prove #P membership in surprising cases, and in other cases we prove non-membership, relying on standard…

Computational Complexity · Computer Science 2022-04-29 Christian Ikenmeyer , Igor Pak

In this paper, we have proved that for each cardinal number $\lambda$ such that $\lambda=\lambda^{\aleph_0}$ a metric space of weight $\lambda$ admits a bijective continuous mapping onto a Banach space of weight $\lambda$. Then, we get that…

General Topology · Mathematics 2022-02-10 Alexander V. Osipov , Evgenii G. Pytkeev

We describe a method to compute the Brauer-Manin obstruction for smooth cubic surfaces over $\bbQ$ such that $\Br(S)/\Br(\bbQ)$ is a 3-group. Our approach is to associate a Brauer class with every ordered triplet of Galois invariant pairs…

Algebraic Geometry · Mathematics 2011-11-09 Andreas-Stephan Elsenhans , Jörg Jahnel

The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…

Computational Complexity · Computer Science 2020-12-09 L. Gordeev , E. H. Haeusler

We determine the $3$-class groups of $\mathbb{Q}(\sqrt[3]{p})$ and $K=\mathbb{Q}(\sqrt[3]{p},\sqrt{-3})$ when $p\equiv 4,7\bmod 9$ is a prime and $3$ is a cubic modulo $p$. This confirms a conjecture made by Barrucand-Cohn, and proves the…

Number Theory · Mathematics 2021-12-30 Jianing Li , Shenxing Zhang

A 1972 duality conjecture due to Pietsch asserts that the entropy numbers of a compact operator acting between two Banach spaces and those of its adjoint are (in an appropriate sense) equivalent. This is equivalent to a dimension free…

Functional Analysis · Mathematics 2007-05-23 S. Artstein , V. Milman , S. J. Szarek , N. Tomczak-Jaegermann

The first part of Hilbert's sixteenth problem deals with the classification of the isotopy types realizable by real plane algebraic curves of a given degree $m$. For $m = 9$, the classification of the $M$-curves is still wide open. Let…

Algebraic Geometry · Mathematics 2010-09-15 Séverine Fiedler-Le Touzé

An unresolved conjecture by Graham Higman states that for all $n\geq 1$ the number of conjugacy classes of the group of $n \times n$ unitriangular matrices with entries in the finite field $\mathbb{F}_q$ is a polynomial in $q$. In this…

Representation Theory · Mathematics 2022-08-17 Lucien Hennecart , Nikolai Perry

The ``multiple of the inclusion plus compact problem'' which was posed by T.W. Gowers in 1996 and Th. Schlumprecht in 2003, asks whether for every infinite dimensional Banach space $X$ there exists a closed subspace $Y$ of $X$ and a bounded…

Functional Analysis · Mathematics 2007-05-23 George Androulakis , Frank Sanacory

Suppose that $n\neq p^k$ and $n\neq 2p^k$ for all $k$ and all primes $p$. We prove that for any Hausdorff compactum $X$ with a free action of the symmetric group $\mathfrak S_n$ there exists an $\mathfrak S_n$-equivariant map $X \to…

Geometric Topology · Mathematics 2021-05-10 Sergey Avvakumov , Sergey Kudrya

One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…

Computational Complexity · Computer Science 2007-05-23 Bernd Borchert , Lane A. Hemaspaandra , Joerg Rothe