English
Related papers

Related papers: Avoiding two consecutive blocks of same size and s…

200 papers

We construct blocks of finite groups with arbitrarily large $\mathcal{O}$-Morita Frobenius numbers. There are no known examples of two blocks defined over $\mathcal{O}$ that are not Morita equivalent but the corresponding blocks defined…

Representation Theory · Mathematics 2021-08-19 Michael Livesey

Bivariate generating functions for various subsets of the class of permutations containing no descending sequence of length three or more are determined. The notion of absolute indecomposability of a permutation is introduced, and used in…

Combinatorics · Mathematics 2015-08-07 Michael H. Albert

Resolvable designs with two blocks per replicate are studied from an optimality perspective. Because in practice the number of replicates is typically less than the number of treatments, arguments can be based on the dual of the information…

Statistics Theory · Mathematics 2009-09-29 J. P. Morgan , Brian H. Reck

We know that any finite abelian group $G$ appears as a subgroup of infinitely many multiplicative groups $\mathbb{Z}_n^\times$ (the abelian groups of size $\phi(n)$ that are the multiplicative groups of units in the rings…

Number Theory · Mathematics 2024-09-12 Matthias Hannesson , Greg Martin

We show an invariance result for the L2-torsion of groups under uniform measure equivalence provided a measure-theoretic version of the determinant conjecture holds. The measure-theoretic determinant conjecture is discussed and, for…

Algebraic Topology · Mathematics 2010-04-20 Wolfgang Lueck , Roman Sauer , Christian Wegner

Let $K$ be a number field with ring of integers $\mathbb{Z}_K$. We prove two asymptotic formulas connected with the distribution of irreducible elements in $\mathbb{Z}_K$. First, we estimate the maximum number of nonassociated irreducibles…

Number Theory · Mathematics 2016-10-27 Paul Pollack , Lee Troupe

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

A set of arithmetical sequences $$ a_1\, (\bmod{ \,\, m_1}) \quad, \quad a_2 \, (\bmod{\,\, m_2}) \quad, \quad \dots \quad , \quad a_k \, (\bmod{\,\,m_k}) \quad \quad , $$ with $$ m_1 \leq m_2 \leq \dots \leq m_k \quad \quad , $$ is called…

Combinatorics · Mathematics 2015-11-16 Shalosh B. Ekhad , Aviezri S. Fraenkel , Doron Zeilberger

A very useful fact in additive combinatorics is that analytic expressions that can be used to count the number of structures of various kinds in subsets of Abelian groups are robust under quasirandom perturbations, and moreover that…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

Let $F \subset S_k$ be a finite set of permutations and let $C_n(F)$ denote the number of permutations $\sigma$ in $S_n$ avoiding the set of patterns $F$. The Noonan-Zeilberger conjecture states that the sequence ${C_n(F)}$ is P-recursive.…

Combinatorics · Mathematics 2015-05-26 Scott Garrabrant , Igor Pak

In this paper, we show that an extremal Type II $\ZZ_{2k}$-code of length $n$ dose not exist for all sufficiently large $n$ when $k=2,3,4,5,6$.

Combinatorics · Mathematics 2012-06-29 Tsuyoshi Miezaki

Let A be a separable unital nuclear purely infinite simple C*-algebra satisfying the Universal Coefficient Theorem, and such that the K_0-class of the identity is zero. We prove that every automorphism of order two of the K-theory of A is…

Operator Algebras · Mathematics 2007-05-23 David J. Benson , Alex Kumjian , N. Christopher Phillips

We obtain the following results about the avoidance of ternary formulas. Up to renaming of the letters, the only infinite ternary words avoiding the formula $ABCAB.ABCBA.ACB.BAC$ (resp. $ABCA.BCAB.BCB.CBA$) have the same set of recurrent…

Discrete Mathematics · Computer Science 2018-09-26 Pascal Ochem , Matthieu Rosenfeld

The main objective of this paper is the following two results. (1) There exists a computable bi-orderable group that does not have a computable bi-ordering; (2) There exists a bi-orderable, two-generated recursively presented solvable group…

Group Theory · Mathematics 2021-07-01 Arman Darbinyan

By constructing suitable nonnegative exponential sums we give upper bounds on the cardinality of any set $B_q$ in cyclic groups $\ZZ_q$ such that the difference set $B_q-B_q$ avoids cubic residues modulo $q$.

Number Theory · Mathematics 2025-04-23 Mate Matolcsi , Imre Z. Ruzsa

Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…

Combinatorics · Mathematics 2016-07-04 Minerva Catral , Pari L. Ford , Pamela E. Harris , Steven J. Miller , Dawn Nelson , Zhao Pan , Huanzhong Xu

We investigate the properties of uniform doubly stochastic random matrices, that is non-negative matrices conditioned to have their rows and columns sum to 1. The rescaled marginal distributions are shown to converge to exponential…

Probability · Mathematics 2010-11-01 Sourav Chatterjee , Persi Diaconis , Allan Sly

In [BabStein] Babson and Steingr\'{\i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. In [Kit1] Kitaev considered simultaneous…

Combinatorics · Mathematics 2007-05-23 S. Kitaev , T. Mansour