English
Related papers

Related papers: Strong Skolem Starters

200 papers

For a continuous flow on a compact metric space, the aim of this paper is to prove a Conley-type decomposition of the strong chain recurrent set. We first discuss in details the main properties of strong chain recurrent sets. We then…

Dynamical Systems · Mathematics 2019-03-27 Olga Bernardi , Anna Florio

In this paper, we introduce graceful and near graceful labellings of several families of windmills. In particular, we use Skolem-type sequences to prove (near) graceful labellings exist for windmills with $C_3$ and $C_4$ vanes, and infinite…

Combinatorics · Mathematics 2021-12-09 Ahmad H. Alkasasbeh , Danny Dyer , Jared Howell

This article aims to be a self-contained account of the history of the B. B. Newman Spelling Theorem, including the historical context in which it arose. First, an account of B. B. Newman and how he came to prove his Spelling Theorem is…

History and Overview · Mathematics 2021-07-06 Carl-Fredrik Nyberg-Brodda

To a set $\mathcal{B}$ of 4-subsets of a set $\Omega$ of size $n$ we introduce an invariant called the `hole stabilizer' which generalises a construction of Conway, Elkies and Martin of the Mathieu group $M_{12}$ based on Loyd's…

Group Theory · Mathematics 2015-12-31 Nick Gill , Neil I. Gillespie , Anthony Nixon , Jason Semeraro

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

Group Theory · Mathematics 2015-01-08 Martin R. Bridson

We introduce, on a topological space X, a class of stacks of abelian categories we call "stacks of type P." This class of stacks includes the stack of perverse sheaves (of any perversity, constructible with respect to a fixed…

Representation Theory · Mathematics 2008-01-22 David Treumann

In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…

Combinatorics · Mathematics 2024-05-30 James A. Sellers

The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) $\langle u_n \rangle_{n=0}^\infty$ over the integers has a zero term, that is, whether there exists $n$ such that $u_n = 0$. Decidability of the problem…

Computational Complexity · Computer Science 2025-10-27 Piotr Bacik , Joël Ouaknine , James Worrell

We investigate properties of an ordinal sum of uninorms introduced in [8] in the case that the summands are proper representable uninorms. We show sufficient and necessary conditions for a uninorm to be an ordinal sum of representable…

General Mathematics · Mathematics 2015-06-24 Andrea Mesiarova-Zemankova

The current work is motivated by the papers $[B_3]$, $[B_6]$, $[Be]$, $[Be-Tu]$. In particular, using Theorem 3.7 of $[B_3]$ and methods developed in this paper, the spectral and strong homology groups of continuous maps were defined and…

Algebraic Topology · Mathematics 2017-05-09 Anzor Beridze , Vladimer Baladze

We investigate multiplicative groups consisting entirely of singular alternating sign matrices (ASMs), and present several constructions of such groups. It is shown that every finite group is isomorphic to a group of singular ASMs, with a…

Rings and Algebras · Mathematics 2024-05-24 Cian O'Brien , Rachel Quinlan

Drawing inspiration from a recent paper of Heuberger, Krenn, and Lipnik, we define the class of strongly k-recursive sequences. We show that every k-automatic sequence is strongly $k$-recursive, therefore k-recursive, and discuss that the…

Formal Languages and Automata Theory · Computer Science 2024-01-26 Daniel Krenn , Jeffrey Shallit

A collection $B$ of patterns is called inversion monotone if $\mathrm{av}_n^k(B)$, the number of $B$-avoiding permutations of length $n$ with $k$ inversions, is weakly increasing in $n$ for any fixed $k$. In 2012, Claesson, Jel\'inek and…

Combinatorics · Mathematics 2026-04-02 Anders Claesson , Svante Linusson , Henning Ulfarsson , Emil Verkama

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

Commutative Algebra · Mathematics 2011-12-05 Dennis Moore , Uwe Nagel

We investigate reflection-type problems on the class SPM, of Boolean algebras carrying strictly positive finitely additive measures. We show, in particular, that in the constructible universe there is a Boolean algebra $\mathfrak A$ which…

Logic · Mathematics 2018-10-08 Menachem Magidor , Grzegorz Plebanek

We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq \mathrm{SL}(n,…

Group Theory · Mathematics 2019-05-08 Alla Detinko , Dane Flannery , Alexander Hulpke

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Algebraic Geometry · Mathematics 2024-10-24 Antoine Etesse

Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…

Category Theory · Mathematics 2024-02-23 Jiri Adamek

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

Combinatorics · Mathematics 2021-08-06 Claus Hertling , Makiko Mase

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner