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
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 23-32
- Published: 31/10/1992
We consider square arrays of numbers \(\{a(n, k)\}\), generalizing the binomial coefficients:
\(a(n, 0) = c_n\), where the \(c_n\) are non-negative real numbers; \(a(0, k) = c_0\), and if \(n, k > 0\), then \(a(n, k) = a(n, k – 1) + a(n – 1, k)\).
We give generating functions and arithmetical relations for these numbers. We show that every row of such an array is eventually log concave, and give a few sufficient conditions for columns to be eventually log concave. We also give a necessary condition for a column to be eventually log concave, and provide examples to show that there exist such arrays in which no column is eventually log concave.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 17-21
- Published: 31/10/1992
In this paper, we obtain some necessary conditions for the existence of balanced arrays (\(B\)-arrays) of strength \(4\) and with two levels, and we state the usefulness of these conditions in obtaining an upper bound on the number of constraints for these B-arrays.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 7-15
- Published: 31/10/1992
It is shown that the circuit polynomial of a graph, when weighted by the number of nodes in the circuits, does not characterize the graph, i.e., non-isomorphic graphs can have the same circuit polynomial. Some general theorems are given for constructing graphs with the same circuit polynomial (cocircuit graphs). Analogous results can be deduced for characteristic polynomials.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 012
- Pages: 3-6
- Published: 31/10/1992
Given \(n\) real numbers whose sum is zero, find one of the numbers that is non-negative. In the model under consideration, an algorithm is allowed to compute \(p\) linear forms in each time step until it knows an answer. We prove that exactly \(\lceil{\log n}/{\log(p+1)} \rceil\) time steps are required. Some connections with parallel group-testing problems are pointed out.
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 343-347
- Published: 30/06/1992
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 337-342
- Published: 30/06/1992
Let \(x_1, x_2, \ldots, x_v\) be commuting indeterminates over the integers. We say an \(v \times v \times v \ldots \times v \) n-dimensional matrix is a proper \(v\)-dimensional orthogonal design of order \(v\) and type \((s_1, s_2, \ldots, s_r)\) (written \(\mathrm{OD}^n(s_1, s_2, \ldots, s_r)\)) on the indeterminates \(x_1, x_2, \ldots, x_r\) if every 2-dimensional axis-normal submatrix is an \(\mathrm{OD} (s_1, s_2, \ldots, s_r)\) of order \(v\) on the indeterminates \(x_1, x_2, \ldots, x_r\). Constructions for proper \(\mathrm{OD}^n(1^2)\) of order 2 and \(\mathrm{OD}^n(1^4)\) of order 4 are given in J. Seberry (1980) and J. Hammer and J. Seberry (1979, 1981a), respectively. This paper contains simple constructions for proper \(\mathrm{OD}^n(1^{2})\), \(\mathrm{OD}^n(1^{4})\), and \(\mathrm{OD}^n(1^{ 8})\) of orders 2, 4, and 8, respectively. Prior to this paper no proper higher dimensional OD on more than 4 indeterminates was known.
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 329-336
- Published: 30/06/1992
Bondy and Fan recently conjectured that if we associate non-negative real weights to the edges of a graph so that the sum of the edge weights is \(W\), then the graph contains a path whose weight is at least \(\frac{2W}{n}\). We prove this conjecture.
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 321-328
- Published: 30/06/1992
Let \(H(V, E)\) be an \(r\)-uniform hypergraph. Let \(A \subset V\) be a subset of vertices and define \(\deg_H(A) = |\{e \in E : A \subset e\}|\).
We say that \(H\) is \((k, m)\)-divisible if for every \(k\)-subset \(A\) of \(V(H)\), \(\deg_H(A) \equiv 0 \pmod{m}\). (We assume that \(1 \leq k < r\)).
Given positive integers \(r \geq 2\), \(k \geq 1\) and \(q\) a prime power, we prove that if \(H\) is an \(r\)-uniform hypergraph and \(|E| > (q-1) \binom{\mid V \mid}{k} \), then \(H\) contains a nontrivial subhypergraph \(F\) which is \((k, q)\)-divisible.
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 319
- Published: 30/06/1992
- Research article
- Full Text
- Ars Combinatoria
- Volume 033
- Pages: 311-317
- Published: 30/06/1992
It is well known that there exist complete \(k\)-caps in \(\mathrm{PG}(3,q)\) with \(k \geq \frac{q^2+q+4}{2}\) and it is still unknown whether or not complete \(k\)-caps of size \(k < \frac{q^2+q+4}{2}\) and \(q\) odd exist. In this paper sufficient conditions for the existence of complete \(k\)-caps in \(\mathrm{PG}(3,q)\), for good \(q \geq 7\) and \(k < \frac{q^2+q+4}{2}\), are established and a class of such complete caps is constructed.




