相关论文: Higher-order Carmichael numbers

For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

Recently, Komatsu introduced the concept of poly-Cauchy numbers and polynomials which generalize Cauchy numbers and polynomials. In this paper, we consider the new concept of higher-order Cauchy numbers and polynomials which generalize…

One of the main goals of design theory is to classify, characterize and count various combinatorial objects with some prescribed properties. In most cases, however, one quickly encounters a combinatorial explosion and even if the complete…

As a result of 33 intercontinental Zoom calls, we characterise big Ramsey degrees of the generic partial order. This is an infinitary extension of the well known fact that finite partial orders endowed with linear extensions form a Ramsey…

In this paper we present a recurrent relation for counting meaningful compositions of the higher-order differential operations on the space $R^{n}$ (n=3,4,...) and extract the non-trivial compositions of order higher than two.

Nichols algebras of group type with many cubic relations are classified under a technical assumption on the structure of Hurwitz orbits of the third power of the underlying indecomposable rack. All such Nichols algebras are…

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

We define Chern numbers of a matroid. These numbers are obtained when intersecting appropriate matroid Chern-Schwartz-MacPherson cycles defined by L\'opez de Medrano, Rinc\'on, and Shaw. We prove that when a matroid arises from a complex…

We use methods of combinatorial number theory to prove that, for each $n>1$ and any prime $p$, some homotopy group $\pi_i(SU(n))$ contains an element of order $p^{n-1+ord_p([n/p]!)}$, where $ord_p(m)$ denotes the largest integer $\alpha$…

In this paper we introduce and study two generalizations of Lah numbers, analogous to the Stirling numbers with higher level - a combinatorial one (Lah numbers with higher level) and an algebraic one (Lah numbers of order $s$). We define…

Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all…

Commutative totally ordered monoids abound, number systems for example. When the monoid is not assumed commutative, one may be hard pressed to find an example. One suggested by Professor Orr Shalit are the countable ordinals with addition.…

Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…

It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

A three-dimensional polynomial algebra of order $m$ is defined by the commutation relations $[P_0, P_\pm]$ $=$ $\pm P_\pm$, $[P_+, P_-]$ $=$ $\phi^{(m)}(P_0)$ where $\phi^{(m)}(P_0)$ is an $m$-th order polynomial in $P_0$ with the…

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

Let Cr(k) be the Cremona group of rank 2 over a field k, i.e. the group of all k-automorphisms of k(X,Y). We determine the l.c.m. of the orders of the finite subgroups of Cr(k) of order prime to the characteristic of k.

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…