Computer Science Small Grants - Scheme 7

Objectives:

To support a visit for collaborative research at the interface of Mathematics and Computer Science either by the grant holder to another institution within the UK or abroad, or by a named mathematician from within the UK or abroad to the home base of the grant holder.

Eligibility:

• Any application for a grant under this scheme must be made by a mathematician based in the UK.
• Priority will be given to early career mathematicians.
• Mathematicians who are not themselves members of the LMS must arrange for an LMS member to support the application.

General rules of the scheme:

• The scheme is intended to support specific projects with named collaborators and not, for example, to contribute to the cost of a sabbatical visit.
• The scheme is intended to fund visits to institutions, not attendance at conferences.
• Applicants are responsible for making all the arrangements for the visit.
• At most one grant will be made per collaboration in any financial year (August - July).  Although the scheme does not preclude repeat funding, preference will normally be given to awards that enable new collaborations; applications for repeat funding of a collaboration funded in the past by Scheme 7 must make a clear case for the added value of this further support.
• Academic and financial reports will be required after the visit.

Value of award:  

The maximum award is £750.

Deadlines and decision timetable:

Applications should be submitted well in advance of the date of the visit. Awards will not be made retrospectively.

Queries regarding applications can be addressed to the Grants Administrator who will be pleased to discuss proposals informally with potential applicants and give advice on the submission of an application.

Grant Administrator:

Kieran O'Connor (email:computerscience@lms.ac.uk, tel: 020 7927 0801).

Application form:

• Computer Science Scheme 7 Online Grant Application Form (you must be logged in to access this form)
• Guidance Notes

Examples of topics for previously awarded grants:

• Word-representability of split graphs
• Aspects of the graph colouring problem
• Further investigation into category theoretic models of variable binders
• Obtaining efficient parameterised algorithms for evaluating the Tutte polynomial of a graph

Other sources of funding:

Information about other funding offered by other organisations can be found here.