Related papers: Geometry of anonymous binary social choices that a…

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…

We introduce the $\star_G$ tensor algebra, in which any finite group $G$ defines the multiplication rule, making equivariance an intrinsic algebraic property rather than an architectural constraint. The framework rests on three…

A graph $G$ is \emph{$(a,b)$-choosable} if given any list assignment $L$ with $|L(v)|=a$ for each $v\in V(G)$ there exists a function $\varphi$ such that $\varphi(v)\in L(v)$ and $|\varphi(v)|=b$ for all $v\in V(G)$, and whenever vertices…

The strong fractional choice number of a graph $G$ is the infimum of those real numbers $r$ such that $G$ is $(\lceil rm \rceil, m)$-choosable for every positive integer $m$. The strong fractional choice number of a family ${\cal G}$ of…

Signed graphs are graphs with signed edges. They are commonly used to represent positive and negative relationships in social networks. While balance theory and clusterizable graphs deal with signed graphs to represent social interactions,…

Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…

The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighborhoods of at most $k$ other vertices in the subgraph. The…

Any function can be constructed using a hierarchy of simpler functions through compositions. Such a hierarchy can be characterized by a binary rooted tree. Each node of this tree is associated with a function which takes as inputs two…

Consider pairs of the form (G, N), with G a group and N \normal G, as objects of a category \PG. A morphism (G_1, N_1) \To (G_2, N_2) will be a group homomorphism f : G_1 \To G_2 such that f(N_1) \subset N_2. We introduce a functor Q : \PG…

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…

We describe geometrically the classical and quantum inhomogeneous groups $G_0=(SL(2, \BbbC)\triangleright \BbbC^2)$ and $G_1=(SL(2, \BbbC)\triangleright \BbbC^2)\triangleright \BbbC$ by studying explicitly their shape algebras as a spaces…

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…

We show that all spin groups of non-definite, quinary quadratic forms over a field with characteristic 0 can be represented as 2 by 2 matrices with entries in an associated quaternion algebra. Over local and global fields, we further study…

The metric dimension, $\dim(G)$, and the fractional metric dimension, $\dim_f(G)$, of a graph $G$ have been studied extensively. Let $G$ be a graph with vertex set $V(G)$, and let $d(x,y)$ denote the length of a shortest $x-y$ path in $G$.…

Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…

Binary Parseval frames share many structural properties with real and complex ones. On the other hand, there are subtle differences, for example that the Gramian of a binary Parseval frame is characterized as a symmetric idempotent whose…

We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous, classical…

For a dataset of label-count pairs, an anonymized histogram is the multiset of counts. Anonymized histograms appear in various potentially sensitive contexts such as password-frequency lists, degree distribution in social networks, and…

We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…