English
Related papers

Related papers: Non-holonomicity of the sequence $\log 1, \log 2, …

200 papers

The normality measure $\mathcal{N}$ has been introduced by Mauduit and S{\'a}rk{\"o}zy in order to describe the pseudorandomness properties of finite binary sequences. Alon, Kohayakawa, Mauduit, Moreira and R{\"o}dl proved that the minimal…

Combinatorics · Mathematics 2013-02-11 Christoph Aistleitner

We prove that the product version of the 1-2-3 Conjecture, raised by Skowronek-Kazi{\'o}w in 2012, is true. Namely, for every connected graph with order at least 3, we prove that we can assign labels 1,2,3 to the edges in such a way that no…

Discrete Mathematics · Computer Science 2022-05-19 Julien Bensmail , Hervé Hocquard , Dimitri Lajou , Éric Sopena

Let $\omega(n)$ denote the number of distinct prime factors of a natural number $n$. In 1917, Hardy and Ramanujan proved that $\omega(n)$ has normal order $\log \log n$ over naturals. In this work, we establish the first and the second…

Number Theory · Mathematics 2024-09-17 Sourabhashis Das , Wentang Kuo , Yu-Ru Liu

It is shown that the gentle one-cycle algebra $\Lambda(n-1,1,1)$ has Hall polynomials. The Hall polynomials are explicitly given for all triples of indecomposable modules, and as a consequence, the Ringel--Hall Lie algebra of…

Representation Theory · Mathematics 2024-02-07 Hui Chen , Dong Yang

We prove the following monotonicity result for the holonomy group: Given a sequence of metric connections converging in $C^0$ such that all its members have holonomy contained in a closed group $H$, also their limit connection needs to have…

Differential Geometry · Mathematics 2026-01-19 Linus Götzfried

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

We prove that the Herzog-Sch\"onheim Conjecture holds for any group $G$ of order smaller than $1440$. In other words we show that in any non-trivial coset partition $\{g_i U_i\}_{i=1}^n $ of $G$ there exist distinct $1 \leq i, j \leq n$…

Group Theory · Mathematics 2018-03-12 Leo Margolis , Ofir Schnabel

First we consider families in the hypercube $Q_n$ with bounded VC dimension. Frankl raised the problem of estimating the number $m(n,k)$ of maximal families of VC dimension $k$. Alon, Moran and Yehudayoff showed that…

Combinatorics · Mathematics 2017-10-25 Jozsef Balogh , Tamas Meszaros , Adam Zsolt Wagner

Let $I(n)$ denote the number of isomorphism classes of subgroups of $(\Bbb Z/n\Bbb Z)^\times$, and let $G(n)$ denote the number of subgroups of $(\Bbb Z/n\Bbb Z)^\times$ counted as sets (not up to isomorphism). We prove that both $\log…

Number Theory · Mathematics 2017-10-03 Greg Martin , Lee Troupe

We investigate the conditions on an integer sequence f(n), n 2 N, with f(1) = 0, such that the sequence q(n), computed recursively via q(n) = q(n - q(n - 1)) + f(n), with q(1) = 1, exists. We prove that f(n + 1) - f(n) in {0,1}, n > 0, is a…

Number Theory · Mathematics 2023-11-27 Jonathan H. B. Deane , Guido Gentile

We study the geometry and holonomy of semi-Riemannian, time-like metric cones that are indecomposable, i.e., which do not admit a local decomposition into a semi-Riemannian product. This includes irreducible cones, for which the holonomy…

Differential Geometry · Mathematics 2022-04-14 Dmitri Alekseevsky , Vicente Cortés , Thomas Leistner

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

A cyclic proof system allows us to perform inductive reasoning without explicit inductions. We propose a cyclic proof system for HFLN, which is a higher-order predicate logic with natural numbers and alternating fixed-points. Ours is the…

Logic in Computer Science · Computer Science 2021-08-13 Mayuko Kori , Takeshi Tsukada , Naoki Kobayashi

We look at the number $L(n)$ of $O$-sequences of length $n$. Recall that an $O$-sequence can be defined algebraically as the Hilbert function of a standard graded $k$-algebra, or combinatorially as the $f$-vector of a multicomplex. The…

Commutative Algebra · Mathematics 2019-04-23 Richard P. Stanley , Fabrizio Zanello

Let $\{P_n\}_{n\geq 0}$ denote the Catalan-Larcombe-French sequence, which naturally came up from the series expansion of the complete elliptic integral of the first kind. In this paper, we prove the strict log-concavity of the sequence…

Combinatorics · Mathematics 2015-05-27 James J. Y. Zhao

Let the sequence $\{t_n\}_{n=1}^{\infty}$ of reals satisfy the condition $ \frac{t_{n+1}}{t_n} \ge 1+ \frac{\gamma}{n^\beta},0\le \beta <1, \gamma >0. $ Then the set $ \{\alpha \in [0,1]: \exists \varkappa > 0 \forall n \in \mathbb{N} ||t_n…

Number Theory · Mathematics 2007-10-20 Nikolai G. Moshchevitin

Let $n$ be a positive even integer, and let $a_1,...,a_n$ and $w_1, ..., w_n$ be integers satisfying $\sum_{k=1}^n a_k\equiv\sum_{k=1}^n w_k =0 (mod n)$. A conjecture of Bialostocki states that there is a permutation $\sigma$ on {1,...,n}…

Combinatorics · Mathematics 2015-05-13 Song Guo , Zhi-Wei Sun

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

Let $M\colon (0,1) \to [e,+\infty)$ be a decreasing function such that $\int\limits_{0}^{1}\log\log M(y)dy<+\infty$. Consider the set $H_M$ of all functions $u$ harmonic in $P:=\{(x,y)\in \mathbb{R}^n: x\in \mathbb{R}^{n-1}, y\in…

Analysis of PDEs · Mathematics 2014-08-06 Alexander Logunov

Let $(a_n)_{n\ge 1}$ be the greedy self-generating sequence defined by $a_1=1$, $a_2=2$, and, for $k\ge 3$, by taking $a_k$ to be the least integer greater than $a_{k-1}$ that can be written as a sum of at least two consecutive earlier…

Number Theory · Mathematics 2026-03-24 Quanyu Tang