The following pages link to IPFS content identifier (P1633):
Displaying 50 items.
- On reductions of families of crystalline Galois representations (Q612865) (← links)
- Fuss-Catalan numbers in noncommutative probability (Q612867) (← links)
- Almost proper GIT-stacks and discriminant avoidance (Q612870) (← links)
- A generalization of combinatorial Nullstellensatz (Q612905) (← links)
- Asymptotically optimal pairing strategy for tic-tac-toe with numerous directions (Q612906) (← links)
- Upper and lower bounds for \(F_v(4,4;5)\) (Q612907) (← links)
- A tight lower bound for convexly independent subsets of the Minkowski sums of planar point sets (Q612909) (← links)
- The edge-count criterion for graphic lists (Q612910) (← links)
- Ratio monotonicity of polynomials derived from nondecreasing sequences (Q612912) (← links)
- New upper bounds for the size of permutation codes via linear programming (Q612914) (← links)
- Densities of minor-closed graph families (Q612915) (← links)
- On the distribution of depths in increasing trees (Q612916) (← links)
- Factoring in embedding dimension three numerical semigroups (Q612917) (← links)
- From a 1-rotational RBIBD to a partitioned difference family (Q612918) (← links)
- On ternary square-free circular words (Q612919) (← links)
- Growth rates for subclasses of Av(321) (Q612920) (← links)
- On the most weight \(w\) vectors in a dimension \(k\) binary code (Q612922) (← links)
- On graphs with cyclic defect or excess (Q612923) (← links)
- On tours that contain all edges of a hypergraph (Q612925) (← links)
- Locally restricted compositions. III: Adjacent-part periodic inequalities (Q612926) (← links)
- Large convexly independent subsets of Minkowski sums (Q612927) (← links)
- An interesting new Mahonian permutation statistic (Q612929) (← links)
- Infinitely many hypermaps of a given type and genus (Q612931) (← links)
- The nonexistence of regular near octagons with parameters \((s,t,t_2,t_3)=(2,24,0,8)\) (Q612932) (← links)
- Lower bounds for the average genus of a CF-graph (Q612933) (← links)
- Graph minors and minimum degree (Q612934) (← links)
- Rotor-router aggregation on the layered square lattice (Q612935) (← links)
- A Hessenberg generalization of the Garsia-Procesi basis for the cohomology ring of Springer varieties (Q612936) (← links)
- Symmetric Laman theorems for the groups \(\mathcal C_2\) and \(\mathcal C_s\) (Q612937) (← links)
- A formula for the bivariate map asymptotics constants in terms of the univariate map asymptotics constants (Q612938) (← links)
- Climbing elements in finite Coxeter groups. (Q612940) (← links)
- The diameter of almost Eulerian digraphs (Q612941) (← links)
- Matchings and partial patterns (Q612942) (← links)
- Regular factors of regular graphs from eigenvalues (Q612943) (← links)
- The enumeration of sequences with restrictions on their partial sums (Q612945) (← links)
- Building graphs from colored trees (Q612947) (← links)
- The orderings of bicyclic graphs and connected graphs by algebraic connectivity (Q612948) (← links)
- Cyclic derangements (Q612949) (← links)
- A theory of transformation monoids: combinatorics and representation theory (Q612950) (← links)
- Thin Lehman matrices and their graphs (Q612952) (← links)
- Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables (Q612953) (← links)
- The cover time of deterministic random walks (Q612954) (← links)
- A probabilistic approach to the asymptotics of the length of the longest alternating subsequence (Q612956) (← links)
- \(\lambda \)-factorials of \(n\) (Q612957) (← links)
- An extremal property of Turán graphs (Q612959) (← links)
- Classification of generalized Hadamard matrices \(H(6,3)\) and quaternary Hermitian self-dual codes of length 18 (Q612960) (← links)
- Honeycomb arrays (Q612962) (← links)
- New results about set colorings of graphs (Q612965) (← links)
- On the linearity of higher-dimensional blocking sets (Q612966) (← links)
- On the uniform generation of modular diagrams (Q612967) (← links)
