相关论文: On perfect, amicable, and sociable chains
One major problem in the study of numerical semigroups is determining the growth of the semigroup tree. In the present work, infinite chains of numerical semigroups in the semigroup tree, firstly introduced by Bras-Amor\'os and Bulygin…
A perfect graph is a graph which every induced subgraph has clique number equal to chromatic number. In this paper, I will introduce a new family of graphs, the quasiperfect graphs which generalizes the perfect graphs.
Let F(n) be a polynomial of degree at least 2 with integer coefficients. We consider the products N_x=\prod_{1 \le n \le x} F(n) and show that N_x should only rarely be a perfect power. In particular, the number of x \le X for which N_x is…
In [1], finite associative rings wih identity and such that the set of all zero-divisors form and ideal M, called the Jacobson Radical, of cube zero and square non-zero, were constructed for all the characteristics. These rings are…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
The Doob graph $D(m,n)$ is the Cartesian product of $m>0$ copies of the Shrikhande graph and $n$ copies of the complete graph of order $4$. Naturally, $D(m,n)$ can be represented as a Cayley graph on the additive group $(Z_4^2)^m \times…
In this paper we introduce the notion of "strong $n$-perfect rings" which is in some way a generalization of the notion of "$n$-perfect rings". We are mainly concerned with those class of rings in the context of pullbacks. Also we exhibit a…
We study a simple Markov chain, the switch chain, on the set of all perfect matchings in a bipartite graph. This Markov chain was proposed by Diaconis, Graham and Holmes as a possible approach to a sampling problem arising in Statistics. We…
A certain type of integer grid, called here an echelon grid, is an object found both in coherent systems whose components have a finite or countable number of levels and in algebraic geometry. If \alpha=(\alpha_1,...,\alpha_d) is an integer…
Translated from the Latin original, "De numeris amicabilibus" (1747). E100 in the Enestroem index. Euler starts by saying that with the success of mathematical analysis, number theory has been neglected. He argues that number theory is…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We characterize the associative, idempotent, symmetric, and order-preserving operations on (finite) chains in terms of properties of (the Hasse diagram of) their associated semilattice order. In particular, we prove that the number of…
The problem of constructing a perfect cuboid is related to a certain class of univariate polynomials with three integer parameters $a$, $b$, and $u$. Their irreducibility over the ring of integers under certain restrictions for $a$, $b$,…
This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…
Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…
In this article, we have defined nil clean graph of a ring $R$. The vertex set is the ring $R$, two ring elements $a$ and $b$ are adjacent if and only if $a + b$ is nil clean in $R$. Graph theoretic properties like girth, dominating set,…
In this paper, we consider a conjecture of Erd\H{o}s and Rosenfeld when the number is a perfect square. In particular, we show that every perfect square $n$ can have at most five divisors between $\sqrt{n} - c \sqrt[4]{n}$ and $\sqrt{n} + c…
Fibonacci chains are special diatomic, harmonic chains with uniform nearest neighbour interaction and two kinds of atoms (mass-ratio $r$) arranged according to the self-similar binary Fibonacci sequence $ABAABABA...$, which is obtained by…