bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 9 months |
seen | Jul 27 at 0:39 | |
stats | profile views | 1,247 |
Jul 26 |
reviewed | Leave Open Existence of a map between curves |
Jul 23 |
reviewed | Close Algorithm to generate a (pseudo-) random high-dimensional function |
Jul 23 |
reviewed | Leave Open Can view the connected component of the Picard scheme $\text{Pic}^0(X)$ as a “kernel” of the first Chern class? |
Jul 23 |
comment |
Efficiently counting all paths of length n in a graph with vertex visitation contraints
I would be inclined to use an adjacency matrix where, for each edge leading to a vertex in the bad set, you put a $t$ instead of a 1. Then calculate the $n$-th power of the matrix, and throw out all the terms where the power of $t$ is more than $M$. The sum of the coefficients of lower-order terms describes paths which visit bad vertices at most $M$ times. (I assume $M$ is the bound on the total number of visits to constrained vertices. If you want a bound on each separately, you would need a different variable for each.) |
Jul 22 |
reviewed | No Action Needed Can view the connected component of the Picard scheme $\text{Pic}^0(X)$ as a “kernel” of the first Chern class? |
Jul 21 |
reviewed | Reviewed Given n and q, how to find p so q$\neq$n-th power (mod p)? |
Jul 20 |
reviewed | Leave Open Why is a negatively curved cone surface locally CAT(-1)? |
Jul 10 |
reviewed | Leave Open the true reason of the incompleteness of formal systems |
Jul 9 |
reviewed | Leave Open Classification Theory |
Jul 9 |
reviewed | Leave Open The sign of the mean curvature on convex cones in three dimensions |
Jul 9 |
reviewed | No Action Needed the true reason of the incompleteness of formal systems |
Jul 8 |
comment |
Prove or disprove a claim about covering a polytope by convex polytopes in a certain way
The wikipedia page says that there are many different definitions, and does not settle on one. The following is one of the definitions. Does it capture the polytopes that you want to ask about? "A polytope [is] a set of points that admits a simplicial decomposition. In this definition, a polytope is the union of finitely many simplices, with the additional property that, for any two simplices that have a nonempty intersection, their intersection is a vertex, edge, or higher dimensional face of the two." |
Jul 6 |
comment |
Prove or disprove a claim about covering a polytope by convex polytopes in a certain way
Please clarify what you mean by polytope. In the usage I am familiar with, it means the same thing as "convex polytope", but that can't be what you mean here. |
Jul 6 |
reviewed | Leave Open Correlation between two distance measures on bitstrings |
Jul 6 |
reviewed | Leave Open Bijection between dominant rational maps and morphisms of function fields? |
Jun 29 |
reviewed | Reopen Properties of schemes determined by field valued points |
Jun 29 |
reviewed | Approve Convergence of Fixed-Point Iteration of a dependent map |
Jun 29 |
comment |
About properties of polynomials with common interlacing
(Oops, in my previous comment, I meant to assume $k$ is even, so that $a_1^k$ and $b_n^k$ will predominate.) |
Jun 29 |
comment |
About properties of polynomials with common interlacing
Thanks. Now I am not sure I understand the quantifiers. For suitable $a_i$ and $b_i$, you could have the equation hold for arbitrarily large k: just make $a_1 << 0$ and $b_n >>0$, and then tune their values to make the equation hold (while fixing the other values). |
Jun 27 |
comment |
About properties of polynomials with common interlacing
What does "have a common interlacing" mean? |