The tag has no usage guidance.

learn more… | top users | synonyms

1
vote
1answer
54 views

Counting bounded genus non-isomorphic graphs

What is the number of non-isomorphic $2n$ vertex balanced bipartite graphs of degree at most $d$ and genus $g$? I am most interested in $d\leq3$ and $g=0$.
12
votes
0answers
170 views

Reference request: exponential growth rates of subword-closed languages are integers

For a language $L$ over the finite alphabet $\Sigma$, let $L_n$ denote the set of words in $L$ of length $n$. The word $u$ is a subword of $w$ if $u$ can be obtained from $w$ by deleting letters. The ...
0
votes
1answer
63 views

Reference request: $\chi^{\lambda'}(\sigma) = (-1)^{n-\ell(\sigma)} \chi^\lambda(\sigma),$ for characters of the symmetric group

I'm looking for a text I could cite that explicitly states the following result: for $\chi^\lambda$ the irreducible character of the symmetric group indexed by the partition $\lambda$, and for $\sigma ...
18
votes
2answers
406 views

Counting problems where unlabeled is easier than labeled

I was encouraged to post this question by Jim Propp during a meeting of the Cambridge Combinatorics and Coffee Club. It is a counterpoint to the MathOverflow question "Counting Problems where Labeled ...
2
votes
2answers
157 views

Number of ways of tiling a $2 \times n$ rectangle using rectangles with integer sides

How many ways are there of tiling a $2 \times n$ rectangles using rectangular tiles with positive integer side lengths? I've done some work on this and have found a way of calculating this that's ...
1
vote
1answer
148 views

Is there a nice choice-free argument to count the number of sublattices?

It's a well known fact that the number of index $n$ sublattices of a rank two lattice $\Lambda$ is given by $\sigma_1(n) = \sum_{d\mid n} d$. Here is a proof of this fact: Proof: choosing a basis of ...
0
votes
0answers
55 views

Direct proof that a certain generating function is D-finite

Consider the set $T^{2,3}_n$ of all non-planar rooted trees with $n$ leaves labelled by $1,2,\ldots,n$ where each internal vertex can have two or three children. If we think of the binary / ternary ...
9
votes
0answers
103 views

Cycles of length $2^n - 2$ in the De Bruijn graph

It is well known that the number of (cyclic) De Bruijn sequences is $2^{2^{n-1}-n}$. This number may also be interpreted as the number of cycles of length $2^n$ in the De Bruijn graph of order $n$. ...
14
votes
2answers
234 views

Generating functions for objects with irrational sizes

A problem I'm investigating concerns a combinatorial class in which the 'atoms' have irrational sizes. It seems likely that this is something that has been considered before, but I haven't been able ...
0
votes
1answer
60 views

Finding maximal sets of words at minimum distance

Given an alphabet $Q$ with $k$ letters, consider the set $W(n, k)$ of all words in $Q$ with exactly $n$ letters. In $W(n, k)$ we can define a distance by $dist(x,y) = \#\{ \text{Places where $x$ and ...
3
votes
1answer
115 views

Number of linearly bisected subsets in finite vector space $F_2^n$

We consider the $n$-dimenstional finite vector space $\mathbb{F}_2^{n}$ over the finite field of two elements. For a subset $A\subseteq \mathbb{F}_2^{n}$ of even size $|A|=2m$ and a linear form ...
2
votes
1answer
131 views

Counting elements with certain word length in abelian groups

Given a (finite) abelian group $G = \langle S \mid R \rangle$, has the problem of counting the number of elements which can be expressed as a word (in $S$) of length $\leq k$ been studied? If so, ...
14
votes
1answer
673 views

Are there enough additive permutations?

I am hoping to learn enough about additive permutations to help with a number theory problem. These permutations also have connections to difference sets, orthomorphisms, transversals, and other ...
5
votes
1answer
221 views

Set counting problem with a cap on the intersection between the set and a fixed partition

Fix sets $T_1,\ldots T_m$ as a $k$-partition of $[m\cdot k]=\{1,2,\ldots,m\cdot k\}$, so that $|T_i|=k$ and $|T_i\cap T_\ell|=0$. 1) For any $j\le k$, how many sets $C\subset [m\cdot k]$ are there ...
0
votes
0answers
43 views

Enumeration of simple graphs with given degree distribution/sequence [duplicate]

Is there any exact formula for asymptotic/exact enumeration of simple graphs with given degree sequence? I just found some results about it, but the formula is hold on for some conditions, for example ...
1
vote
1answer
193 views

Counting matrices of special types

How many symmetric and non-symmetric $n\times n$ matrices with $0/1$ entries are there such that every row is distinct and every column is distinct? (I am looking for a proof as well). If only every ...
1
vote
0answers
176 views

Is there a way to simplify this apparently huge characteristic polynomial calculation?

Say I am given the $0/1$ adjacency matrix of an undirected graph. Also I am given a representation $\rho$ of some group $G$ and an orientation has been arbitrarily chosen along each edge. Let ...
1
vote
0answers
73 views

What's the complexity of the one sink directed subgraph isomorphism problem?

I am considering trying a new approach for the subgraph isomorphism problem in my PhD, but it just seems to work well for digraphs of one sink. By working well I mean some promise of not having to ...
0
votes
1answer
301 views

Q re Kaprekar's fixed mapping points

Jens Kruse Andersen in his comment in OEIS's A099009 noticed 3 families of numbers among Kaprekar's fixed mapping points (otherwise known as kernels of the Kaprekar's routine): "Let $d(n)$ denote ...
3
votes
0answers
143 views

Estimating the growth rate of nondeterministic finite automata

Given a nondeterministic finite automaton $\mathcal{A}$ (or a regular expression, or a regular grammar), can we efficiently compute the number $|L_k(\mathcal{A})|$ of accepted words of length $k$? ...
3
votes
1answer
117 views

Stirling numbers of the second kind with maximum part size

The stirling number of the second kind $S(n,k)$ counts the number of partitions of the set $[n]$ into $k$ non-empty parts. I found a definition for the numbers called the $r$-associated stirling ...
3
votes
2answers
221 views

Picking codewords that are close

I posted this question in http://math.stackexchange.com/questions/1142698/picking-codewords-that-are-close a week back. Let $[n,k,d]$ be a linear code over $\Bbb F_q$ with minimum distance $d$ and ...
2
votes
0answers
139 views

Counting number of ways to place bags and marbles inside bags so all bags contain an odd number of marbles

There was a famous trick question posed once in math.stackexchange here. The question can be loosely translated to "Is it possible to place nine marbles into four bags so that each bag has an odd ...
3
votes
1answer
144 views

Enumerating matrices function of ranks

Is there an expression/approximate expression for number of real matrices $M\in\{0,1\}^{n\times n}$ of rank $r\leq n$? Is it known if $M$ is restricted to symmetric/skew-symmetric matrices? Does ...
2
votes
0answers
54 views

Counting labelled graphs according to sets of size 3

In this question we are counting labelled simple graphs. No concept of isomorphism is involved. Let $G(n,e,t)$ be the number of labelled simple graphs with $n$ vertices, $e$ edges, and $t$ sets of ...
2
votes
0answers
117 views

Number of degree $k$ functions [closed]

Given a Boolean function $f:\{0,1\}^n\rightarrow\{0,1\}$, there is a real multivariate multilinear polynomial that is associated with in through interpolation. Example: ...
1
vote
0answers
222 views

Is the stationary distribution of this Markov chain uniform?

First, a little bit of background: Since 2012, Canada has decided to phase out the penny for its coinage system. Product prices may still use arbitrary cents, especially since prices do not typically ...
2
votes
1answer
259 views

Distinct determinants of circulants

If $M$ is a circulant integer matrix of size $n\times n$ whose entries are randomly chosen from $\{0,1\}$ value, how many different determinants does $M$ possibly take value in? For $n=1,2,3,4$, I ...
1
vote
0answers
150 views

Distinct Numbers

Let $x_{ij}\in\{0,1\}$ for ${i=1}$ to ${m}$ and for ${j=1}$ to $n$. How many different values does $$\prod_{i=1}^m\sum_{j=1}^nx_{ij}$$ cover? Is there an $a_{ijk}\in\Bbb R$ (there is a $a_{ijk}\neq0$ ...
1
vote
1answer
118 views

A recurrence relation on Catalan numbers

In the classical problem of bracketing $n$ numbers, I know the reponse is $C_{n-1}$. I find this $$C_{n-1}=\sum_{i=1}^{\left\lfloor\frac{n}{2}\right\rfloor}(-1)^{i+1}\binom{n-i}{i}C_{n-1-i}$$ but I ...
4
votes
1answer
117 views

Determining the number of hamiltonian paths of $K_n-C_n$

I would like to know information regarding the function $h(n)$ where $h(n)$ is the number of hamiltonian cycles the graph $K_n$ has after removing the edges that make up a hamiltonian cycle of $K_n$. ...
1
vote
1answer
57 views

Number of different normalized inner products

Let $u,v\in\{0,1\}^n$ be $0-1$ vectors with $n$ components. Let $I=\langle u,v \rangle$. Clearly $I$ can take values in $\{0,1,\dots,n-1,n\}$. How many different values can $$I'=\frac{\langle u,v ...
1
vote
2answers
227 views

On the number of monic polynomials

Let $a,b,c,d\in\Bbb N$ with $c<b$. Let $N_+(a,b,c,d)$ be the number of monic polynomials $f\in \Bbb Z[x]$of degree $d$ with non-negative coefficients such that $$f(a)=b$$ $$f(0)=c$$ What is the ...
7
votes
1answer
279 views

Number of median graphs?

What is the number of $n$-vertex median graphs? These graphs generalize hypercubes and trees, and have many applications. It seems unlikely that a closed form expression is known, so I would also be ...
2
votes
0answers
175 views

combinatorial rectangles

Consider the set $S$ of all $m\times m$ matrices with $0-1$ entries with exactly $T$ combinatorial rectangles of all $0$s or all $1$s that partition each matrix in a non-overlapping manner. Is there ...
4
votes
2answers
166 views

Number of monomials of deg D where each variables has low degree

Let $D,n,d$ be three positive integers. I am looking for the number of monomials of degree $D$ in $n$ variables where each variable appears with exponent at most $d$. As a result of an application ...
1
vote
1answer
166 views

A generalisation of Narayana-like numbers (walks on the 2D lattice)

I apologize in advance if this question has a trivial answer. I am pretty sure this kind of problem was already studied and I am mostly asking for good references. Given integers $0 < k \le n+1,$ ...
4
votes
0answers
179 views

Counting Problems where Labeled is Known but Unlabeled is Not

Cayley's formula states that the number of labeled trees on $n$ vertices is $n^{n-2}$. There are many nice proofs of this compact formula. To contrast, counting unlabeled trees is considerably ...
6
votes
1answer
283 views

A parity counting problem for subsets over finite fields

Let ${\mathbb F}_p$ be the prime field of $p$ elements and $b$ be an element in ${\mathbb F}_p$. For a subset $T\subseteq {\mathbb F}_p$, define $$Bias(T)=|N_e( {\mathbb F}_p,b)-N_o( {\mathbb ...
7
votes
2answers
366 views

What is the number of noncrossing acyclic digraphs?

A noncrossing graph on $n$ vertices is a graph drawn on $n$ points numbered from $1$ to $n$ in counter-clockwise order on a circle such that the edges lie entirely within the circle and do not cross ...
9
votes
2answers
302 views

Principal Order Ideals in the Weak Bruhat Order

Let $\sigma\in S_n$ be a permutation on $n$ elements, and $\mathrm{Inv}(\sigma):=\{(i,j) : 1\leq i<j\leq n\text{ and }\sigma(i)>\sigma(j)\}$ be its set of inversions. In the weak order on ...
12
votes
1answer
810 views

Two to the power of a triangular number: bijections

The numbers $2^{n(n+1)/2}$ come up in various enumerative contexts. In addition to the trivial example (bit-strings of length $n(n+1)/2$) and the old example of domino tilings of Aztec diamonds ...
3
votes
0answers
123 views

Counting perfect matchings with integrals

Has anyone used the Joni-Rota-Godsil integral formula (see details below) to count perfect matchings of square-grid graphs, Aztec diamond graphs, hexagon-honeycomb graphs, etc.? (Or even just to ...
8
votes
1answer
147 views

Exact enumerations from two-dimensional stat mech models

Exact enumerations corresponding to the dimer model on a hexagonal grid, the dimer model on a square grid, and the four-vertex (aka square ice) model on a square grid are known, namely: lozenge ...
2
votes
2answers
414 views

Enumerating solutions to an underdetermined non-homogenous linear system of Diophantine equations

I have a large, under-determined system (60 equations and 116 unknowns) of linear Diophantine equations. I am aware of the algorithms typically used to solve these systems, which is not my question. ...
5
votes
3answers
501 views

Combinatorial counting with symmetry

Let $A$ be a set of objects where $|A|=n$. We want to count all the possible ways that we can arrange these objects into $n$ bags with exactly $n$ objects in each. We can reuse any object, however, no ...
3
votes
2answers
54 views

Enumerating Tri-vertex transitive polyhedra n > 3 faces

How many unique vertex transitive polyhedra exist where each vertex has 3 incident edges for polyhedra with n (= # faces) > 3 ?
7
votes
1answer
409 views

More asymptotics for trees

This is a follow up to my recent question on the asymptotics of A003238. Lucia gave a fine answer to that question, but as I hinted the 'real' problem I have in mind is slightly different, and I've ...
13
votes
1answer
532 views

Are the asymptotics of A003238 known?

Sequence A003238 of the OEIS counts ``rooted trees with $n$ vertices in which vertices at the same level have the same degree.'' The sequence, $a$, begins 1, 1, 2, 3, 5, 6, 10, 11, 16, ... and it is ...
1
vote
1answer
139 views

Truncated sums of symmetric polynomials; reference request for an algebraic derivation

EDIT: This is a case of being too wrapped up in a formulation ($e_j,p_i,$ and the like) to try something simple. It did not occur to me to pull exp to the outside in the weeks I have stared at this. ...