English
Related papers

Related papers: Higher-order Carmichael numbers

200 papers

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

Logic in Computer Science · Computer Science 2025-04-18 Zhibo Chen , Frank Pfenning

Let K be a number field, and let a be a non-zero element of K. Fix some prime number l. We compute the density of the following set: the primes p of K such that the multiplicative order of the reduction of a modulo p is coprime to l (or,…

Number Theory · Mathematics 2014-05-20 Antonella Perucca

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

Organizing a chemical space so that elements with similar properties would take neighboring places in a sequence can help to predict new materials. In this paper, we propose a universal method of generating such a one-dimensional sequence…

Materials Science · Physics 2020-12-04 Zahed Allahyari , Artem R. Oganov

We count the number of countable homogeneous colored linear orderings in $k$ colors. Relatedly, we count the number of countable $C_{n,m}$-homogeneous linear orderings. $C_{n,m}$-homogeneity is a strong homogeneity notion that approximates…

Combinatorics · Mathematics 2026-04-17 David Gonzalez

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Combinatorics · Mathematics 2010-03-05 Milan Janjic

An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…

Number Theory · Mathematics 2022-07-01 Denis Simon , Lea Terracini

In this paper, we study umbral calculus to have alternative ways of obtaining our results. That is, we derive some interesting identities of the higher-order Bernoulli, Euler and Hermite polynomials arising from umbral calculus to have…

Number Theory · Mathematics 2013-02-22 Taekyun Kim , Dae San Kim , Seog-Hoon Rim , Dmitry v. Dolgy

We study an infinite countable iteration of the natural product between ordinals. We present an "effective" way to compute this countable natural product, in the non trivial cases the result depends only on the natural sum of the degrees of…

Logic · Mathematics 2018-09-10 Paolo Lipparini

A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…

Geometric Topology · Mathematics 2012-03-30 Simon R. Blackburn

The notion of the higher rank numerical range $\Lambda_{k}(L(\lambda))$ for matrix polynomials $L(\lambda)=A_{m}\lambda^{m}+...+A_{1}\lambda+A_{0}$ is introduced here and some fundamental geometrical properties are investigated. Further,…

Rings and Algebras · Mathematics 2011-04-08 Aikaterini Aretaki , John Maroulas

The operational calculus associated with Hermite numbers has been shown to be an effective tool for simplifying the study of special functions. Within this context, Hermite polynomials have been viewed as Newton binomials, with the…

Number Theory · Mathematics 2026-04-23 Giuseppe Dattoli , Subuhi Khan , Ujair Ahmad

Let $KO(CP^m)$ be the KO-ring of the complex projective space $CP^m.$ By means of methods of rational D-series, a formula for the J-orders of elements of $KO(CP^m)$ is given. Explicit formulas are given for computing the J-orders of the…

K-Theory and Homology · Mathematics 2007-05-23 Mohammad Obiedat

For an $n \times n$ matrix $M$ with entries in $\mathbb{Z}_2$ denote by $R(M)$ the minimal rank of all the matrices obtained by changing some numbers on the main diagonal of $M$. We prove that for each non-negative integer $k$ there is a…

Combinatorics · Mathematics 2021-04-22 Eugene Kogan

We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…

Logic · Mathematics 2025-08-26 Adrian Ducourtial

Literature considers under the name \emph{unimaginable numbers} any positive integer going beyond any physical application, with this being more of a vague description of what we are talking about rather than an actual mathematical…

Logic in Computer Science · Computer Science 2019-03-13 Antonino Leonardis , Gianfranco D'Atri , Fabio Caldarola

An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…

Group Theory · Mathematics 2018-08-24 João Araújo , Peter J. Cameron , Carlo Casolo , Francesco Matucci

Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…

Number Theory · Mathematics 2020-10-14 William D. Banks

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

Combinatorics · Mathematics 2016-07-26 Jordan Almeter , Samet Demircan , Andrew Kallmeyer , Kevin G. Milans , Robert Winslow

We deduce a simple representation and the invariant factor decompositions of the subgroups of the group $\Bbb{Z}_m \times \Bbb{Z}_n$, where $m$ and $n$ are arbitrary positive integers. We obtain formulas for the total number of subgroups…

Group Theory · Mathematics 2014-10-28 Mario Hampejs , Nicki Holighaus , László Tóth , Christoph Wiesmeyr
‹ Prev 1 8 9 10 Next ›