journal: Discrete Mathematics and Applications

Impact Factor: 0.5

Published since January 1, 1991

Discrete Mathematics and Applications

ISSN: 1569-3929

Editor-in-chief: Andrei M. Zubkov

About this journal

Objective
Discrete Mathematics and Applications provides the latest information on the development of discrete mathematics in Russia to a world-wide readership. The journal contains papers from the Russian-language journal Diskretnaya Matematika, the only journal of the Russian Academy of Sciences devoted to this field of mathematics. Discrete Mathematics and Applications covers various subjects in the fields such as combinatorial analysis, graph theory, functional systems theory, cryptology, coding, probabilistic problems of discrete mathematics, algorithms and their complexity, combinatorial and computational problems of number theory and of algebra.

The journal is published bimonthly, simultaneously with the Russian edition as a cover-to-cover translation. Issues contain, in addition to original articles and reviews in the above-mentioned subject areas, reviews of books published in and outside Russia and information notes. Articles written in the English-language are most welcome!

Topics

Combinatorial analysis
Graph theory
Functional systems theory
Cryptology
Coding
Probabilistic problems of discrete mathematics
Algorithms and their complexity
Combinatorial and computational problems of number theory and of algebra
Number theory
Combinatorics and graph
Probability theory
Statistics

Article formats
Original research articles

Information on submission process

Submit Article

Your Benefits

Your benefits

World-wide readership
Excellent articles from all over the world
Various contributions covering most urgent topics in discrete mathematics
Recognized editorial board

Abstracting and Indexing

Discrete Mathematics and Applications is covered by the following services:

Baidu Scholar
CNKI Scholar (China National Knowledge Infrastructure)
CNPIEC - cnpLINKer
Dimensions
EBSCO (relevant databases)
EBSCO Discovery Service
Ei Compendex
Engineering Village
Genamics JournalSeek
Google Scholar
Japan Science and Technology Agency (JST)
J-Gate
JournalGuide
JournalTOCs
KESLI-NDSL (Korean National Discovery for Science Leaders)
Mathematical Reviews (MathSciNet)
MathNET
MyScienceWork
Naver Academic
Naviga (Softweco)
Primo Central (ExLibris)
ProQuest (relevant databases)
Publons
QOAM (Quality Open Access Market)
ReadCube
Scilit
SCImago (SJR)
SCOPUS
Semantic Scholar
Sherpa/RoMEO
Summon (ProQuest)
TDNet
Ulrich's Periodicals Directory/ulrichsweb
WanFang Data
Web of Science - Emerging Sources Citation Index
WorldCat (OCLC)
X-MOL
Yewno Discover
zbMATH Open

Supplementary Materials

Topics

Volume 33 Issue 5

October 2023

Publicly Available October 16, 2023

Frontmatter

Page range: i-iii

Download PDF

October 16, 2023

On small distance-regular graphs with the intersection arrays {mn − 1, (m − 1)(n + 1), n − m + 1; 1, 1, (m − 1)(n + 1)}

Aleksandr A. Makhnev, Mikhail P. Golubyatnikov

Page range: 273-281

Abstract

Let Γ be a diameter 3 distance-regular graph with a strongly regular graph Γ 3 , where Γ 3 is the graph whose vertex set coincides with the vertex set of the graph Γ and two vertices are adjacent whenever they are at distance 3 in the graph Γ . Computing the parameters of Γ 3 by the intersection array of the graph Γ is considered as the direct problem. Recovering the intersection array of the graph Γ by the parameters of Γ 3 is referred to as the inverse problem. The inverse problem for Γ 3 has been solved earlier by A. A. Makhnev and M. S. Nirova. In the case where Γ 3 is a pseudo-geometric graph of a net, a series of admissible intersection arrays has been obtained: { c 2 ( u 2 − m 2 ) + 2 c 2 m − c 2 − 1, c 2 ( u 2 − m 2 ), ( c 2 − 1)( u 2 − m 2 ) + 2 c 2 m − c 2 ; 1, c 2 , u 2 − m 2 } (A. A. Makhnev, Wenbin Guo, M. P. Golubyatnikov). The cases c 2 = 1 and c 2 = 2 have been examined by A. A. Makhnev, M. P. Golubyatnikov and A. A. Makhnev, M. S. Nirova, respectively. In this paper in the class of graphs with the intersection arrays { mn − 1, ( m − 1)( n + 1)}, { n − m + 1}; 1, 1, ( m − 1)( n + 1)} all admissible intersection arrays for {3 ≤ m ≤ 13} are found: {20,16,5; 1, 1,16}, {39,36,4; 1, 1,36}, {55,54,2; 1, 2,54}, {90,84,7; 1, 1,84}, {220,216,5; 1, 1,216}, {272,264,9; 1, 1,264} and {350,336,15; 1, 1,336}. It is demonstrated that graphs with the intersection arrays {20,16,5; 1, 1,16}, {39,36,4; 1, 1,36} and {90,84,7; 1, 1,84} do not exist.

October 16, 2023

On algebraicity of lattices of ω-fibred formations of finite groups

Serafim P. Maksakov, Marina M. Sorokina

Page range: 283-291

Abstract

For a nonempty set ω of primes, V. A. Vedernikov had constructed ω -fibred formations of groups via function methods. We study lattice properties of ω -fibred formations of finite groups with direction δ satisfying the condition δ 0 ≤ δ . The lattice ω δF θ of all ω -fibred formations with direction δ and θ -valued ω -satellite is shown to be algebraic under the condition that the lattice of formations θ is algebraic. As a corollary, the lattices ω δF , ω δF τ , τ ω δF , ω δ n F of ω -fibred formations of groups are shown to be algebraic.

October 16, 2023

On polynomial-modular recursive sequences

Sergey S. Marchenkov

Page range: 293-298

Abstract

We consider recursive sequences over the set of integers, where as rules of generation we take arbitrary superpositions of polynomial functions and the function | x |; such sequences are referred to as polynomial-modular recursive sequences. We show how evaluations on three-tape Minsky machines can be simulated via polynomial-modular recursive sequences. Based on this result, we formulate algorithmically unsolvable problems related to polynomial-modular recursive sequences. We also consider recursive sequences in which the rules of generation are functions formed by some superpositions of polynomial functions and the function [x]. $\begin{array}{} \displaystyle [\sqrt{x}]. \end{array}$ For the set of such recursive sequences, an algorithmically unsolvable problem is indicated.

October 16, 2023

Classes of piecewise-quasiaffine transformations on the generalized 2-group of quaternions

Boris A. Pogorelov, Marina A. Pudovkina

Page range: 299-316

Abstract

The class of nonabelian 2-groups H with cyclic subgroup of index 2 includes the dihedral group, the generalized quaternion group, the semidihedral group, and the modular maximal cyclic group, which have many various applications in discrete mathematics and cryptography. We introduce piecewise-quasiaffine transformations on a group H , and put forward criteria of their bijectivity. For the generalized group of quaternions of order 2 m , we obtain a complete classification of orthomorphisms, complete transformations, and their left analogues in the class of piecewise-quasiaffine transformations under consideration. We also evaluate their cardinalities.

October 16, 2023

Limit theorem for a smoothed version of the spectral test for testing the equiprobability of a binary sequence

Maksim P. Savelov

Page range: 317-323

Abstract

We consider the problem of testing the hypothesis that the tested sequence is a sequence of independent random variables that take values 1 and –1 with equal probability. To solve this problem, the Discrete Fourier Transform (spectral) test of the NIST package uses the statistic T Fourier , the exact limiting distribution of which is unknown. In this paper a new statistic is proposed and its limiting distribution is established. This new statistic is a slight modification of T Fourier . A hypothesis about the limit distribution of T Fourier is formulated, which is confirmed by numerical experiments presented by Pareschi F., Rovatti R. and Setti G.

October 16, 2023

Limit theorem for stationary distribution of a critical controlled branching process with immigration

Vladimir I. Vinokurov

Page range: 325-337

Abstract

We consider the sequence { ξ n , t } t ≥1 of controlled critical branching processes with immigration, where n = 1, 2, … is an integer parameter limiting the population size. It is shown that for n → ∞ the stationary distributions of considered branching processes normalized by n $\begin{array}{} \sqrt{n} \end{array} $ converge to the distribution of a random variable whose square has a gamma distribution.

Volume 33 (2023)

Volume 32 (2022)

Volume 31 (2021)

Volume 30 (2020)

Volume 29 (2019)

Volume 28 (2018)

Volume 27 (2017)

Volume 26 (2016)

Volume 25 (2015)

Volume 24 (2014)

Volume 23 (2013)

Volume 22 (2012)

Volume 21 (2011)

Volume 20 (2010)

Volume 19 (2009)

Volume 18 (2008)

Volume 17 (2007)

Volume 16 (2006)

Volume 15 (2005)

Volume 14 (2004)

Volume 13 (2003)

Volume 12 (2002)

Volume 11 (2001)

Volume 10 (2000)

Volume 9 (1999)

Volume 8 (1998)

Volume 7 (1997)

Volume 6 (1996)

Volume 5 (1995)

Volume 4 (1994)

Volume 3 (1993)

Volume 2 (1992)

Volume 1 (1991)

Journal Impact Factor	0.5	2022, Journal Citation Reports (Clarivate, 2023)
5-year Journal Impact Factor	0.4	2022, Journal Citation Reports (Clarivate, 2023)
Journal Citation Indicator	0.20	2022, Journal Citation Reports (Clarivate, 2023)
CiteScore	0.7	2022, Scopus (Elsevier B.V., 2023)
SCImago Journal Rank	0.265	2022, SJR (Scimago Lab, 2023; Data Source: Scopus)
Source Normalized Impact per Paper	0.912	2022, CWTS Journal Indicators (CWTS B.V., 2023; Data Source: Scopus)
Mathematical Citation Quotient	0.04

More information about journal rankings

Submit

Submission
Submission is done electronically by emailing both a PDF file and the source files (LaTeX) to the Editorial Office at dma@mi.ras.ru

Your benefits of publishing with us

Wide indexation
Rapid review and publication times
Every article easily discoverable because of Search Engine Optimization (SEO) and comprehensive abstracting and indexing services
Convenient citation tracking via e-mail alert
Secure archiving by De Gruyter and the independent archiving service Portico
Professional sales and marketing activities

Submission process

Submit your paper to dma@mi.ras.ru
Before submitting an article, make sure your text is written according to our Instructions for Authors
The decision on the acceptance is taken after a peer-reviewing procedure
In case of any problems the assistance of editors is provided

Please note

Contributions submitted to this journal must be written in Russian or English language
Only unpublished material can be accepted, and authors may not republish their paper in the same or similar form
The journal makes no page charges
The authors can provide the names and e-mail addresses of up to four potential reviewers
Before submitting your article please have a look at Ethical Guidelines and our Copyright Transfer Agreement
Once your article is accepted you have the option to publish it open access
Our Repository Policy allows you to distribute 30 PDF copies of your published article to colleagues (the PDF has to include the information that it is an author's copy). Please also feel free to distribute the link to the online abstract. Detailed information can be found at Public Repositories tab
If you have any general questions please visit our FAQ for authors

We look forward to receiving your manuscript!

Hybrid Open Access

Please note that authors from institutions with which we have a transformative agreement can publish open access without paying an article processing charge (APC). More information on the eligible institutions and articles can be found under the "Funding and Support" tab here.

Editorial

Andrei M. Zubkov; Moscow

Editorial Board
Valery B. Alekseev; Moscow
Vladimir N. Chubarikov; Moscow
Yuri L. Ershov; Novosibirsk
Grigory I. Ivchenko; Moscow
Yurii S. Kharin; Minsk
Vadim V. Kochergin; Moscow
Yuri I. Medvedev; Moscow
Vladimir G. Mikhailov; Moscow
Yuri L. Pavlov; Petrozavodsk
Boris A. Pogorelov; Moscow
Eduard A. Primenko; Moscow
Vladimir N. Sachkov; Moscow
Dmitry A. Shabanov; Moscow
Vladimir A. Vatutin; Moscow

Advisory Board
Vladimir A. Emelichev; Minsk
Yuri L. Ershov; Novosibirsk
Yuri I. Matiyasevich; St. Petersburg
Lev Ya. Savelyev; Novosibirsk
Sergei A. Stepanov; Moscow

(Deutsch)

Online ISSN: 1569-3929
Print ISSN: 0924-9265
Type: Journal
Language: English
Publisher: De Gruyter
First published: January 1, 1991
Publication Frequency: 6 Issues per Year
Audience: researchers interested in discrete mathematics and its applications