Related papers: Beyond Shapiro's problem: from cyclic sums to "gra…
The present article is devoted to the description of further investigations of the author of this article. These investigations (in terms of various representations of real numbers) include the generalized Salem functions and…
In this paper, we address a class of specially structured problems that include speed planning, for mobile robots and robotic manipulators, and dynamic programming. We develop two new numerical procedures, that apply to the general case and…
In this paper, we consider various graphs, namely: power graph, cyclic graph, enhanced power graph and commuting graph, on a finite semigroup $S$. For an arbitrary pair of these four graphs, we classify finite semigroups such that the…
Paper is devoted to extremal problems in geometric function theory of complex variables associated with estimates of functionals defined on the systems of non-overlapping domains. In particular, we strengthen some known result in this…
We prove a necessary optimality condition for isoperimetric problems under nabla-differentiable curves. As a consequence, the recent results of [M.R. Caputo, A unified view of ostensibly disparate isoperimetric variational problems, Appl.…
By means of the mathematical analysis theory, inequality theory, mathematical induction and the dimension reduction method, under the proper hypotheses, we establish the following cyclic inequalities: \[\sum_{i=1}^{n}…
Work in progress concerning alternative formalizations of arithmetic.
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
A survey paper on some recent results on additive problems with prime powers.
We survey some recent work on the geometric Satake of p-adic groups and its applications to some arithmetic problems of Shimura varieties. We reformulate a few constructions appeared in the previous works more conceptually.
A graph-theoretic parameter, in a form of a function, called the extra-factorial sum is discussed. The main results are presented in ref. [1] (Nastou et al., Optim Lett, 10, 1203-1220, 2016) and the reader is strongly advised to study the…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
This note provides new closed forms evaluations of a few classes of exponential sums associated with elliptic curves and hyperelliptic curves.
We study a system of equations arising in the Chern-Simons model on finite graphs. Using the iteration scheme and the upper and lower solutions method, we get existence of solutions in the non-critical case. The critical case is dealt with…
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…
Convolution sums are introduced and special instances of the cyclic convolution on finite sets is examined in more detail. The distributions that emerge are multidimensional generalizations of the Catalan and Narayana numbers. This work…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
As we showed in [3], a geometric inequality can be regarded as an optimization problem. In this paper we find another proof for a Chen's inequality,regarding the Ricci curvature [2] and we improve this inequality in the Lagrangian case.