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
- https://doi.org/10.61091/ojac-505
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 5, 2010
- Pages: 1-24 (Paper #5)
- Published: 31/01/2010
In this paper, we prove the Tiling implies Spectral part of Fuglede’s cojecture for the three interval case. Then we prove the converse Spectral implies Tiling in the case of three equal intervals and also in the case where the intervals have lengths 1/2, 1/4, 1/4. Next, we consider a set Ω ⊂ R, which is a union of n intervals. If Ω is a spectral set, we prove a structure theorem for the spectrum provided the spectrum is assumed to be contained in some lattice. The method of this proof has some implications on the Spectral implies Tiling part of Fuglede’s conjecture for three intervals. In the final step in the proof, we need a symbolic computation using Mathematica. Finally with one additional assumption we can conclude that the Spectral implies Tiling holds in this case.
- Research article
- https://doi.org/10.61091/ojac-504
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 5, 2010
- Pages: 1-4 (Paper #4)
- Published: 31/01/2010
We show that if \( A \) is a finite subset of an abelian group with additive energy at least \( c|A|^3 \), then there is a set \( \mathcal{L} \subset A \) with \( |\mathcal{L}| = O(c^{-1} \log |A|) \) such that \( |A \cap \mathrm{Span}(\mathcal{L})| = \Omega(c^{1/3} |A|) \).
- Research article
- https://doi.org/10.61091/ojac-503
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 5, 2010
- Pages: 1-4 (Paper #3)
- Published: 31/01/2010
We provide further explanation of the significance of an example in a recent paper of Wolf in the context of the problem of finding large subspaces in sumsets.
- Research article
- https://doi.org/10.61091/ojac-502
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 5, 2010
- Pages: 1-24 (Paper #2)
- Published: 31/01/2010
Lucy Slater used Bailey’s \( {}_6\psi_6 \) summation formula to derive the Bailey pairs she used to construct her famous list of 130 identities of the Rogers-Ramanujan type.
In the present paper, we apply the same techniques to Chu’s \( {}_{10}\psi_{10} \) generalization of Bailey’s formula to produce quite general Bailey pairs. Slater’s Bailey pairs are then recovered as special limiting cases of these more general pairs.
In re-examining Slater’s work, we find that her Bailey pairs are, for the most part, special cases of more general Bailey pairs containing one or more free parameters. Further, we also find new general Bailey pairs (containing one or more free parameters) which are also implied by the \( {}_6\psi_6 \) summation formula.
Slater used the Jacobi triple product identity (sometimes coupled with the quintuple product identity) to derive her infinite products. Here we also use other summation formulae (including special cases of the \( {}_6\psi_6 \) summation formula and Jackson’s \( {}_6\phi_5 \) summation formula) to derive some of our infinite products. We use the new Bailey pairs, and/or the summation methods mentioned above, to give new proofs of some general series-product identities due to Ramanujan, Andrews, and others. We also derive a new general series-product identity, one which may be regarded as a partner to one of the Ramanujan identities. We also find new transformation formulae between basic hypergeometric series, new identities of Rogers-Ramanujan type, and new false theta series identities. Some of these latter are a kind of “hybrid” in that one side of the identity consists of a basic hypergeometric series, while the other side is formed from a theta product multiplied by a false theta series. This type of identity appears to be new.
- Research article
- https://doi.org/10.61091/ojac-501
- Full Text
- Online Journal of Analytic Combinatorics
- Issue 5, 2010
- Pages: 1-27 (Paper #1)
- Published: 31/01/2010
In [Fr2, Skr], Frolov and Skriganov showed that low discrepancy point sets in the multidimensional unit cube \([0,1)^s\) can be obtained from admissible lattices in \( \mathbb{R}^s \). In this paper, we get a similar result for the case of \( (\mathbb{F}_q((x^{-1})))^s \). Then we combine this approach with Halton’s construction of low discrepancy sequences.
- Research article
- Full Text
- Ars Combinatoria
- Volume 094
- Pages: 521-535
- Published: 31/01/2010
The current paper deals with two special matrices \(T_n\) and \(W_n\) related to the Pascal, Vandermonde, and Stirling matrices. As a result, various properties of the entries of \(T_n\) and \(W_n\) are obtained, including the generating functions, recurrence relations, and explicit expressions. Some additional results are also presented.
- Research article
- Full Text
- Ars Combinatoria
- Volume 094
- Pages: 517-520
- Published: 31/01/2010
There are some results and many conjectures with the conclusion that a graph \(G\) contains all trees of given size \(k\). We prove some new results of this type.
- Research article
- Full Text
- Ars Combinatoria
- Volume 094
- Pages: 511-516
- Published: 31/01/2010
In \([3]\), we gave a factorization of the generalized Lah matrix.In this short note, we show its another factorization. From this factorization, several interesting combinatorial identities involving the Fibonacci numbers are obtained.
- Research article
- Full Text
- Ars Combinatoria
- Volume 094
- Pages: 485-510
- Published: 31/01/2010
Let \(\lambda K_v\) be the complete multigraph with \(v\) vertices. Let \(G\) be a finite simple graph. A \(G\)-decomposition of \(K_v\), denoted by \(G-GD_\lambda(v)\), is a pair \((X, \mathcal{B})\) where \(X\) is the vertex set of \(K_v\) and \(\mathcal{B}\) is a collection of subgraphs of \(K_v\), called blocks, such that each block is isomorphic to \(G\) and any two distinct vertices in \(K_v\) are joined in exactly one block of \(\mathcal{B}\). In this paper, nine graphs \(G_i\) with six vertices and nine edges are discussed, and the existence of \(G_i-GD_\lambda(v)\) is given, \(1 \leq i \leq 9\).
- Research article
- Full Text
- Ars Combinatoria
- Volume 094
- Pages: 477-483
- Published: 31/01/2010
Let \(G = (V, E)\) be a graph. A set \(S \subseteq V\) is a restrained dominating set if every vertex not in \(S\) is adjacent to a vertex in \(S\) and to a vertex in \(V – S\). The restrained domination number of \(G\), denoted by \(\gamma_r(G)\), is the smallest cardinality of a restrained dominating set of \(G\). It is known that if \(T\) is a tree of order \(n\), then \(\gamma_r(T) \geq \left\lceil \frac{n+2}{3} \right\rceil\). In this note, we provide a simple constructive characterization of the extremal trees \(T\) of order \(n\) achieving this lower bound.




