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

In this paper we study the vertices of indecomposable Specht modules for symmetric groups. For any given indecomposable non-projective Specht module, the main theorem of the article describes a family of p-subgroups contained in its vertex.…

We consider the family of graphs whose vertex set is Z^k where two vertices are connected by an edge when their l\infty-distance is 1. We prove the optimal vertex isoperimetric inequality for this family of graphs. That is, given a positive…

Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's constant of $G$ is the maximum of the lengths of…

Let $G$ be a $(2,m,n)$-group and let $x$ be the number of distinct primes dividing $\chi$, the Euler characteristic of $G$. We prove, first, that, apart from a finite number of known exceptions, a non-abelian simple composition factor $T$…

The enhanced power graph of a finite group $G$ is the simple undirected graph whose vertex set is $G$ and two distinct vertices $x, y$ are adjacent if $x, y \in \langle z \rangle$ for some $z \in G$. An $L( 2,1)$-labeling of graph $\Gamma$…

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

The characterization of the set of quantum correlations is a problem of fundamental importance in quantum information. The question whether every proper (tight) Bell inequality is violated in Quantum theory is an intriguing one in this…

The relation between the boolean functions and Bell inequalities for qubits is analyzed. The connection between the maximal quantum violation of a Bell inequality and the nonlinearity of the corresponding boolean function is discussed. A…

We study finite groups arising from configurations of pairwise skew lines in $\mathbb{P}^3_K$. To such a configuration ${L}$ one associates a group $G_{L}\subset \mathrm{PGL}_2(K)$ acting on each line, and we investigate which finite…

In this note we describe an application of low-high orders in fault-tolerant network design. Baswana et al. [DISC 2015] study the following reachability problem. We are given a flow graph $G = (V, A)$ with start vertex $s$, and a spanning…

We investigate the non-local properties of graph states. To this aim, we derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, for each graph state…

The power graph of a group is the graph whose vertex set is the set of non-trivial elements of group, two elements being adjacent if one is a power of the other. We define a new power graph and study on connectivity, diameter and clique…

Let $\mathbb{F}_{q}$ be a finite field of characteristic $2$ and $O_2^+(\mathbb{F}_{q})$ be the $2$-dimensional orthogonal group of plus type over $\mathbb{F}_{q}$. Consider the standard representation $V$ of $O_2^+(\mathbb{F}_{q})$ and the…

The critical group of a graph is a finite abelian group whose order is the number of spanning forests of the graph. This paper provides three basic structural results on the critical group of a line graph. The first deals with connected…

The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…

Granovetter's weak ties theory is a very important sociological theory according to which a correlation between edge weight and the network's topology should exist. More specifically, the neighbourhood overlap of two nodes connected by an…

The entropy power inequality (EPI) and the Brascamp-Lieb inequality (BLI) are fundamental inequalities concerning the differential entropies of linear transformations of random vectors. The EPI provides lower bounds for the differential…

Despite the great achievements made by neural networks on tasks such as image classification, they are brittle and vulnerable to adversarial example (AE) attacks, which are crafted by adding human-imperceptible perturbations to inputs in…

We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irregular if every vertex has a uniquely labeled subgraph…

Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…