Mathematics Problem Archive

Showing 601-650 of 2196 problems (Page 13 of 44)

AMR-022-8024
Open

Research Problems in Function Theory — Problem 8.24

v1.3 research notes

Let the sequence $\{M_k\}^\infty_0$ of positive numbers be such that \[M_0=1\hspace{1cm}\text{ and }\hspace{1cm}\frac{M_{k+j}}{M_kM_j}\geq\begin{pmatr...

L3
Analysis
AMR-022-8025
Open

Research Problems in Function Theory — Problem 8.25

v1.3 research notes

Let $\psi:S^1\to S^1$ be a direction-reversing homeomorphism, and let $A_\psi$ denote the set of functions $f:S^1\to\mathbb{C}$ such that both $f$ and...

L3
Analysis
AMR-022-9001
Open

Research Problems in Function Theory — Problem 9.1

v1.3 research notes

A sequence $\{z_n\}^\infty_1$ in $|z|< 1$ is interpolating for bounded analytic (harmonic) functions if, for each bounded sequence $\{\alpha_n\}^\inft...

L3
Analysis
AMR-022-9002
Open

Research Problems in Function Theory — Problem 9.2

v1.3 research notes

Let $f(z)\in H^\infty$, and let $\{z_n\}$ be a Blaschke sequence \[\sum^\infty_{n=1}(\-|z_n|)<\infty.\] [(a)] ; Does there always exist a Blaschke pro...

L3
Analysis
AMR-022-9003
Open

Research Problems in Function Theory — Problem 9.3

v1.3 research notes

[(a)] ; Suppose that $f, f_1, f_2,\ldots,f_n\in H^\infty$, and \[|f|\leq|f_1|+|f_2|+\ldots+|f_n|.\] Do there necessarily exist $h_1,h_2,\ldots,h_n\in ...

L3
Analysis
AMR-022-9004
Open

Research Problems in Function Theory — Problem 9.4

v1.3 research notes

For each pair of $f,g\in H^\infty$, does there necessarily exist another pair of functions $a,b\in H^\infty$ such that $$ af+gb\neq0,\hspace{1cm}|z|<1...

L3
Analysis
AMR-022-9005
Open

Research Problems in Function Theory — Problem 9.5

v1.3 research notes

Let $K_1, K_2, K_3$ be disjoint closed sets in the extended complex plane, and $C_1, C_2, C_3$ constants. Let $\rho_n(f)$ be the best rational approxi...

L3
Analysis
AMR-022-9006
Open

Research Problems in Function Theory — Problem 9.6

v1.3 research notes

Let $D$ be an open subset of the extended complex plane with non-empty boundary $\partial D$, and let $F$ be a relatively-closed subset of $D$. Let $f...

L3
Analysis
AMR-022-9007
Open

Research Problems in Function Theory — Problem 9.7

v1.3 research notes

Let us call a closed set $E$ in $\mathbb{C}$ a weak Arakelian set if, corresponding to each function $g(z)$ continuous on $E$ and analytic in the inte...

L3
Analysis
AMR-022-9008
Open

Research Problems in Function Theory — Problem 9.8

v1.3 research notes

Let $\gamma$ be a Jordan arc in $\mathbb{C}^n$, $n\geq2$ such that the projections $\gamma_j$ on the complex coordinate planes $j=1,\ldots,n$ have are...

L3
Analysis
AMR-022-9009
Open

Research Problems in Function Theory — Problem 9.9

v1.3 research notes

Does the condition $\sum 1/p_n<\infty$ for positive integers $p_n$ guarantee that the sequences of powers $\{z^{p_n}\}$ fails to span $C(\gamma)$ for ...

L3
Analysis
AMR-022-9010
Open

Research Problems in Function Theory — Problem 9.10

v1.3 research notes

Let $F$ be a closed subest of $\mathbb{R}^n$, $n\geq2$. Call $F$ a set of harmonic approximation if every function continuous on $F$ and harmonic in t...

L3
Analysis
AMR-022-9011
Open

Research Problems in Function Theory — Problem 9.11

v1.3 research notes

Let $D$ be a planar domain. A sequence $\{z_j\}$ of points in $D$ is said to be an interpolating sequence if whenever $\{\alpha_j\}\in\ell^\infty$ the...

L3
Analysis
AMR-022-9012
Open

Research Problems in Function Theory — Problem 9.12

v1.3 research notes

Let $\Gamma\subset\mathbb{C}$ be a Jordan curve of logarithmic capacity $1$, and let $\phi$ be a conformal map from the exterior of $\Gamma$ to the ex...

L3
Analysis
AMR-022-9013
Open

Research Problems in Function Theory — Problem 9.13

v1.3 research notes

Let $K$ be a compact subset of $\mathbb{R}^n$, $n\geq3$. For $\phi\in\mathcal{D}$, let $D(\phi)$ be a least-diameter disc containing $\text{spt }\phi$...

L3
Analysis
AMR-022-9014
Open

Research Problems in Function Theory — Problem 9.14

v1.3 research notes

Let $f$ be continuous on a compact subset $K$ of $\mathbb{C}$. If there exists a sequence $\{f_n\}^\infty_1$ of functions analytic near $K$ for which ...

L3
Analysis
AMR-022-9015
Open

Research Problems in Function Theory — Problem 9.15

v1.3 research notes

Let $f_1$ and $f_2\in H^\infty(\text{unit disc}) = H^\infty$; and let the function $g\in H^\infty$ satisfy the inequality \[|g(z)|\leq|f_1(z)|+|f_2(z)...

L3
Analysis
AMR-022-9016
Open

Research Problems in Function Theory — Problem 9.16

v1.3 research notes

Let $\Gamma$ be a curve of the form \[\{x+iA(x):-\infty<x<\infty\}\] with \[|A(x_1)-A(x_2)|\leq M|x_1-x_2|.\] Let $E$ be a compact subset of $\Gamma$,...

L3
Analysis
AMR-022-9017
Open

Research Problems in Function Theory — Problem 9.17

v1.3 research notes

Let $K$ denote the $\frac{1}{3}$-Cantor set on $\mathbb{R}$; let $E = K\times K$, and let $\Omega=\mathbb{C}^*\setminus E$. Prove the corona theorem f...

L3
Analysis
AMR-023-0005
Open

Kung–Traub conjecture

v1.3 research notes

For an iteration without memory that uses $n$ evaluations of a function or its derivatives per step, is its convergence order always at most $2^{n-1}$...

L4
Analysis
AMR-023-0007
Open

Mean value problem for polynomial critical points

v1.3 research notes

Given a complex polynomial $f$ of degree $d\geq2$ and $z\in\mathbb{C}$, must there be a critical point $c$ of $f$ such that $|f(z)-f(c)|\leq |f'(z)|\,...

L4
Analysis
AMR-023-0013
Open

Flint Hills series

v1.3 research notes

Does the Flint Hills series $\sum_{n=1}^{\infty} 1/(n^3\sin^2 n)$ converge?...

L3
Analysis
AMR-023-0015
Open

Infinitely many Lehmer pairs

v1.3 research notes

Are there infinitely many Lehmer pairs of zeros in the sense used in the theory of the de Bruijn–Newman constant?...

L3
Analysis
AMR-024-0003
Open

Finite-dimensional dynamics for two-dimensional Navier–Stokes

v1.3 research notes

Is the global attractor of the periodically forced two-dimensional Navier–Stokes equations conjugate to a smooth finite-dimensional dynamical system? ...

L4
Partial Differential Equations
AMR-027-0102
Open

10 Lectures and 42 Open Problems — Gaussian singular-value monotonicity

v1.3 research notes

For a $d\times d$ real Gaussian matrix $G_{\mathbb{R}}$ and complex Gaussian matrix $G_{\mathbb{C}}$, both normalized to entry variance $1/d$, define ...

L3
Probability
AMR-027-0103
Open

10 Lectures and 42 Open Problems — Open Problem 1.3

v1.3 research notes

Let ${W}$ denote a symmetric Wigner matrix with i.i.d. entries ${W_{ij}\sim \mathcal{N}(0,1)}$ . Also, given ${B\in\mathbb{R}^{n\times n}}$ symmetric,...

L3
Probability
AMR-027-0203
Open

10 Lectures and 42 Open Problems — The planted clique problem

v1.3 research notes

Is there a polynomial time algorithm that is able to find the largest clique of $G$ (with high probability) for $\omega \ll \sqrt{n}$ ? For example, f...

L3
Graph Theory
AMR-027-0403
Open

10 Lectures and 42 Open Problems — Matrix version of 6 deviations suffice

v1.3 research notes

Prove or disprove: there exists a universal constant $C$ such that, for any choice of $n$ symmetric matrices $H_1,\dots,H_n\in\mathbb{R}^{n\times n}$ ...

L3
Probability
AMR-027-0601
Open

10 Lectures and 42 Open Problems — Random Partial Discrete Fourier Transform

v1.3 research notes

Consider a $A\in\mathbb{C}^{M\times N}$ obtained by sampling random rows of a Discrete Fourier Tranform. How large does $M$ need to be in order for, w...

L3
Computer Science
AMR-027-0602
Open

10 Lectures and 42 Open Problems — Mutually Unbiased Bases

v1.3 research notes

How many mutually unbiased bases are there in 6 dimensions?...

L4
Computer Science
AMR-027-0802
Open

10 Lectures and 42 Open Problems — Sum of Squares approximation ratio for Max-Cut

v1.3 research notes

What is the approximation ratio (or integrality gap) for the Sum-of-Squares (SOS) relaxation of degree 4 for the Max-Cut problem? What about other con...

L3
Computer Science
AMR-027-0803
Open

10 Lectures and 42 Open Problems — The Grothendieck Constant

v1.3 research notes

What is the value of the (real) Grothendieck constant?...

L4
Computer Science
AMR-027-0804
Open

10 Lectures and 42 Open Problems — The Paley Clique Problem

v1.3 research notes

What is the clique number of the Paley graph? Can the the SOS degree 4 analogue of the theta number help upper bound it?...

L3
Computer Science
AMR-028-0001
Open

Betti Posets and the Stanley Depth

v1.3 research notes

The Betti poset of a monomial ideal $I$ determines the Stanley projective dimension of $S/I$ and $I$. More precisely, if $I\subseteq S$ and $I'\subset...

L3
Combinatorics
AMR-029-0001
Open

Achieve global rigidity by pinning nodes

v1.3 research notes

Given a graph $G(V,E)$, find a minimum cardinality set $S \subset V$ of nodes such that adding a complete graph on $S$ renders the graph $G+K_S$ globa...

L3
Combinatorics
AMR-029-0002
Open

Acyclic orientation with connectivity prescriptions

v1.3 research notes

Problem 1. Given an undirected graph $\displaystyle G=(V,E)$ and $\displaystyle s,t\in V,\;\; k\in N$, decide whether the graph has an acyclic orienta...

L3
Combinatorics
AMR-029-0004
Open

Are t-perfect graphs strongly t-perfect?

v1.3 research notes

Is it true that every t-perfect graph is strongly t-perfect?...

L3
Combinatorics
AMR-029-0005
Open

Are there deletion-contraction formulas for the polymatroid Tutte polynomial?

v1.3 research notes

Are there deletion-contraction formulas for the polymatroid Tutte polynomial?...

L3
Combinatorics
AMR-029-0008
Open

Bounded degree matroid basis

v1.3 research notes

Let M be a matroid on ground set V, let H=(V,E) be a hypergraph with maximum degree $\Delta$, let c(v) be the cost of node v, and let $l(e) \leq u(e)$...

L3
Combinatorics
AMR-029-0009
Open

Capacitated packing of k-arborescences

v1.3 research notes

Let D=(V,A) be a digraph with arc-capacities $c : A \to \mathbb{N}$ and a root node $r_0\in V$. A k-arborescence is the arc-disjoint union of k spanni...

L3
Combinatorics
AMR-029-0010
Open

Changing conservative weightings in bipartite graphs

v1.3 research notes

Let G=(A,B;E) be a bipartite graph, and $w:E \to \{1,-1\}$ a conservative weighting. Can we determine in polynomial time the maximum number of positiv...

L3
Combinatorics
AMR-029-0011
Open

Chromatic number of t-perfect graphs

v1.3 research notes

Is every t-perfect graph 4-colourable?...

L3
Combinatorics
AMR-029-0012
Open

Compactness of Kőnig-property

v1.3 research notes

A hypergraph $H=(V,E)$ has the Kőnig-property if there is a set $\mathcal{D}\subseteq E$ of pairwise disjoint hyperedges such that there is a vertex c...

L3
Combinatorics
AMR-029-0013
Open

Compatible Euler-tours

v1.3 research notes

If G is an undirected graph with even degrees then call two closed Eulerian walks compatible if no pair of incident edges occurs consecutively in both...

L3
Combinatorics
AMR-029-0014
Open

Complexity of computing a v-reduced divisor in multigraphs

v1.3 research notes

Is there a polynomial algorithm for computing a $v_0$-reduced divisor equivalent to a given divisor of an undirected multigraph?...

L3
Combinatorics
AMR-029-0015
Open

Complexity of computing the rotor-router action

v1.3 research notes

Let $G$ be an undirected graph. What is the complexity of computing the rotor-router action of the sandpile group of $G$ on the spanning trees of $G$?...

L3
Combinatorics
AMR-029-0016
Open

Complexity of the chip-firing reachability problem for general digraphs

v1.3 research notes

Is the chip-firing reachability problem co-NP-hard for general digraphs?...

L3
Combinatorics
AMR-029-0017
Open

Complexity of the halting problem for Eulerian multigraphs

v1.3 research notes

Is the chip-firing halting problem in P for Eulerian digraphs with multiple edges?...

L3
Combinatorics
AMR-029-0018
Open

Complexity of the halting problem for simple digraphs

v1.3 research notes

Is it true that the chip-firing halting problem for simple digraphs is NP-complete?...

L3
Combinatorics
AMR-029-0019
Open

Conforti-Cornuéjols conjecture on the MFMC property

v1.3 research notes

Is it true that a clutter has the MFMC property if and only if it has the packing property?...

L3
Combinatorics