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

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

We consider the possibility of designing an election method that eliminates the incentives for a voter to rank any other candidate equal to or ahead of his or her sincere favorite. We refer to these methods as satisfying the ``Strong…

Consider a convex function that is invariant under an group of transformations. If it has a minimizer, does it also have an invariant minimizer? Variants of this problem appear in nonparametric statistics and in a number of adjacent fields.…

In this paper we will give an explicit construction of the geometric model for a prescribed extension of a function field in several variables over a number field. As a by-product, we will also prove the existence of quasi-galois closed…

Planar functions are of great importance in the constructions of DES-like iterated ciphers, error-correcting codes, signal sets and the area of mathematics. They are defined over finite fields of odd characteristic originally and…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

The increased use of cryptography to protect our personal information makes us want to understand the security of cryptosystems. The security of many cryptosystems relies on solving the discrete logarithm, which is thought to be relatively…

In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…

The purpose of this note is to prove the existence of a randomized mechanism, a social decision scheme (SDS), with desirable fairness, efficiency, and strategyproofness properties unmatched by all known SDSs. In particular, we disprove a…

Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete Riemannian manifold of non-positive sectional curvature or a locally finite tree). Isometric actions of G on M are (by definition) points in the…

Colombeau generalized functions invariant under smooth (additive) one-parameter groups are characterized. This characterization is applied to generalized functions invariant under orthogonal groups of arbitrary signature, such as groups of…

An action of a finite group $G$ is a pair $(S,\hat{G})$, where $S$ is a compact Riemann surface of genus $g \geqslant 2$ and $\hat{G} \leqslant {\rm Aut}(S)$ is isomorphic to $G$. To each action $(S,\hat{G})$ there is associated a signature…

We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…

Let $\precsim$ be a reflexive binary relation on a topological space $(X, \tau )$. A pair $(u,v)$ of continuous real-valued functions on $(X, \tau )$ is said to be a {\em continuous representation} of $\precsim$ if, for all $x,y \in X$,…

Motivated by some algorithmic problems, we give lower bounds on the size of the multiplicative groups containing rational function images of low-dimensional affine subspaces of a finite field~$\mathbb{F}_{q^n}$ considered as a linear space…

Let X = S \oplus G, where S is a countable abelian semigroup and G is a countably infinite abelian group such that {2g : g in G} is infinite. Let pi: X \to G be the projection map defined by pi(s,g) = g for all x =(s,g) in X. Let f:X \to…

This work will appear as a chapter in a forthcoming volume titled `Topics in Probabilistic Graph Theory'. For a given graph $G$, each partition of the vertices has a modularity score, with higher values indicating that the partition better…

This paper gives a first step toward extending the theory of Fourier-Stieltjes algebras from groups to groupoids. If G is a locally compact (second countable) groupoid, we show that B(G), the linear span of the Borel positive definite…

There are a variety of ways to associate directed or undirected graphs to a group. It may be interesting to investigate the relations between the structure of these graphs and characterizing certain properties of the group in terms of some…

We characterize the class of group-strategyproof mechanisms for the single facility location game in any unconstrained strictly convex space. A mechanism is \emph{group-strategyproof}, if no group of agents can misreport so that all its…