相关论文: On the Ingleton-Violations in Finite Groups

An interference alignment perspective is used to identify the simplest instances (minimum possible number of edges in the alignment graph, no more than 2 interfering messages at any destination) of index coding problems where non-Shannon…

This paper studies intersections of principal blocks of a finite group with respect to different primes. We first define the block graph of a finite group $G$, whose vertices are the prime divisors of $|G|$ and there is an edge between two…

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

Relations among von Neumann entropies of different parts of an $N$-partite quantum system have direct impact on our understanding of diverse situations ranging from spin systems to quantum coding theory and black holes. Best formulated in…

Proving complexity lower bounds remains a challenging task: we only know how to prove conditional uniform lower bounds and nonuniform lower bounds in restricted circuit models. Williams (STOC 2010) showed how to derive nonuniform lower…

In this paper, we study a family of finitely generated elementary amenable iet-groups. These groups are generated by finitely many rationals iets and rotations. For them, we state criteria for not virtual nilpotency or solvability, and we…

We study the limiting behavior of the discrete spectra associated to the principal congruence subgroups of a reductive group over a number field. While this problem is well understood in the cocompact case (i.e., when the group is…

We provide lower bounds on the number of subgroups of a group $G$ as a function of the primes and exponents appearing in the prime factorization of $|G|$. Using these bounds, we classify all abelian groups with 22 or fewer subgroups, and…

In device-independent quantum information processing Bell inequalities are not only used as detectors of nonlocality, but also as certificates of relevant quantum properties. In order for these certificates to work, one very often needs…

The Z_64-algebra of the genetic code and DNA sequences of length N was recently stated. In order to beat the limits of this structure such as the impossibility of non-coding region analysis in genomes and the impossibility of the insertions…

Packing and covering problems for metric spaces, and graphs in particular, are of essential interest in combinatorics and coding theory. They are formulated in terms of metric balls of vertices. We consider a new problem in graph theory…

A group in which every element commutes with its endomorphic images is called an $E$-group. If $p$ is a prime number, a $p$-group $G$ which is an $E$-group is called a $pE$-group. Every abelian group is obviously an $E$-group. We prove that…

In a quantum network, distant observers sharing physical resources emitted by independent sources can establish strong correlations, which defy any classical explanation in terms of local variables. We discuss the characterization of…

The goal in label-imbalanced and group-sensitive classification is to optimize relevant metrics such as balanced error and equal opportunity. Classical methods, such as weighted cross-entropy, fail when training deep nets to the terminal…

Let $G$ be a finite group, and $\alpha$ a nontrivial character of $G$. The McKay graph ${\mathcal M}(G,\alpha)$ has the irreducible characters of $G$ as vertices, with an edge from $\chi_1$ to $\chi_2$ if $\chi_2$ is a constituent of…

The enhanced power graph $\mathcal{P}_e(G)$ of a group $G$ is a graph with vertex set $G$ and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, we consider the minimum degree, independence number and…

A topological group $(G,\mu)$ from a class $\mathcal G$ of MAP topological abelian groups will be called a {\it Mackey group} in $\mathcal G$ if it has the following property: if $\nu$ is a group topology in $G$ such that $(G,\nu)\in…

This dissertation investigates integer linear programming (ILP) formulation of Bayesian Network structure learning problem. We review the definition and key properties of Bayesian network and explain score metrics used to measure how well…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

In recent work, we developed a method to construct invertible and non-invertible symmetries of finite-group gauge theories as topological domain walls on the lattice. In the present work, we consider abelian and non-abelian finite-group…