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

Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n -> G, where G is an Abelian group, while the function f:{0,1}^n…

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

Let $p$ be an odd prime, $q=p^e$, $e\ge 1$, and $\mathbb{F} = \mathbb{F_q}$ denote the finite field of $q$ elements. Let $f: \mathbb{F}^2\to \mathbb{F}$ and $g: \mathbb{F}^3\to \mathbb{F}$ be functions, and let $P$ and $L$ be two copies of…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

Let ${\mathcal A}\subset {\mathcal P}(X)$, $\emptyset, X\in {\mathcal A}$, ${\mathcal A}$ being closed under finite intersections. If $\psi={o},\omega,\gamma$, then $\Psi({\mathcal A})$ is the family of those $\psi$-covers ${\mathcal U}$…

In large scale collective decision making, social choice is a normative study of how one ought to design a protocol for reaching consensus. However, in instances where the underlying decision space is too large or complex for ordinal…

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…

Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…

We study the presence of abelian discrete symmetries in globally consistent orientifold compactifications based on rational conformal field theory. We extend previous work [1] by allowing the discrete symmetries to be a linear combination…

We consider the fundamental problems of approximately counting the numbers of edges and triangles in a graph in sublinear time. Previous algorithms for these tasks are significantly more efficient under a promise that the arboricity of the…

In this paper we discuss generic properties of "random subgroups" of a given group G. It turns out that in many groups G (even in most exotic of them) the random subgroups have a simple algebraic structure and they "sit" inside G in a very…

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…

We extend the geometric side of Arthur's non-invariant trace formula for a reductive group $G$ defined over $\mathbb{Q}$ continuously to a natural space $\mathcal{C}(G(\mathbb{A}^1))$ of test functions which are not necessarily compactly…

Preference restrictions have played a significant role in computational social choice. This paper studies a framework that connects preference restrictions with classical graph search paradigms. We model candidates as vertices of a graph…

Let $p$ be an odd prime and $q=p^r$, $r\geq 1$. For positive integers $n$, let ${_n}G_n[\cdots]_q$ denote McCarthy's $p$-adic hypergeometric functions. In this article, we prove an identity expressing a ${_4}G_4[\cdots]_q$ hypergeometric…

Acyclic and cyclic orientations of an undirected graph have been widely studied for their importance: an orientation is acyclic if it assigns a direction to each edge so as to obtain a directed acyclic graph (DAG) with the same vertex set;…

We consider the space of all configurations of finitely many (potentially nested) circles in the plane. We prove that this space is aspherical, and compute the fundamental group of each of its connected components. It turns out these…

This paper proves that for each positive integer $m$, there is a triangle-free planar graph $G$ which is not $(3m+ \lceil \frac m{17} \rceil-1, m)$-choosable.

Given a function $f$ on the vertex set of some graph $G$, a scenery, let a simple random walk run over the graph and produce a sequence of values. Is it possible to, with high probability, reconstruct the scenery $f$ from this random…