Related papers: Construction of self-dual normal bases and their c…
There exists many complicated $k$-noncrossing pseudoknot RNA structures in nature based on some special conditions. The special characteristic of RNA structures gives us great challenges in researching the enumeration, prediction and the…
Some time ago we extended our monogenity investigations and calculations of generators of power integral bases to the relative case. Up to now we considered (usually totally real) extensions of complex quartic fields. In the present paper…
We survey techniques for constructing spaces with non-trivial self covers. These processes include methods for building low and high dimension continua which non-trivially self. We also discuss several related group theoretic and…
We establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases,…
A finite semifield is a division algebra over a finite field where multiplication is not necessarily associative. We consider here the complexity of the multiplication in small semifields and finite field extensions. For this operation, the…
We introduce a new method of constructing complete sequences of key polynomials for simple extensions of tame fields. In our approach the key polynomials are taken to be the minimal polynomials over the base field of suitably constructed…
We construct a family of functions suitable for establishing lower bounds on the oracle complexity of first-order minimization of smooth strongly-convex functions. Based on this construction, we derive new lower bounds on the complexity of…
We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…
This paper investigates the normal bases of algebras with low growth.
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most $d+4$ vertices according to their extension complexity: Out of the…
We investigate the complexity of the reachability problem for (deep) neural networks: does it compute valid output given some valid input? It was recently claimed that the problem is NP-complete for general neural networks and conjunctive…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a vertex-colored graph where each color appears (roughly) equally often in the solution.…
We generalize Knuth's construction of Case I semifields quadratic over a weak nucleus, also known as generalized Dickson semifields, by doubling of central simple algebras. We thus obtain division algebras of dimension $2s^2$ by doubling…
In this paper we investigate the possible supersymmetric extensions for the massive (bi)gravity theories in the lowest non-trivial order. For this purpose we construct the cubic interaction vertices for massive spin-2 and one or two massive…
We investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the…
Given a finite ring $A$ which is a free left module over a subring $R$ of $A$, two types of $R$-bases, pseudo-self-dual bases (similar to trace orthogonal bases) and symmetric bases, are defined which in turn are used to define duality…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
We propose several techniques to construct complete permutation polynomials of finite fields by virtue of complete permutations of subfields. In some special cases, any complete permutation polynomials over a finite field can be used to…
This is an introduction to the theory of normal bases of finite fields. The first few chapters cover a wide range of topics on the theory of normal bases of finite fields. Most standard definitions and results, including proofs are given.…