Related papers: New 2--critical sets in the abelian 2--group
A graph of order $n$ is $p$-factor-critical, where $p$ is an integer of the same parity as $n$, if the removal of any set of $p$ vertices results in a graph with a perfect matching. 1-factor-critical graphs and 2-factor-critical graphs are…
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive…
We classify elementary abelian 2 subgroups of compact simple Lie groups of adjoint type. This finishes the classification of elementary abelian $p$ subgroups of compact (or linear algebraic) simple groups of adjoint type.
Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis, with the most recent interestingness models exhibiting state of the…
The sum-product algorithm for decoding of binary codes is analyzed for bipartite graphs in which the check nodes all have degree $2$. The algorithm simplifies dramatically and may be expressed using linear algebra. Exact results about the…
This paper presents a comprehensive analysis of critical point sets in two-layer neural networks. To study such complex entities, we introduce the critical embedding operator and critical reduction operator as our tools. Given a critical…
Let A be a subset of an abelian group G. We say that A is sum-free if there do not exist x,y and z in A satisfying x + y = z. We determine, for any G, the cardinality of the largest sum-free subset of G. This equals c(G)|G| where c(G) is a…
This article develops a new theoretical basis for decomposing signals that are formed by the linear superposition of a finite number of modes. Each mode depends nonlinearly upon several parameters; we seek both these parameters and the…
Optimal selection of a subset of items from a given set is a hard problem that requires combinatorial optimization. In this paper, we propose a subset selection algorithm that is trainable with gradient-based methods yet achieves…
We identify a quantum lift of the greedy basis for rank 2 coefficient-free cluster algebras. Our main result is that our construction does not depend on the choice of initial cluster, that it builds all cluster monomials, and that it…
In this paper a greedy algorithm to detect conflict cliques in interval graphs and circular-arc graphs is analyzed. In a graph, a stable set requires that at most one vertex is chosen for each edge. It is equivalent to requiring that at…
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.
In this article, we study the maximal cross number of long zero-sumfree sequences in a finite Abelian group. Regarding this inverse-type problem, we formulate a general conjecture and prove, among other results, that this conjecture holds…
We give two new constructions of almost difference sets. The first is a generic construction of $(q^{2}(q+1),q(q^{2}-1),q(q^{2}-q-1),q^{2}-1)$ almost difference sets in certain groups of order $q^{2}(q+1)$ ($q$ is an odd prime power) having…
Answering an open question from 2007, we construct infinite $k$-crossing-critical families of graphs that contain vertices of any prescribed odd degree, for any sufficiently large~$k$. To answer this question, we introduce several…
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…
We introduce a new random input model for bipartite matching which we call the Random Type Poisson Arrival Model. Just like in the known i.i.d. model (introduced by Feldman et al. 2009), online nodes have types in our model. In contrast to…
Using class field theory one associates to each curve C over a finite field, and each subgroup G of its divisor class group, unramified abelian covers of C whose genus is determined by the index of G. By listing class groups of curves of…
Let G=(V,E) be a graph. A set S is independent if no two vertices from S are adjacent, alpha(G) is the size of a maximum independent set, and core(G) is the intersection of all maximum independent sets. The number d(X)=|X|-|N(X)| is the…
Several concept learning problems can be regarded as special cases of half-space separation in abstract closure systems over finite ground sets. For the typical scenario that the closure system is implicitly given via a closure operator, we…