# Tagged Questions

Enumerative combinatorics, graph theory, order theory, posets, matroids, designs and other discrete structures. It also includes algebraic, analytic and probabilistic combinatorics.

63 views

170 views

### Is there a characterization of CI-groups of order less than 100?

We know some benefit criterion in articles such as: C‎. ‎H‎. ‎Li‎, ‎On isomorphisms of finite Cayley graphs-a survey‎, ‎Discrete Math.‎, ‎256 (2002) 301-334‎. C‎. ‎H‎. ‎Li‎, ‎Z‎. ‎P‎. ‎Lu‎, ‎P‎. ‎P‎....
115 views

145 views

Let $f(k)$ denote the minimum length of a convex lattice polygon containing exactly $k$ lattice points (including lattice points on the boundary). It is not too hard to show that $k = \frac{1}{4\pi} ... 1answer 291 views ### How long does the slow inefficient algorithm for computing the product in classical Laver tables take? Let$(A_{n},*)$denote the$n$-th classical Laver table. Let$X_{n}$be the set of all finite sequences of elements from$A_{n}$. Define a function$E_{n}:X_{n}\rightarrow X_{n}$by letting$E_{n}((...
Let $a_d\!\in\!{\mathbb R}^+$ with $d\!\in\!{\mathbb Z^+}$ be a sequence such that $$\limsup \sqrt[d]{a_d}=1\,.$$ Define $$F(z)=\sum_{d=1}^{\infty}a_d\,{\text{e}}^{d z}\,.$$ Suppose $F(z)$ admits an ...