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

For every variety of algebras and every algebras in these variety we can consider an algebraic geometry. Algebras may be many sorted (not necessarily one sorted) algebras. A set of sorts is fixed for each variety. This theory can be applied…

We prove an implicit function theorem for functions on infinite-dimensional Banach manifolds, invariant under the (local) action of a finite dimensional Lie group. Motivated by some geometric variational problems, we consider group actions…

We extend the Colombeau algebra of generalized functions to arbitrary (infinitely differentiable, paracompact) n-dimensional manifolds M. Embedding of continuous functions and distributions is achieved with the help of a family of n-forms…

For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…

We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B\'ar\'any, the existence of weak…

We introduce and investigate binary $(k,k)$-designs -- combinatorial structures which are related to binary orthogonal arrays. We derive general linear programming bound and propose as a consequence a universal bound on the minimum possible…

Biconformal gauging of the conformal group has a scale-invariant volume form, permitting a single form of the action to be invariant in any dimension. We display several 2n-dim scale-invariant polynomial actions and a dual action. We solve…

Motivated by the successful application of geometry to proving the Harary-Hill Conjecture for "pseudolinear" drawings of $K_n$, we introduce "pseudospherical" drawings of graphs. A spherical drawing of a graph $G$ is a drawing in the unit…

Secret sharing schemes with optimal and universal communication overheads have been obtained independently by Bitar et al. and Huang et al. However, their constructions require a finite field of size q > n, where n is the number of shares,…

We study a general aggregation problem in which a society has to determine its position on each of several issues, based on the positions of the members of the society on those issues. There is a prescribed set of feasible evaluations,…

This paper develops the geometry of locally bounded rational functions on non-singular real algebraic varieties. First various basic geometric and algebraic results regarding these functions are established in any dimension, culminating…

Let $A$ be a centrally closed prime algebra over a characteristic 0 field $k$, and let $q:A\to A$ be the trace of a $d$-linear map (i.e., $q(x)=M(x,...,x)$ where $M:A^d\to A$ is a $d$-linear map). If $[q(x),x]=0$ for every $x\in A$, then…

We show that the pair given by the power set and by the "Grassmannian"(set of all subgroups) of an arbitrary group behaves very much like the pair given by a projective space and its dual projective space. More precisely, we generalize…

Triangle presentations are combinatorial structures on finite projective geometries which characterize groups acting simply transitively on the vertices of a locally finite building of type $\tilde{\text{A}}_{n-1}$ ($n\ge3$). From a type…

Consider an arbitrary set $S$ and an arbitrary function $f : \mathbb{R} \to S$. We think of the domain of $f$ as representing time, and for each $x \in \mathbb{R}$, we think of $f(x)$ as the state of some system at time $x$. Imagine that,…

An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that deterministically computing an arbitrary function of a…

In rank aggregation, the goal is to combine multiple input rankings into a single output ranking. In this paper, we analyze rank aggregation methods, so-called social welfare functions (SWFs), with respect to strategyproofness, which…

This paper provides a general framework to explore the possibility of agenda manipulation-proof and proper consensus-based preference aggregation rules, so powerfully called in doubt by a disputable if widely shared understanding of Arrow's…

Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…

We study the two inference problems of detecting and recovering an isolated community of \emph{general} structure planted in a random graph. The detection problem is formalized as a hypothesis testing problem, where under the null…