English
Related papers

Related papers: An explicit finite $B_k$-sequence

200 papers

Let a tribonacci sequence be a sequence of integers satisfying $a_k=a_{k-1}+a_{k-2}+a_{k-3}$ for all $k\ge 4$. For any positive integers $k$ and $n$, denote by $f_k(n)$ the number of tribonacci sequences with $a_1, a_2, a_3>0$ and with…

Number Theory · Mathematics 2023-01-31 Luke Pebody

Let $\xi$ be an irrational algebraic real number and $(p_k / q_k)_{k \ge 1}$ denote the sequence of its convergents. Let $(u_n)_{n \geq 1}$ be a non-degenerate linear recurrence sequence of integers, which is not a polynomial sequence. We…

Number Theory · Mathematics 2023-12-20 Yann Bugeaud , Khoa D. Nguyen

A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…

Discrete Mathematics · Computer Science 2025-05-19 Dhruv Ajmera

We prove that every $n$-letter word over $k$-letter alphabet contains some word as a subsequence in at least $k^{n/4k(1+o(1))}$ many ways, and that this is sharp as $k\to\infty$. For fixed $k$, we show that the analogous number deviates…

Combinatorics · Mathematics 2025-09-29 Boris Bukh , Aleksandre Saatashvili

An open problem posed by the first author is the complexity to decide whether a sequence of nonnegative integer numbers can be the final score of a football tournament. In this paper we propose polynomial time approximate and exponential…

Discrete Mathematics · Computer Science 2012-07-27 A. Iványi , J. E. Schoenfield

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota

For certain rings $\mathcal{R}$, we construct explicit matrices representing nonzero classes in the algebraic $K$ theory group $NK_{1}(\mathcal{R})$.

K-Theory and Homology · Mathematics 2015-06-25 Scott Schmieding

We show that for any $k\in\omega$, the structure $(H_k,\in)$ of sets that are hereditarily of size at most $k$ is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds…

Logic · Mathematics 2022-04-21 Emil Jeřábek

It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.

Representation Theory · Mathematics 2019-10-01 Victor G. Kac

Let $ K $ be a number field, $ S $ a finite set of places of $ K $, and $ \mathcal{O}_S $ be the ring of $ S $-integers. Moreover, let $$ G_n^{(0)} Z^d + \cdots + G_n^{(d-1)} Z + G_n^{(d)} $$ be a polynomial in $ Z $ having simple linear…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

Given an alphabet $S$, we consider the size of the subsets of the full sequence space $S^{\rm {\bf Z}}$ determined by the additional restriction that $x_i\not=x_{i+f(n)},\ i\in {\rm {\bf Z}},\ n\in {\rm {\bf N}}.$ Here $f$ is a positive,…

Probability · Mathematics 2015-03-20 Kari Eloranta

A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…

Combinatorics · Mathematics 2022-02-03 Shmuel Onn

It is shown that one can count $k$-edge paths in an $n$-vertex graph and $m$-set $k$-packings on an $n$-element universe, respectively, in time ${n \choose k/2}$ and ${n \choose mk/2}$, up to a factor polynomial in $n$, $k$, and $m$; in…

Data Structures and Algorithms · Computer Science 2009-04-21 Andreas Björklund , Thore Husfeldt , Petteri Kaski , Mikko Koivisto

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

Number Theory · Mathematics 2022-05-03 Melvyn B. Nathanson

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

Let $I_k = [(2k-1)^2, (2k+1)^2)$ for $k \geq 1$. Starting from the odd-composite matrix $(b_{ij})$ with $b_{ij} = (2i-1)(2j-1)$, introduced by the author in [1], we define for each odd integer $n$ the \emph{matrix multiplicity} $r(n)$, the…

Number Theory · Mathematics 2026-05-22 Wujie Shi

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

Logic · Mathematics 2014-11-27 Toshiyasu Arai

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

Combinatorics · Mathematics 2020-09-03 Brandon Hanson

In this paper we show how to construct several infinite families of polynomials $D(\bar{x},k)$, such that $\sqrt{D(\bar{x},k)}$ has a regular continued fraction expansion with arbitrarily long period, the length of this period being…

Number Theory · Mathematics 2019-01-04 James Mc Laughlin , Peter Zimmer

Let $A$ be a coherent algebra and $B$ be a finite-dimensional Gorenstein algebra over a field $k$. We describe finitely presented Gorenstein projective $A\otimes_k B$-modules in terms of their underlying onesided modules. Moreover, if the…

Representation Theory · Mathematics 2016-02-02 Dawei Shen