Related papers: Any FIP real computes a 1-generic
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
An artificial neural network can be used to generate a series of numbers. A boolean perceptron generates bit sequences with a periodic structure. The corresponding spectrum of cycle lengths is investigated analytically and numerically; it…
This article introduces a method, which starting from simple and quite general mathematical data, allows to construct linear algebras of operators which are, each of them, endowed with a bialgebra structure (coproduct and counity). Moreover…
For a variety with a finitely generated total coordinate ring, we describe basic geometric properties in terms of certain combinatorial structures living in its divisor class group. For example, we describe the singularities, we calculate…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
Given a multivariate complex polynomial ${p\in\mathbb{C}[z_1,\ldots,z_n]}$, the imaginary projection $\mathcal{I}(p)$ of $p$ is defined as the projection of the variety $\mathcal{V}(p)$ onto its imaginary part. We focus on studying the…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
The paper deals with a construction of a separating system of rational invariants for finite dimensional generic algebras. In the process of dealing an approach to a rough classification of finite dimensional algebras is offered by…
In this paper we produce models $V_1\subseteq V_2$ of set theory such that adding $\kappa$-many Cohen reals to $V_2$ adds $\lambda$-many Cohen reals to $V_1$, for some $\lambda>\kappa$. We deal mainly with the case when $V_1$ and $V_2$ have…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
Let $(S, \mathfrak n) $ be a regular local ring and let $I \subseteq \mathfrak n^2 $ be a perfect ideal of $S. $ Sharp upper bounds on the minimal number of generators of $I$ are known in terms of the Hilbert function of $R=S/I. $ Starting…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
Mixed integer linear programming (MILP) is a powerful representation often used to formulate decision-making problems under uncertainty. However, it lacks a natural mechanism to reason about objects, classes of objects, and relations.…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
We construct a functor from the category of admissible finitely presented o-representations of GL(2,F) to the category of finite length o-representations of Gal_{Q_p}, for any finite extension F of Q_p and the ring of integers o of a finite…
We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…
$F-$Lie algebras are natural generalisations of Lie algebras (F=1) and Lie superalgebras (F=2). When $F>2$ not many finite-dimensional examples are known. In this paper we construct finite-dimensional $F-$Lie algebras $F>2$ by an inductive…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…