Related papers: The Gamma question for many-one degrees

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

The Cayley sum graph $\Gamma_A$ of a set $A \subseteq \mathbb{Z}_n$ is defined to have vertex set $\mathbb{Z}_n$ and an edge between two distinct vertices $x, y \in \mathbb{Z}_n$ if $x + y \in A$. Green and Morris proved that if the set $A$…

The Gamma distribution is well-known and widely used in many signal processing and communications applications. In this letter, a simple and extremely efficient accept/reject algorithm is introduced for the generation of independent random…

In this paper, we provide a negative solution to Problem 3 formulated by P.~Odifreddi in his survey articles \textit{``Strong Reducibilities''} (1981) and \textit{``Reducibilities''} (1999). The problem asks whether every computably…

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

This paper investigates the Hausdorff measure of certain sets of generics in computability theory. Let $\Gamma$ be the Turing ideal in which we take the dense open sets. The set of $\Gamma$-Cohen generics has measure positive if and only if…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

For the additive real BSS machines using only constants 0 and 1 and order tests we consider the corresponding Turing reducibility and characterize some semi-decidable decision problems over the reals. In order to refine, step-by-step, a…

We characterize exactness of a countable group $\Gamma$ in terms of invariant random equivalence relations (IREs) on $\Gamma$. Specifically, we show that $\Gamma$ is exact if and only if every weak limit of finite IREs is an amenable IRE.…

We begin the study of a tilting theory in certain truncated categories of modules $\mathcal G(\Gamma)$ for the current Lie algebra associated to a finite-dimensional complex simple Lie algebra, where $\Gamma = P^+ \times J$, $J$ is an…

We use variational convergence to derive a hierarchy of one-dimensional rod theories, starting out from three-dimensional models in nonlinear elasticity subject to local volume-preservation. The densities of the resulting $\Gamma$-limits…

Starting from the symmetrical reflection functional equation of the zeta function, we have found that the sigma values satisfying zeta(s) = 0 must also satisfy both |zeta(s)| = |zeta(1 - s)| and |gamma(s/2)zeta(s)| = |gamma((1 - s)/2)zeta(1…

Reed conjectured that for every $\varepsilon>0$ and every integer $\Delta$, there exists $g$ such that the fractional total chromatic number of every graph with maximum degree $\Delta$ and girth at least $g$ is at most…

Let $\mathcal{A}$ be a set of positive numbers. A graph $G$ is called an $\mathcal{A}$-embeddable graph in $\mathbb{R}^d$ if the vertices of $G$ can be positioned in $\mathbb{R}^d$ so that the distance between endpoints of any edge is an…

In this article we derive, using the Lagrange inversion theorem and applying twice the Fa\`a di Bruno formula, an expression of the minimum of the Gamma function $\Gamma$ as an expansion in powers of the Euler-Mascheroni constant $\gamma$.…

Neither the Euler-Mascheroni constant, $\gamma=0.577215...$, nor the Euler-Gompertz constant, $\delta=0.596347...$, is currently known to be irrational. However, it has been proved that at least one of them is transcendental. The two…

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

A countable group \Gamma is called shift-minimal if every non-trivial measure preserving action of \Gamma weakly contained in the Bernoulli shift of \Gamma on ([0,1]^\Gamma ,\lambda ^\Gamma) is free. We show that any group \Gamma whose…

We investigate the list packing number of a graph, the least $k$ such that there are always $k$ disjoint proper list-colourings whenever we have lists all of size $k$ associated to the vertices. We are curious how the behaviour of the list…

This paper extends the Pythagorean Theorem to positive and negative real exponents to take the form a^n + b^n = c^n and makes use of the definition gamma = b/a >= 1. For the case of n in the set of positive real numbers, n greater than or…