Related papers: Strong Skolem Starters
A subgroup H of an algebraic group G is said to be strongly solvable if H is contained in a Borel subgroup of G. This paper is devoted to establishing relationships between the following three combinatorial classifications of strongly…
We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the…
A strong triangle blocking arrangement is a geometric arrangement of some line segments in a triangle with certain intersection properties. It turns out that they are closely related to blocking sets. Our aim in this paper is to prove a…
If the sequent (Gamma entails forall x exists y A) is provable in first order constructive natural deduction, then the theory (Gamma, forall x (f (x)/y)A), where f is a new function symbol, is a conservative extension of Gamma.
A group is called strongly bounded, if the speed with which it is generated by finitely many conjugacy classes has a positive, lower bound only dependent on the number of the conjugacy classes in question rather than the actual conjugacy…
The Skolem Problem asks, given an integer linear recurrence sequence (LRS), to determine whether the sequence contains a zero term or not. Its decidability is a longstanding open problem in theoretical computer science and automata theory.…
A strong blocking set in a finite projective space is a set of points that intersects each hyperplane in a spanning set. We provide a new graph theoretic construction of such sets: combining constant-degree expanders with asymptotically…
We develop a combinatorial and order-theoretic framework for shuffles, understood as ordered concatenations of indexed families of sequences that induce total orders on the natural numbers. Motivated by the classical \v{S}arkovski\u{i}…
In this paper, I survey frame starters, as well as orthogonal and strong frame starters, in abelian groups. I mainly recall and re-examine existence and nonexistence results, but I will prove some new results as well.
Summability methods for ultraholomorphic classes in sectors, defined in terms of a strongly regular sequence $\mathbb{M}=(M_p)_{p\in\mathbb{N}_0}$, have been put forward by A. Lastra, S. Malek and the second author [1], and their validity…
For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…
The notion of the Fibonacci cobweb poset from [1] has been naturally extended to any admissible sequence $F$ in [2] where it was also recognized that the celebrated prefab notion of Bender and Goldman [3] - (see also [4,5]) - admits such an…
Skolem sequences and Skolem labeled graphs have been described and examined for several decades. This note explores weak Skolem labelling of cycle graphs, which we call Skolem circles. The relationship between Skolem sequences and Skolem…
We introduce a special class of powerful $p$-groups that we call powerfully nilpotent groups that are finite $p$-groups that possess a central series of a special kind. To these we can attach the notion of a powerful nilpotence class that…
It is shown that for the conjugation action of the symmetric group $S_n,$ when $n=6$ or $n\geq 8,$ all $S_n$-irreducibles appear as constituents of a single conjugacy class, namely, one indexed by a partition $\lambda$ of $n$ with at least…
We discuss many surprising implications of a positive answer to a question raised in some cases by Greenberg in the $`70$s and more generally by Shalom in the early $2000$s. We refer to this positive answer as the Greenberg-Shalom…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
In this paper we give an explicit characterization of o-minimal structures with definable Skolem functions/definable choice. Such structures are, after naming finitely many elements from the prime model, a union of finitely many trivial…
We prove that any strongly mixing action of a countable abelian group on a probability space has higher order mixing properties. This is achieved via introducing and utilizing $\mathcal R$-limits, a notion of convergence which is based on…