Related papers: Constructions of normal numbers with infinitely ma…
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of…
We study the number $O_d$ of finite $O$-sequences of a given multiplicity $d$, with particular attention to the computation of $O_d$. We show that the sequence $(O_d)_d$ is sub-Fibonacci, and that if the sequence $(O_d / O_{d-1})_d$…
The Stirling number of a simple graph is the number of partitions of its vertex set into a specific number of non-empty independent sets. In 2015, Engbers et al. showed that the coefficients in the normal ordering of a word $w$ in the…
The issue of constructing N=1,2,3 supersymmetric extensions of the l-conformal Galilei algebra is reconsidered following the approach in [JHEP 1709 (2017) 131]. Drawing a parallel between acceleration generators entering the superalgebra…
Let $ k \geq 2 $ and $ ( L_{n}^{(k)} )_{n \geq 2-k} $ be the $k-$generalized Lucas sequence with initial condition $ L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 ,$ $ L_{0}^{(k,}=2,$ $ L_{1}^{(k)}=1$ and each term afterwards is the sum of the $…
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…
We present in this paper a universal method of constructing left-continuous triangular norms (l.-c. t-norms). The starting point is an arbitrary, possibly finite, totally ordered monoid fulfilling the conditions that are characteristic for…
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let $ m >2$ be a positive integer. For an odd prime $ p $, let $ r=p^m $ and…
A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…
A novel construction of lattices is proposed. This construction can be thought of as a special class of Construction A from codes over finite rings that can be represented as the Cartesian product of $L$ linear codes over…
We construct infinite families of graphs that are determined by their generalized spectrum. This construction is based on new formulae for the determinant of the walk matrix of a graph. The graphs constructed here all satisfy a lower…
In probability theory and statistics, the IID model represents a single population, and a large, potentially infinite sample from this population. Main theorems, in particular the central limit theorem and laws of large number (LLN) assure…
We explicitly construct infinite families of MSTD (more sums than differences) sets. There are enough of these sets to prove that there exists a constant C such that at least C / r^4 of the 2^r subsets of {1,...,r} are MSTD sets; thus our…
In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
We construct a uniformly discrete, and even sparse, sequence of real numbers $\Lambda=\{\lambda_n\}$ and a function g in $L^2(R)$, such that for every q>2, every function f in $L^2(R)$ can be approximated with arbitrary small error by a…
We construct an infinite family of real cyclotomic fields with non-trivial class group. This result generalizes the result in [1] in the sense that our family includes theirs.
In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…
For odd n>=3, we consider a general hypothetical identity for the differences S_{n,0}(x) of multiples of n with even and odd digit sums in the base n-1 in interval [0,x), which we prove in the cases n=3 and n=5 and empirically confirm for…
Datasets from several domains, such as life-sciences, semantic web, machine learning, natural language processing, etc. are naturally structured as acyclic graphs. These datasets, particularly those in bio-informatics and computational…