Related papers: New 2--critical sets in the abelian 2--group
Motivated by modern applications such as computerized adaptive testing, sequential rank aggregation, and heterogeneous data source selection, we study the problem of active sequential estimation, which involves adaptively selecting…
In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$, extending earlier work by the author and Criel Merino. In particular, we show that the critical group of such…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocorrelation values of such sequences have been determined in…
Finding a maximum-weight matching is a classical and well-studied problem in computer science, solvable in cubic time in general graphs. We consider the specialization called assignment problem where the input is a bipartite graph, and…
Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…
Several recent deep neural networks experiments leverage the generalist-specialist paradigm for classification. However, no formal study compared the performance of different clustering algorithms for class assignment. In this paper we…
A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing…
We show that any connected Cayley graph $\Gamma$ on an Abelian group of order $2n$ and degree $\tilde{\Omega}(\log n)$ has at most $2^{n+1}(1 + o(1))$ independent sets. This bound is tight up to to the $o(1)$ term when $\Gamma$ is…
Let $p$ be an odd prime, and let $S$ be a $p$-group with a unique elementary abelian subgroup $A$ of index $p$. We classify the simple fusion systems over all such groups $S$ in which $A$ is essential. The resulting list, which depends on…
In this paper we describe an algorithm for finding the nilpotency class, and the upper central series of the maximal normal p-subgroup N(G) of the automorphism group, Aut(G) of a bounded (or finite) abelian p-group G. This is the first part…
We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…
We use techniques from the theory of electrical networks to give nearly tight bounds for the transience class of the Abelian sandpile model on the two-dimensional grid up to polylogarithmic factors. The Abelian sandpile model is a discrete…
This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural…
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vertex is the winner. The game fits into the scheme of several…
We describe a canonical spanning tree of the ridge graph of a subword complex on a finite Coxeter group. It is based on properties of greedy facets in subword complexes, defined and studied in this paper. Searching this tree yields an…
In this report paper we first present a report of the Advanced Machine Learning Course Project on the provided data set and then present a novel heuristic algorithm for exact Bayesian network (BN) structure discovery that uses decomposable…
Let $G_1\sq G_2$ denote the graph obtained from $G_1+G_2$ by adding new edges from each vertex of $G_1$ to every vertex of $G_2$. In this paper, the critical groups of the graphs $K_m\sq P_n$$(n\geq4)$ and $P_m\sq P_n$$(m\geq4,n\geq5)$ are…
Collective communications are ubiquitous in parallel applications. We present two new algorithms for performing a reduction. The operation associated with our reduction needs to be associative and commutative. The two algorithms are…
We address the problems of minimizing and of maximizing the spectral radius overa compact family of non-negative matrices. Those problems being hard in generalcan be efficiently solved for some special families. We consider the so-called…