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.

Dmitriy Bilyk 1, Michael Lacey1, Armen Vagharshakyan1
1School of Mathematics Georgia Institute of Technology Atlanta GA 30332
Abstract:

Let \( h_R \) denote an \( L^\infty \)-normalized Haar function adapted to a dyadic rectangle \( R \subset [0,1]^d \). We show that for all choices of coefficients \( \alpha(R) \in \{\pm 1\} \), we have the following lower bound on the \( L^\infty \)-norms of the sums of such functions, where the sum is over rectangles of a fixed volume:
\[
n^{\eta(d)} \lesssim \Bigg\| \sum_{|R| = 2^{-n}} \alpha(R) h_R(x) \Bigg\|_{L^\infty([0,1]^d)}, \quad \text{for all } \eta(d) < \frac{d-1}{2} + \frac{1}{8d},
\]
where the implied constant is independent of \( n \geq 1 \). The inequality above (without restriction on the coefficients) arises in connection to several areas, such as Probabilities, Approximation, and Discrepancy. With \( \eta(d) = (d-1)/2 \), the inequality above follows from orthogonality, while it is conjectured that the inequality holds with \( \eta(d) = d/2 \). This is known and proved in \( (Talagrand, 1994) \) in the case of \( d = 2 \), and recent papers of the authors \( (Bilyk \text{ and } Lacey, 2006) \), \( (Bilyk \text{ et al., 2007}) \) prove that in higher dimensions one can take \( \eta(d) > (d-1)/2 \), without specifying a particular value of \( \eta \). The restriction \( \alpha_R \in \{\pm 1\} \) allows us to significantly simplify our prior arguments and to find an explicit value of \( \eta(d) \).

Toufik Mansour 1
1Department of Mathematics, University of Haifa, Haifa 31905, Israel
Abstract:

We study the generating functions for pattern-restricted \(k\)-ary words of length \(n\) corresponding to the longest alternating subsequence statistic in which the pattern is any one of the six permutations of length three.

Paul H. Koester1
1Department of Mathematics Indiana University Bloomington, IN 47405 U. S. A.
Abstract:

We extend an argument of Felix Behrend to show that fairly dense subsets of the integers exist which contain no solution to certain systems of linear equations.

Jean-Luc Marichal 1, Michael J. Mossinghoff 2
1Institute of Mathematics University of Luxembourg 162A, avenue de la Fa¨ıencerie L-1511 Luxembourg Luxembourg
2Department of Mathematics Davidson College Davidson, NC 28035-6996 USA
Abstract:

Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes. We also describe some of the history of these problems, dating to Polya’s Ph.D. thesis, and we discuss several applications of these formulas.

Ida Pu1, Alan Gibbons2
1Department of Computin Goldsmiths College, University of London
2Department of Computer Science King’s College, London
Abstract:

Given the number of vertices \( n \), labelled graphs can easily be generated uniformly at random by simply selecting each edge independently with probability \( \frac{1}{2} \). With \( \frac{n(n-1)}{2} \) processors, this takes constant parallel time. In contrast, the problem of uniformly generating unlabelled graphs of size \( n \) is not so straightforward. In this paper, we describe an efficient parallelisation of a classic algorithm of Dixon and Wilf for the uniform generation of unlabelled graphs on \( n \) vertices. The algorithm runs in \( O(\log n) \) expected time on a CREW PRAM using \( n^2 \) processors.

L.R. Thimm1, D.L. Kreher1, P. Merkey1
1Department of Mathematical Sciences Michigan Technological University Houghton MI 49931-1295
Abstract:

We discuss a parallel programming method for solving the maximum clique problem. We use the partitioned shared memory programming language, Unified Parallel \(C\), for the parallel implementation. The problem of load balancing is discussed and the steal stack is used to solve this problem. Implementation details are provided.

I.J. Dejter1, C.C. Lindner2, C.A. Rodger2, M. Meszka3
1Departament of Mathematics University of Puerto Rico Rio Piedras, PR 00931-3355 Puerto Rico
2Department of Mathematics Auburn University Auburn, Alabama 36849-5307 USA
3Faculty of Applied Mathematics AGH University of Science and Technology Krakéw Poland
Abstract:

A \( 4 \)-cycle system of order \( n \) is said to be almost resolvable provided its \( 4 \)-cycles can be partitioned into \( \frac{n-1}{2} \) almost parallel classes (i.e., \( \frac{n-1}{4} \) vertex-disjoint \( 4 \)-cycles) and a half parallel class (i.e., \( \frac{n-1}{8} \) vertex-disjoint \( 4 \)-cycles). We construct an almost resolvable \( 4 \)-cycle system of every order \( n \equiv 1 \pmod{8} \) except \( 9 \) (for which no such system exists) and possibly \( 33, 41, \) and \( 57 \).

Miao Liang1, Beiliang Du2
1Department of Foundation Suzhou Vocational University Suzhou 215104, P.R.China
2Department of Mathematics Suzhou University Suzhou 215006, P.R.China
Abstract:

Splitting balanced incomplete block designs were first formulated by Ogata, Kurosawa, Stinson, and Saido recently in the investigation of authentication codes. This article investigates the existence of splitting balanced incomplete block designs, i.e., \( (v, 2k, \lambda) \)-splitting BIBDs; we give the spectrum of \( (v, 2 \times 4, \lambda) \)-splitting BIBDs.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;