Related papers: The Largest Condorcet Domains on 8 Alternatives
Most differential privacy mechanisms are applied (i.e., composed) numerous times on sensitive data. We study the design of optimal differential privacy mechanisms in the limit of a large number of compositions. As a consequence of the law…
Let $\mathbb{K}$ be a field of characteristic $0$. For each choice of distinct $a_1, \ldots, a_n\in \mathbb{K}$ and distinct $b_1, \ldots, b_n\in \mathbb{K}$, consider the sum $S=\sum_{i=1}^n a_i b_{\pi(i)}$ as $\pi$ ranges over the…
We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…
We study the representation growth of alternating and symmetric groups in positive characteristic and restricted representation growth for the finite groups of Lie type. We show that the the number of representations of dimension at most n…
For a (not necessarily locally convex) topological vector space $\mathcal{X}$ of holomorphic functions in one complex variable, we show that the shift invariant subspace generated by a set of polynomials is $\mathcal{X}$ if and only if…
We construct a degree $12$ homogeneous invariant of the complex reflection group $G_{29}$ (in Shephard-Todd's notation) whose associated surface has 320 singularities of type $A_2$, improving previous records for dodecic surfaces.
Let $n \ge 5$ and $k\ge 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number…
We study the minimal dimension of maximal commutative subalgebras of the matrix algebra $M_n(k)$ over an algebraically closed field. While examples with dimension strictly smaller than n are known for $n \geq 14$, no such examples are known…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…
In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…
A potted graph is a unicyclic graph such that its cycle contains a unique vertex with degree larger than 2. Given a graph $G$, a subset of $V(G)$ is a dissociation set of $G$ if it induces a subgraph with maximum degree at most one. A…
Constant-dimension codes (CDCs) have been investigated for noncoherent error correction in random network coding. The maximum cardinality of CDCs with given minimum distance and how to construct optimal CDCs are both open problems, although…
In this paper, we bound the number of edges of a maximal permutation graph with n vertices. We propose a new method to compute the lower bound by splitting the set of labellings of the edges into six parts, considering one separate problem…
By utilizing a new procedure (the RADIO method) for deriving on-shell 2D, 2N-extended multiplets from off-shell 2D, N-extended multiplets, we derive a new on-shell 2D, N = 8 representation; the ultra-multiplet. By twisting with respect to…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
We present a catalog of 5598 ultra-diffuse galaxy (UDG) candidates with effective radius $r_e > 5.3$ arcsec distributed throughout the southern portion of the DESI Legacy Imaging Survey covering $\sim$ 15000 deg$^2$. The catalog is most…
We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…
We use the domination number of a parametrized random digraph family called proportional-edge proximity catch digraphs (PCDs) for testing multivariate spatial point patterns. This digraph family is based on relative positions of data points…
Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is…