English
Related papers

Related papers: How Many Reflections Make a Dihedral Set Large?

200 papers

We show that every planar triangulation on $n$ vertices has a maximal independent set of size at most $n/3$. This affirms a conjecture by Botler, Fernandes and Guti\'errez [Electron.\ J.\ Comb., 2024], which in turn would follow if an open…

Combinatorics · Mathematics 2024-10-30 P. Francis , Abraham M. Illickan , Lijo M. Jose , Deepak Rajendraprasad

If $G$ is an abelian group, we say $S\subset G$ is a set of recurrence if for every probability measure preserving $G$-system $(X,\mu,T)$ and every $D\subset X$ having $\mu(D)>0$, there is a $g\in S$ such that $\mu(D\cap T^{g}D)>0$. We say…

Dynamical Systems · Mathematics 2024-12-30 John T. Griesmer

Let $V$ be a projective variety defined over a number field $K$, let $S$ be a polarized set of endomorphisms of $V$ all defined over $K$, and let $P\in V(K)$. For each prime $\mathfrak{p}$ of $K$, let $m_{\mathfrak{p}}(S,P)$ denote the…

Number Theory · Mathematics 2023-11-08 Wade Hindes , Joseph H. Silverman

Let $S$ be a non-empty subset of a group $G$. We say $S$ is product-free if $S\cap SS=\varnothing$, and $S$ is locally maximal if whenever $T$ is product-free and $S\subseteq T$, then $S=T$. Finally $S$ fills $G$ if $G^*\subseteq S \sqcup…

Group Theory · Mathematics 2015-06-09 Chimere S. Anabanti , Sarah B. Hart

A subset $A$ of a given finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ does not equal the sum of $l$ (not necessarily distinct) elements of $A$. We are interested in finding…

Combinatorics · Mathematics 2008-04-01 Bela Bajnok

In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…

Combinatorics · Mathematics 2010-10-25 Jon McCammond , T. Kyle Petersen

Let $G\subset\GL(\BC^r)$ be a finite complex reflection group. We show that when $G$ is irreducible, apart from the exception $G=\Sgot_6$, as well as for a large class of non-irreducible groups, any automorphism of $G$ is the product of a…

Representation Theory · Mathematics 2009-03-12 Ivan Marin , Jean Michel

Julius Whiston calculated the maximum size of an irredundant generating set for $S_n$ and $A_n$ by examination of maximal subgroups. Using analogous considerations, we will compute upper bounds to this value for the first two Mathieu…

Group Theory · Mathematics 2024-04-30 Thomas G. Brooks

A symmetric subset of the reals is one that remains invariant under some reflection x --> c-x. Given 0 < x < 1, there exists a real number D(x) with the following property: if 0 < d < D(x), then every subset of [0,1] with measure x contains…

Number Theory · Mathematics 2007-05-23 Greg Martin , Kevin O'Bryant

Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such…

Commutative Algebra · Mathematics 2014-07-15 Lance Bryant , James Hamblin

For $g\in \mathbb{N}$, let $G=\Sp(2g,\mathbb{Z})$ be the integral symplectic group and $S(g)$ be the set of all positive integers which can occur as the order of an element in $G$. In this paper, we show that $S(g)$ is a bounded subset of…

Group Theory · Mathematics 2017-02-07 Kumar Balasubramanian , M. Ram Murty , Karam Deo Shankhadhar

Let $(\Sigma, \sigma)$ be a dynamical system, and let $U\subset \Sigma$. Consider the survivor set \[ \Sigma_U=\{x\in \Sigma\mid \sigma^n(x)\notin U\textrm{for all}n\} \] of points that never enter the subset $U$. We study the size of this…

Dynamical Systems · Mathematics 2017-11-21 Henna Koivusalo , Michał Rams

A group has finite palindromic width if there exists $n$ such that every element can be expressed as a product of $n$ or fewer palindromic words. We show that if $G$ has finite palindromic width with respect to some generating set, then so…

Group Theory · Mathematics 2014-09-16 T. R. Riley , A. W. Sale

A set $S\subset\{1,2,...,n\}$ is called a Sidon set if all the sums $a+b~~(a,b\in S)$ are different. Let $S_n$ be the largest cardinality of the Sidon sets in $\{1,2,...,n\}$. In a former article, the author proved the following asymptotic…

Number Theory · Mathematics 2022-05-04 Yuchen Ding

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

Discrete Mathematics · Computer Science 2009-12-17 Otfried Cheong , Xavier Goaoc , Cyril Nicaud

Let $G$ be a finite group and $S$ a subset of $G$. Then $S$ is product-free if $S \cap SS = \emptyset$, and complete if $G^{\ast} \subseteq S \cup SS$. A product-free set is locally maximal if it is not contained in a strictly larger…

Combinatorics · Mathematics 2016-10-03 Chimere S. Anabanti , Grahame Erskine , Sarah B. Hart

Vershik and Kerov gave asymptotical bounds for the maximal and the typical dimensions of irreducible representations of symmetric groups $S_n$. It was conjectured by G. Olshanski that the maximal and the typical dimensions of the isotypic…

Representation Theory · Mathematics 2011-10-21 Sevak Mkrtchyan

In this note, it is proved that over a commutative noetherian henselian non-Gorenstein local ring there are infinitely many isomorphism classes of indecomposable totally reflexive modules, if there is a nonfree cyclic totally reflexive…

Commutative Algebra · Mathematics 2007-05-23 Ryo Takahashi

For a fixed integer base $b\geq2$, we consider the number of compositions of $1$ into a given number of powers of $b$ and, related, the maximum number of representations a positive integer can have as an ordered sum of powers of $b$. We…

Number Theory · Mathematics 2015-11-10 Daniel Krenn , Stephan Wagner

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant
‹ Prev 1 3 4 5 6 7 10 Next ›