Unanswered Questions
3,137 questions with no upvoted or accepted answers
0
votes
0
answers
153
views
Finding the bottleneck in a chain of functions
I have a problem that involves finding a bottleneck. It appears to me to be a linear bottleneck assignment problem, but recognizing (and solving) such problems is far outside my area of expertise. If ...
- 4,912
0
votes
0
answers
189
views
Packing Icons Onto A screen
You are trying to pack icons onto a screen that is divided into n horizontal rows of uniformly varying size. The rows narrow by a fixed ratio as one goes up the screen from the bottom. Since the icons ...
0
votes
1
answer
340
views
Log associahedra and log noncrossing partitions--raising ops and symmetric function theory for $A_n$ (references)
Where do the following three sets $[LA]$, $[ILA]$, and $[LN]$ of partition polynomials appear in the literature?
There are two sets of partition polynomials, not in the OEIS, that serve as the ...
- 10.2k
0
votes
1
answer
120
views
Recognizing perfect Cayley graphs as tensor products
It is known (and can easily be seen) that a unitary Cayley graph on $n=\prod_ip_i$, ($p_i$ distinct primes) vertices with $n$ square-free can be recognized as the tensor product of the graphs $K_{p_i}$...
CommunityBot
- 1
0
votes
1
answer
425
views
Efficient isomorphic subgraph matching with similarity scores
I'm a computer vision PhD student, and I'm looking for an efficient approximation to the following problem, which could end up helping in image to image matching. Failing that, pointers to relevant ...
- 4,589
0
votes
2
answers
741
views
Number of Dyck paths with k returns and b peaks
The number of Dyck paths from the origin to $(2n,0)$ which touch the $x$-axis $k+2$ times ($k$ internal touches) is given by
$$\frac{k}{2n-k}{2n-k \choose n}.$$
The number of Dyck paths from the ...
- 2,866
-1
votes
1
answer
821
views
How to calculate determinants of such types?
Consider next determinant that we want to expand around $h=1$
\begin{eqnarray}
Z_q \ = \ h^{N N_f} \ \ \left ( \prod_{n=1}^{N} \ \sum_{l_n=0}^{N_f -q} \ h^{2l_n+q} \ \binom{N_f}{l_n} \right ) \ \...
CommunityBot
- 1
-1
votes
1
answer
65
views
A follow-up question in a proof in a paper on complete multipartite graphs
A follow-up question from the following article/paper:
"Proof of a conjecture on distance energy change of complete multipartite graph due to edge deletion"
by Shaowei Sun and Kinkar Chandra ...
- 183k
-1
votes
1
answer
208
views
Perfect Cayley graphs for abelian groups have $\frac{n}{\omega}$ disjoint maximal cliques
Let $G$ be a perfect/ weakly perfect Cayley graph on an abelian group with respect to a symmetric generating set. In addition let the clique number be $\omega$ which divides the order of graph $n$. ...
CommunityBot
- 1
-1
votes
1
answer
96
views
Tuza theorem to prove vizing theorem
The Tuza theorem states that every graph with no cycle congruent to 1 mod $k$ is $k$ colorable. Now, the line graph of any simple graph of maximum degree $d$ is seen to posess the property that it has ...
- 2,079
-1
votes
1
answer
389
views
Odd & even permutations and unit fractions
One more motivated by recent questions of Zhi-Wei Sun.
Let $S_n$ be the group of permutations of $\{1,2,\ldots, n\}$.
Is it true that, for every $n \ge 8$, there is at least one even permutation $\...
CommunityBot
- 1
-1
votes
1
answer
76
views
Transforming random variables for having good property?
For arbitrary functions $A$ and $B$ and independent random variables $X$ and $Y$, assume that
\begin{align}
\Omega&\triangleq \{(x,y): A(x,y)=1\},\\
\Lambda&\triangleq \{x: B(x)=1\}.
\end{...
-1
votes
1
answer
105
views
What type of graph is this? (Edges that are valid / invalid depending on route to node)
I'm trying to model a questionnaire where the flow between questions depends on the answers given in previous questions.
Example. (Node represent questions, edges represent answers).
As you can see ...
- 12.8k
-1
votes
1
answer
418
views
Bins and colored balls
Consider $n$ color balls. We throw them as follows. For a given ball $i$, randomly choose $k$ bins; create $k$ 'copies' of the ball (i.e., of the same color of the ball $i$); throw a 'copy ball' into ...
CommunityBot
- 1
-1
votes
1
answer
200
views
Collecting terms of a linear expression with nested sums and combinatorics in coefficients
I need to collect the $\Pr(\cdot)$ terms of the following expression:
$\sum_{m=3}^{n}\frac{g_{m}\left( \cdot \right) }{\left( \sqrt{\theta \left(
1-\theta \right) }\right) ^{m}}\left[ \sum_{j=2}^{m-1}...
CommunityBot
- 1