中文
相关论文

相关论文: On the least exponential growth admitting uncounta…

200 篇论文

We establish an interesting upper bound for the moments of truncated Dirichlet convolution of M\"obius function, a function noted $M(n,z)$. Our result implies that $M(n,j)$ is usually quite small for $j \in \{1,\dots,n\}$. Also, we…

数论 · 数学 2019-04-18 Patrick Letendre

Each group G of nxn permutation matrices has a corresponding permutation polytope, P(G):=conv(G) in R^{nxn}. We relate the structure of P(G) to the transitivity of G. In particular, we show that if G has t nontrivial orbits, then…

组合数学 · 数学 2007-05-23 Robert Guralnick , David Perkinson

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same…

形式语言与自动机理论 · 计算机科学 2014-03-03 Szabolcs Ivan , Judit Nagy-Gyorgy

A permutation is said to be \emph{alternating} if it starts with rise and then descents and rises come in turn. In this paper we study the generating function for the number of alternating permutations on $n$ letters that avoid or contain…

组合数学 · 数学 2007-05-23 T. Mansour

The upper bound for asymptotic behavior of the coefficients of expansion of the evolution operator kernel in powers of the time interval $\Dt$ was obtained. It is found that for the nonpolynomial potentials the coefficients may increase as…

高能物理 - 理论 · 物理学 2009-10-28 V. A. Slobodenyuk

We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…

概率论 · 数学 2021-07-14 Agelos Georgakopoulos , Christoforos Panagiotis

We establish that any even permutation from A_n moving at least [3n/4] + o(n) points is the commutator of a generating pair of A_n and a generating pair of S_n. From this we deduce an exponential lower bound on the number of systems of…

群论 · 数学 2014-03-13 David Zmiaikou

Finite dimensional subspaces spanned by exponential functions in the space of square integrable functions on a finite interval of the real line are considered. Their limiting positions are studied and described in terms of expo-polynomials.

泛函分析 · 数学 2014-10-28 Ruslan Sharipov

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

组合数学 · 数学 2007-05-23 Sergi Elizalde

We survey properties of the set of possible exponents of subsets of $\Z_n$ (equivalently, exponents of primitive circulant digraphs on $n$ vertices). Let $E_n$ denote this exponent set. We point out that $E_n$ contains the positive integers…

数论 · 数学 2011-08-17 P. J. Dukes , S. Herke

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

数论 · 数学 2025-10-08 Armand Noubissie

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

数论 · 数学 2013-04-18 Zhi-Wei Sun

We enumerate the numbers $Av_n^k(1324)$ of 1324-avoiding $n$-permutations with exactly $k$ inversions for all $k$ and $n \geq (k+7)/2$. The result depends on a structural characterization of such permutations in terms of a new notion of…

组合数学 · 数学 2024-08-28 Svante Linusson , Emil Verkama

For independent nearest-neighbour bond percolation on Z^d with d >> 6, we prove that the incipient infinite cluster's two-point function and three-point function converge to those of integrated super-Brownian excursion (ISE) in the scaling…

数学物理 · 物理学 2009-10-31 Takashi Hara , Gordon Slade

We prove $\sqrt{\log n}$ lower bounds on the order of growth fluctuations in three planar growth models (first-passage percolation, last-passage percolation, and directed polymers) under no assumptions on the distribution of vertex or edge…

概率论 · 数学 2021-08-30 Erik Bates , Sourav Chatterjee

We improve the upper bound for the maximum possible number of stable matchings among $n$ jobs and $n$ applicants from $131072^n+O(1)$ to $3.55^n+O(1)$. To establish this bound, we state a novel formulation of a certain entropy bound that is…

组合数学 · 数学 2021-06-07 Cory Palmer , Dömötör Pálvölgyi

This short note studies the asymptotic behavior of a generating function associated with the decimal expansion of \(2^n\). Our aims are twofold: (i) to present a problem on the best possible upper bound for this behavior, and (ii) to…

组合数学 · 数学 2025-10-22 Hideaki Noda

We prove that any permutation group of degree $n \geq 4$ has at most $5^{(n-1)/3}$ conjugacy classes.

群论 · 数学 2014-07-23 Attila Maróti , Martino Garonzi

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a…

度量几何 · 数学 2022-01-06 Panos Papasoglu