English
Related papers

Related papers: There is No Composition in the Computable Reducibi…

200 papers

We give a simple proof that (a generalization of) the complex of injective words has vanishing homology in all except the top degree.

K-Theory and Homology · Mathematics 2016-08-17 Wee Liang Gan

We prove a sharp inequality for the modulus of the logarithmic derivative of a polynomial in the lemniscate components containing no critical points.

Complex Variables · Mathematics 2012-04-09 V. N. Dubinin

A major part of computability theory focuses on the analysis of a few structures of central importance. As a tool, the method of coding with first-order formulas has been applied with great success. For instance, in the c.e. Turing degrees,…

Logic · Mathematics 2013-08-30 Andre Nies

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

Computational Complexity · Computer Science 2007-06-26 Nerio Borges , Blai Bonet

We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…

Computational Complexity · Computer Science 2025-04-08 Igor C. Oliveira

The motivation for this paper has been to study the relation between the zero component of the maximal graded algebra of quotients and the maximal graded algebra of quotients of the zero component, both in the Lie case and when considering…

Rings and Algebras · Mathematics 2012-10-11 Hannes Bierwirth , Candido Martin Gonzalez , Juana Sanchez Ortega , Mercedes Siles Molina

We consider $\Lambda$ an artin algebra and $n \geq 2$. We study how to compute the left and right degrees of irreducible morphisms between complexes in a generalized standard Auslander-Reiten component of ${\mathbf{C_n}({\rm proj}\,…

Representation Theory · Mathematics 2024-09-16 Claudia Chaio , Isabel Pratti , Maria Jose Souto

We give a new proof of the Brawley-Carlitz theorem on irreducibility of the composed products of irreducible polynomials. Our proof shows that associativity of the binary operation for the composed product is not necessary. We then…

Number Theory · Mathematics 2017-10-20 Akihiro Munemasa , Hiroko Nakamura

In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…

Combinatorics · Mathematics 2025-11-27 Dragan Mašulović

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

Algebraic Geometry · Mathematics 2011-12-05 Gabriela Jeronimo , Daniel Perrucci , Elias Tsigaridas

We prove the "strong form" of the Clemens conjecture in degree 10. Namely, on a general quintic threefold F in P^4, there are only finitely many smooth rational curves of degree 10, and each curve is embedded in F with normal bundle…

Algebraic Geometry · Mathematics 2007-05-23 Ethan Cotterill

In the first part, after showing that the most natural approach to define an order on sets of conformal classes fails, we define a nontrivial order $\leq_2$ on the set of conformal classes of compact Cauchy slabs with fixed past boundary…

Differential Geometry · Mathematics 2025-10-22 Olaf Müller

We give a class of examples of reducible (d-semistable) threefolds of CY type with two irreducible components for which (it is reasonably easy to prove that) no family of admissible genus zero stable maps sweeps out a surface, yet such…

Algebraic Geometry · Mathematics 2018-02-02 Adrian Zahariuc

The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…

Computational Complexity · Computer Science 2023-05-04 Reiner Czerwinski

It is shown that the compositum $ \mathbb Q^{(2)}$ of all degree 2 extensions of $\mathbb Q$ has undecidable theory.

Logic · Mathematics 2020-11-03 Carlos Martinez-Ranero , Javier Utreras , Carlos R. Videla

In this paper we introduce and study the relative cyclic subgroup commutativity degrees of a finite group. We show that there is a finite group with $n$ such degrees for all $n \in \mathbb{N}^*\setminus \lbrace 2\rbrace$ and we indicate…

Group Theory · Mathematics 2018-03-21 Mihai-Silviu Lazorec

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

Computational Complexity · Computer Science 2023-07-07 Miguel Campercholi , Diego Castaño , Gonzalo Zigarán

We consider in this paper a class of composite optimization problems whose objective function is given by the summation of a general smooth and nonsmooth component, together with a relatively simple nonsmooth term. We present a new class of…

Optimization and Control · Mathematics 2015-10-27 Guanghui Lan

In the present note we provide a partial classification of nearly free conic-line arrangements in the complex plane having nodes, tacnodes, and ordinary triple points. In this setting, our theoretical bound tells us that the degree of such…

Algebraic Geometry · Mathematics 2022-07-05 Aleksandra Gałecka

We study the growth of degrees in many autonomous and non-autonomous lattice equations defined by quad rules with corner boundary values, some of which are known to be integrable by other characterisations. Subject to an enabling…

Exactly Solvable and Integrable Systems · Physics 2017-03-06 John A. G. Roberts , Dinh T. Tran