Utilitas Algorithmica (UA)
ISSN: xxxx-xxxx (print)
Utilitas Algorithmica (UA) is a premier, open-access international journal dedicated to advancing algorithmic research and its applications. Launched to drive innovation in computer science, UA publishes high-impact theoretical and experimental papers addressing real-world computational challenges. The journal underscores the vital role of efficient algorithm design in navigating the growing complexity of modern applications. Spanning domains such as parallel computing, computational geometry, artificial intelligence, and data structures, UA is a leading venue for groundbreaking algorithmic studies.
- Research article
- Full Text
- Ars Combinatoria
- Volume 130
- Pages: 55-66
- Published: 31/01/2017
We explore new combinatorial properties of overpartitions, which are natural generalizations of integer partitions. Building on recent work, we state general combinatorial identities between standard partition, overpartition, and regular partition functions. We provide both generating function and bijective proofs. We also prove congruences for certain overpartition functions combinatorially.
- Research article
- Full Text
- Ars Combinatoria
- Volume 130
- Pages: 43-54
- Published: 31/01/2017
Let \(G\) be a simple graph on \(n\) vertices. The Laplacian Estrada index of \(G\) is defined as \(LEE(G) = \sum_{i=1}^{n} e^{\mu_i}\), where \(\mu_1, \mu_2, \dots, \mu_n\) are the Laplacian eigenvalues of \(G\). In this paper, threshold graphs on \(n\) vertices and \(m\) edges having maximal and minimal Laplacian Estrada index are determined, respectively.
- Research article
- Full Text
- Ars Combinatoria
- Volume 130
- Pages: 29-41
- Published: 31/01/2017
In this paper, formulas of the resistance distance for the arbitrary two-vertex resistance of \(G\), \(H = G_1 \boxdot G_2\) and \(G_1 \boxminus G_2\) in the electrical networks are obtained in a much simpler way. Furthermore, \(K_f(G_1 \boxdot G_2)\) and \(K_f(G_1 \boxminus G_2)\) can be expressed as a combination of \(K_f(G_1)\) and \(K_f(G_2)\).
- Research article
- Full Text
- Ars Combinatoria
- Volume 130
- Pages: 17-27
- Published: 31/01/2017
Networks are important structures and appear in many different applications and settings. The vulnerability value of a communication network shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown. Centrality parameters play an important role in the field of network analysis. Numerous studies have proposed and analyzed several centrality measures. These concepts measure the importance of a node’s position in a network. In this paper, vertex residual closeness \((VRC)\) and normalized vertex residual closeness \((NVRC)\) of some splitting networks modeled by splitting graphs are obtained.
- Research article
- Full Text
- Ars Combinatoria
- Volume 130
- Pages: 3-16
- Published: 31/01/2017
Let \(T\) be an isosceles right triangle and let \(S_1, S_2, S_3, \dots\) be the homothetic copies of a square \(S\). In this paper, we consider the parallel covering and packing of \(T\) with the sequence \(\{S_n\}\) of squares.
- Research article
- https://doi.org/10.61091/ojac-12sp1
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 12, 2017
- Pages: 1-7 (Paper #1)
- Published: 31/12/2017
In this paper, we first give a new \( q \)-analogue of the Lah numbers. Then we show the irreducible factors of the \( q \)-Lah numbers over \( \mathbb{Z} \).
- Research article
- https://doi.org/10.61091/ojac-1211
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 12, 2017
- Pages: 1-16 (Paper #11)
- Published: 31/12/2017
Let \( A \) and \( B \) be additive sets of \( \mathbb{Z}_{2k} \), where \( A \) has cardinality \( k \) and \( B = v \cdot C A \) with \( v \in \mathbb{Z}_{2k}^\times \). In this note, some bounds for the cardinality of \( A + B \) are obtained using four different approaches. We also prove that in a special case, the bound is not sharp and we can recover the whole group as a sumset.
- Research article
- https://doi.org/10.61091/ojac-1210
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 12, 2017
- Pages: 1-16 (Paper #10)
- Published: 31/12/2017
In this paper, we analyze the asymptotic number \( I(m,n) \) of involutions of large size \( n \) with \( m \) singletons. We consider a central region and a non-central region. In the range \( m = n – n^\alpha \), \( 0 < \alpha < 1 \), we analyze the dependence of \( I(m,n) \) on \( \alpha \). This paper fits within the framework of Analytic Combinatorics.
- Research article
- https://doi.org/10.61091/ojac-1209
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 12, 2017
- Pages: 1-12 (Paper #9)
- Published: 31/12/2017
An inverse-conjugate composition of a positive integer \(m\) is an ordered partition of \(m\) whose conjugate coincides with its reversal. In this paper, we consider inverse-conjugate compositions in which the part sizes do not exceed a given integer \(k\). It is proved that the number of such inverse-conjugate compositions of \(2n – 1\) is equal to \(2F_n^{(k-1)}\), where \(F_n^{(k)}\) is a Fibonacci \(k\)-step number. We also give several connections with other types of compositions, and obtain some analogues of classical combinatorial identities.
- Research article
- https://doi.org/10.61091/ojac-1208
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 12, 2017
- Pages: 1-11 (Paper #8)
- Published: 31/12/2017
S. Ekhad and D. Zeilberger recently proved that the multivariate generating function for the number of simple singular vector tuples of a generic \(m_1 \times · · · \times m_d\) tensor has an elegant rational form involving elementary symmetric functions, and provided a partial conjecture for the asymptotic behavior of the cubical case \(m_1 = · · · = m_d\). We prove this conjecture and further identify completely the dominant asymptotic term, including the multiplicative constant. Finally, we use the method of differential approximants to conjecture that the subdominant connective constant effect observed by Ekhad and Zeilberger for a particular case in fact occurs more generally




