English
Related papers

Related papers: Strong marker sets and applications

200 papers

For every integer d > 9, we construct infinite families {G_n}_n of d+1-regular graphs which have a large girth > log_d |G_n|, and for d large enough > 1,33 log_d |G_n|. These are Cayley graphs on PGL_2(q) for a special set of d+1 generators…

Combinatorics · Mathematics 2015-01-05 Xavier Dahan

We prove that there exists a positive, explicit function $F(k, E)$ such that, for any group $G$ admitting a $k$-acylindrical splitting and any generating set $S$ of $G$ with $\mathrm{Ent}(G,S)<E$, we have $|S| \leq F(k, E)$. We deduce…

Metric Geometry · Mathematics 2018-04-13 Filippo Cerocchi , Andrea Sambusetti

Let $S$ be an algebraic semigroup (not necessarily linear) defined over a field $F$. We show that there exists a positive integer $n$ such that $x^n$ belongs to a subgroup of $S(F)$ for any $x \in S(F)$. In particular, the semigroup $S(F)$…

Algebraic Geometry · Mathematics 2013-07-19 Michel Brion , Lex E. Renner

Using matrix iterations of ccc posets, we prove the consistency with ZFC of some cases where the cardinals on the right hand side of Cichon's diagram take two or three arbitrary values (two regular values, the third one with uncountable…

Logic · Mathematics 2013-08-12 Diego Alejandro Mejía

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

Combinatorics · Mathematics 2007-05-23 Jason P. Bell , Stefan Gerhold

The property of a vector lattice of sufficiently many projections (SMP) is informed by restricting attention to archimedean $A$ with a distinguished weak order unit $u$ (the class, or category, $\bf{W}$), where the Yosida representation $A…

General Topology · Mathematics 2024-04-30 Anthony W. Hager , Brian Wynne

Let $S_b(n)$ denote the sum of the squares of the digits of the positive integer $n$ in base $b\geq2$. It is well-known that the sequence of iterates of $S_b(n)$ terminates in a fixed point or enters a cycle. Let $N=2n-1$, $n\geq2$. It is…

General Mathematics · Mathematics 2023-10-10 Walter A. Kehowski

A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a $k$-regular graph at least $2k-1$ colors are needed. We show that a $k$-regular graph…

Combinatorics · Mathematics 2022-07-13 Borut Lužar , Edita Mačajová , Martin Škoviera , Roman Soták

It was recently proved that any graph satisfying $\omega > \frac 23(\Delta+1)$ contains a stable set hitting every maximum clique. In this note we prove that the same is true for graphs satisfying $\omega \geq \frac 23(\Delta+1)$ unless the…

Discrete Mathematics · Computer Science 2012-05-29 Demetres Christofides , Katherine Edwards , Andrew D. King

We consider the asymptotic normalcy of families of random variables $X$ which count the number of occupied sites in some large set. We write $Prob(X=m)=p_mz_0^m/P(z_0)$, where $P(z)$ is the generating function $P(z)=\sum_{j=0}^{N}p_jz^j$…

Combinatorics · Mathematics 2015-08-19 J. L. Lebowitz , B. Pittel , D. Ruelle , E. R. Speer

For a field $\mathbb{F}$ and integers $d$ and $k$, a set ${\cal A} \subseteq \mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ vectors of ${\cal A}$ include an orthogonal pair. We prove…

Combinatorics · Mathematics 2024-12-13 Ishay Haviv , Sam Mattheus , Aleksa Milojević , Yuval Wigderson

Rabern recently proved that any graph with omega >= (3/4)(Delta+1) contains a stable set meeting all maximum cliques. We strengthen this result, proving that such a stable set exists for any graph with omega > (2/3)(Delta+1). This is tight,…

Discrete Mathematics · Computer Science 2011-02-11 Andrew D. King

In 1996, Reed, Robertson, Seymour and Thomas [Combinatorica 1996] proved Younger's Conjecture, which states that, for all directed graphs $D$, there exists a function $f$ such that, if $D$ does not contain $k$ disjoint cycles, then $D$…

Discrete Mathematics · Computer Science 2026-02-18 Meike Hatzel , Stephan Kreutzer , Marcelo Garlet Milani , Irene Muzi

A family of random matrices $\boldsymbol{X}^N=(X_1^N,\ldots,X_d^N)$ is said to converge strongly to a family of bounded operators $\boldsymbol{x}=(x_1,\ldots,x_d)$ when $\|P(\boldsymbol{X}^N,\boldsymbol{X}^{N*})\|\to\|P(\boldsymbol{x},…

Probability · Mathematics 2026-03-09 Chi-Fang Chen , Jorge Garza-Vargas , Joel A. Tropp , Ramon van Handel

Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding a…

Data Structures and Algorithms · Computer Science 2014-11-21 Valentin Garnero , Christophe Paul , Ignasi Sau , Dimitrios M. Thilikos

This note concerns the non-existence of three consecutive powerful numbers. We use Pell equations, elliptic curves, and second-order recurrences to show that there are no such triplets with the middle term a perfect cube and each of the…

Number Theory · Mathematics 2025-03-28 Tsz Ho Chan

Our main result is a generalized Dillon-type theorem, giving graph-theoretic conditions which guarantee that a $p$-ary function in an even number of variables is bent, for $p$ a prime number greater than 2. The key condition is that the…

Combinatorics · Mathematics 2019-04-23 Caroline Grant Melles , David Joyner

We study forced periodicity of two-dimensional configurations under certain constraints and use an algebraic approach to multidimensional symbolic dynamics in which $d$-dimensional configurations and finite patterns are presented as formal…

Combinatorics · Mathematics 2023-01-16 Pyry Herva , Jarkko Kari

Let $(M,I,J,K)$ be a hyperkaehler manifold, $\dim_\R M =4n$. We study positive, Dolbeault-closed $(2p,0)$-forms on $(M,I)$. These forms are quaternionic analogues of the positive $(p,p)$-forms. We construct an injective homomorphism mapping…

Complex Variables · Mathematics 2010-06-29 Misha Verbitsky

A version of the classical Klee-And\^o Theorem states the following: For every Banach space $X$, ordered by a closed generating cone $C\subseteq X$, there exists some $\alpha>0$ so that, for every $x\in X$, there exist $x^{\pm}\in C$ so…

Functional Analysis · Mathematics 2018-02-23 Miek Messerschmidt
‹ Prev 1 4 5 6 7 8 10 Next ›