Related papers: A refined Gallai-Edmonds structure theorem for wei…

Structured prediction can be thought of as a simultaneous prediction of multiple labels. This is often done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise and unary potentials. The above is…

The Assmus-Mattson theorem gives a way to identify block designs arising from codes. This result was broadened to matroids and weighted designs. In this work we present a further two-fold generalisation: first from matroids to polymatroids…

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

In this paper we study the genralized q-Euler numbers and polynomials. From our results, we derive some interesting congruences related tothe generalized q-Euler numbers.

We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…

This paper provides a further refinement to the previous response by introducing new structures and algorithms for counting VMPs of common \emph{Edge Requirement} (ER) and hence for counting the perfect matchings.

This paper is the second part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the geometric Ramsey…

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

In this paper, we prove a theorem which adds a new member to the famous G\"oellnitz-Gordon identities. We construct a "new system of recurrence formulas" in order to prove it.

We propose a consistent polynomial-time method for the unseeded node matching problem for networks with smooth underlying structures. Despite widely conjectured by the research community that the structured graph matching problem to be…

The main theorem here is the K-theoretic analogue of the cohomological `stable double component formula' for quiver functions in [Knutson, Miller, and Shimozono, math.AG/0308142]. This K-theoretic version is still in terms of lacing…

A result of Lehrer describes a beautiful relationship between topological and combinatorial data on certain families of varieties with actions of finite reflection groups. His formula relates the cohomology of complex varieties to point…

Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…

Let $\mathbb{R}=(-\infty,\infty)$, and let $Q\in C^1(\mathbb{R}): \mathbb{R}\rightarrow[0,\infty)$ be an even function. We consider the exponential weights $w(x)=e^{-Q(x)}$, $x\in \mathbb{R}$. In this paper we obtain a pointwise convergence…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

This paper is concerned with multivariate refinements of the gamma-positivity of Eulerian polynomials by using the succession and fixed point statistics. Properties of the enumerative polynomials for permutations, signed permutations and…

An analogue of the Gauss-Lucas theorem for polynomials over the algebraic closure $\mathbb C_p$ of the field of $p$-adic numbers is considered.

Let $R = k[x_1,\ldots, x_d]$ denote a standard graded polynomial ring over an algebraically closed field $k$, and let $I \subset R$ be a perfect ideal of codimension $2$ with an $n\times (n-1)$ linear presentation matrix $\phi$. We prove an…

For real polynomials with (sparse) exponents in some fixed set, \[ \Psi(t)=x+y_1t^{k_1}+\ldots +y_L t^{k_L}, \] we analyse the types of root structures that might occur as the coefficients vary. We first establish a stratification of roots…

The aim of this paper is to prove that Markov's theorem on variation of zeros of orthogonal polynomials on the real line [Math. Ann., 27:177-182,1886] remains essentially valid in the case of paraorthogonal polynomials on the unit circle.