Function classes are collections of Boolean functions on a finite set, which are fundamental objects of study in theoretical computer science. We study algebraic properties of ideals associated to function classes previously defined by the third author. We consider the broad family of intersection-closed function classes, and describe cellular free resolutions of their ideals by order complexes of

The Billera-Holmes-Vogtmann (BHV) space of weighted trees can be embedded in Euclidean space, but the extrinsic Euclidean mean often lies outside of treespace. Sturm showed that the intrinsic Fréchet mean exists and is unique in treespace. This Fréchet mean can be approximated with an iterative algorithm, but bounds on the convergence of the algorithm are not known, and there is no other known polynomial

In this article, we study the Bruhat-Chevalley-Renner order on the complex symplectic monoid MSpn. After showing that this order is completely determined by the Bruhat-Chevalley-Renner order on the linear algebraic monoid of n×n matrices Mn, we focus on the Borel submonoid of MSpn. By using this submonoid, we introduce a new set of type B set partitions. We determine their count by using the “folding”

Given any numeration system, we call carry propagation at a number N the number of digits that are changed when going from the representation of N to the one of N+1, and amortized carry propagation the limit of the mean of the carry propagations at the first N integers, when N tends to infinity, if this limit exists. In the case of the usual base p numeration system, it can be shown that the limit

We address the classical factorization problem of a one dimensional Schrödinger operator −∂2+u−λ, for a stationary potential u of the KdV hierarchy but, in this occasion, a “parameter” λ is considered. Inspired by the more effective approach of Gesztesy and Holden to the “direct” spectral problem in [14], we give a symbolic algorithm by means of differential elimination tools to achieve the aimed factorization

Let A be a Weyl arrangement. We introduce and study the notion of A-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of A. This polynomial together with shift operator describes how the characteristic quasi-polynomial of a new class of arrangements containing ideal subarrangements of A can be expressed in terms of the Ehrhart quasi-polynomial of the fundamental alcove

We show that polynomials associated with automatic sequences satisfy a certain recurrence relation when evaluated at a root of unity. This generalizes a result of Brillhart, Lomont and Morton on the Rudin–Shapiro polynomials. We study the order of such a relation and the integrality of its coefficients.

Consider a cyclically ordered collection of r equi-numerous “agent” sets with strict preferences of every agent over the agents from the next set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union of r-long cycles, one agent from each set per cycle, such that there are no destabilizing r-long cycles, i.e. cycles in which every agent strictly prefers its successor

Let r be a positive integer and let Gn be the reflection group of n×n monomial matrices whose entries are rth complex roots of unity and let k≤n. We define and study two new graded quotients Rn,k and Sn,k of the polynomial ring C[x1,…,xn] in n variables. When k=n, both of these quotients coincide with the classical coinvariant algebra attached to Gn. The algebraic properties of our quotients are governed

We consider polygonal tilings of certain regions and use these to give intuitive definitions of tiling-based perimeter and area. We apply these definitions to rhombic tilings of Elnitsky polygons, computing sharp bounds and average values for perimeter tiles in convex centrally symmetric 2n-gons. These bounds and values have implications for the combinatorics of reduced decompositions of permutations

The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well-known binary perfect phylogeny. Here, we focus on the notion of (binary) persistent characters, i.e. characters that can be realized on a phylogenetic tree by at most one 0→1 transition followed by at most one 1→0 transition in the tree

Given a sequence of s-uniform hypergraphs {Hn}n≥1, denote by Tp(Hn) the number of edges in the random induced hypergraph obtained by including every vertex in Hn independently with probability p∈(0,1). Recent advances in the large deviations of low complexity non-linear functions of independent Bernoulli variables can be used to show that tail probabilities of Tp(Hn) are precisely approximated by the

We study the central hyperplane arrangement whose hyperplanes are the vanishing loci of the weights of the first and the second fundamental representations of gln restricted to the dual fundamental Weyl chamber. We obtain generating functions that count flats and faces of a given dimension. This counting is interpreted in physics as the enumeration of the phases of the Coulomb and mixed Coulomb-Higgs

We study the polyhedral geometry of the hyperplanes orthogonal to the weights of the first and the second fundamental representations of sln inside the dual fundamental Weyl chamber. We obtain generating functions that enumerate the flats and the faces of a fixed dimension. In addition, we describe the extreme rays of the incidence geometry and classify simplicial faces. From the perspective of supersymmetric

Classical Gončarov polynomials arose in numerical analysis as a basis for the solutions of the Gončarov interpolation problem. These polynomials provide a natural algebraic tool in the enumerative theory of parking functions. By replacing the differentiation operator with a delta operator and using the theory of finite operator calculus, Lorentz, Tringali and Yan introduced the sequence of generalized

We find minimal and maximal length of intersections of lines at a fixed distance to the origin with the cross-polytope. We also find maximal volume non-central sections of the cross-polytope by hyperplanes which are at a fixed large distance to the origin and minimal volume sections by symmetric slabs of a large fixed width. This parallels recent results about non-central sections of the cube due to

Let X1,X2,…,Xn be independent random variables, each uniformly distributed on the interval (0,1). We compute the expectation of (X1X2⋯Xn)k⋅∏1≤i

We establish an affine invariant version of the sharp L2 Sobolev trace inequality which contains a recent result of De Nápoli et al. [9] as special case. We also give a notion of the so-called affine fractional energy for functions in the fractional homogeneous Sobolev space H˙s(Rn) for s∈(0,1) and n>2s. We investigate some properties of this affine fractional energy such as a representation formula

We investigate two Stieltjes continued fractions given by the paperfolding sequence and the Rudin-Shapiro sequence. By explicitly describing certain subsequences of the convergents Pn(x)/Qn(x) modulo 4, we give the formal power series expansions (modulo 4) of these two continued fractions and prove that they are congruent modulo 4 to algebraic series in Z[[x]]. Therefore, the coefficient sequences

Gessel and Zeilberger generalized the reflection principle to handle walks confined to Weyl chambers, under some restrictions on the allowable steps. For some models that are invariant under the Weyl group action, they express the counting function for the walks with fixed starting point and ending point as a constant term in the Taylor series expansion of a rational function. Here we focus on the

Blasiak verified a conjecture of White for graphic matroids by showing that the toric ideal of a graphic matroid is generated by quadrics. In this paper, we extend this result to frame matroids satisfying a linearity condition. Such classes of frame matroids include graphic matroids, bicircular matroids, signed graphic matroids, and more generally frame matroids obtained from group-labelled graphs

We propose an algebraic framework generalizing several variants of Prony's method and explaining their relations. This includes Hankel and Toeplitz variants of Prony's method for the decomposition of multivariate exponential sums, polynomials (w.r.t. the monomial and Chebyshev bases), Gaußian sums, spherical harmonic sums, taking also into account whether they have their support on an algebraic set

In 2004, Ehrenfeucht, Harju, and Rozenberg showed that any graph on a vertex set V can be obtained from a complete graph on V via a sequence of the operations of complementation, switching edges and non-edges at a vertex, and local complementation. The last operation involves taking the complement in the neighbourhood of a vertex. In this paper, we consider natural generalizations of these operations

We consider a finite field model of the X-ray transform that integrates functions along lines in dimension 3, within the context of finite fields. The admissibility problem asks for minimal sets of lines for which the restricted transform is invertible. Graph theoretic conditions are known which characterize admissible collections of lines, and these have been counted using a brute force computer program

Let A be a set of vertices in a graph G. An A-path is a non-trivial path in G that has both of its ends in A. In 1961, Gallai showed that, for any integer k, either G has k disjoint A-paths or there is a set of at most 2(k−1) vertices that hits all of the A-paths. There have been a number of extensions of this result; in each of these extensions we want to find a maximum collection of disjoint “allowable”

We give a new proof of Rado's Theorem that, given a partition (X1,…,Xn) of the ground set of a matroid M, there is an independent set of M containing exactly one element from each of the sets (X1,…,Xn) if and only if for each subset J of {1,…,n} we have r(∪j∈JXj)≥|J|.

A minor-closed class of matroids is (strongly) fractal if the number of n-element matroids in the class is dominated by the number of n-element excluded minors. We conjecture that when K is an infinite field, the class of K-representable matroids is strongly fractal. We prove that the class of sparse paving matroids with at most k circuit-hyperplanes is a strongly fractal class when k is at least three

For a graph G with a positive clustering coefficient C, it is proved that for any positive constant ϵ, the vertex set of G can be partitioned into finitely many parts, say S1,S2,…,Sm, such that all but an ϵ fraction of the triangles in G are contained in the projections of tripartite subgraphs induced by (Si,Sj,Sk) which are ϵ-Δ-regular, where the size m of the partition depends only on ϵ and C. The

What is the product of all odious integers, i.e., of all integers whose binary expansion contains an odd number of 1's? Or more precisely, how to define a product of these integers which is not infinite, but still has a “reasonable” definition? We will answer this question by proving that this product is equal to π1/42φe−γ, where γ and φ are respectively the Euler-Mascheroni and the Flajolet-Martin

In three influential papers in the 1980s and early 1990s, Joe Kung laid the foundations for extremal matroid theory which he envisaged as finding the growth rate of certain classes of matroids along with a characterisation of the extremal matroids in each such class. At the time, he was particularly interested in the minor-closed classes of binary matroids obtained by excluding the cycle matroids of

We introduce techniques for deriving closed form generating functions for enumerating permutations with restricted positions keeping track of various statistics. The method involves evaluating permanents with variables as entries. These are applied to determine the sample size required for a novel sequential importance sampling algorithm for generating random perfect matchings in classes of bipartite

The polynomials ψk(r,x) were introduced by Ramanujan. Berndt, Evans and Wilson obtained a recurrence relation for ψk(r,x). Shor introduced polynomials related to improper edges of a rooted tree, leading to a refinement of Cayley's formula. Zeng realized that the polynomials of Ramanujan coincide with the polynomials of Shor, and that the recurrence relation of Shor coincides with the recurrence relation

Vf-safe delta-matroids have the desirable property of behaving well under certain duality operations. Several important classes of delta-matroids are known to be vf-safe, including the class of ribbon-graphic delta-matroids, which is related to the class of ribbon graphs or embedded graphs in the same way that graphic matroids correspond to graphs. In this paper, we characterize vf-safe delta-matroids

In [30], Tardos studied special delta-matroids obtained from sequences of Higgs lifts; these are the full Higgs lift delta-matroids that we treat and around which all of our results revolve. We give an excluded-minor characterization of the class of full Higgs lift delta-matroids within the class of all delta-matroids, and we give similar characterizations of two other minor-closed classes of delta-matroids

D-finite (or holonomic) functions satisfy linear differential equations with polynomial coefficients. They form a large class of functions that appear in many applications in Mathematics or Physics. It is well-known that these functions are closed under certain operations and these closure properties can be executed algorithmically. Recently, the notion of D-finite functions has been generalized to

We study a class of determinantal ideals that are related to conditional independence (CI) statements with hidden variables. Such CI statements correspond to determinantal conditions on a matrix whose entries are probabilities of events involving the observed random variables. We focus on an example that generalizes the CI ideals of the intersection axiom. In this example, the minimal primes are again

The m-Tamari lattice of F. Bergeron is an analogue of the classical Tamari order defined on objects counted by Fuss-Catalan numbers, such as m-Dyck paths or (m+1)-ary trees. On another hand, the Tamari order is related to the product in the Loday-Ronco Hopf algebra of planar binary trees. We introduce new combinatorial Hopf algebras based on (m+1)-ary trees, whose structure is described by the m-Tamari

We study the concentration of the norm of a random vector Y uniformly sampled in the centered zero cell of two types of stationary and isotropic random mosaics in Rn for large dimension n. For a stationary and isotropic Poisson-Voronoi mosaic, Y has a radial and log-concave distribution, implying that |Y|/E(|Y|2)12 approaches one for large n. Assuming the cell intensity of the random mosaic scales

We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations (AOΔEs). For an autonomous first-order AOΔE, we give an upper bound for the degrees of its rational solutions, and thus derive a complete algorithm for computing corresponding rational solutions.

We derive the connection relations between three q-Taylor polynomial bases. We also derive the connection relations between two of these bases and the continuous q-Hermite polynomials, as well as several new generating functions for the continuous q-Hermite polynomials. Our results also lead to some new integral evaluations. Using one of these connection relations, we give a new proof of a general

Crofton's intersection formula states that the (n−j)th intrinsic volume of a compact convex set in Rn can be obtained as an invariant integral of the (k−j)th intrinsic volume of sections with k-planes. This paper discusses the question if the (k−j)th intrinsic volume can be replaced by other functionals, that is, if the measurement function in Crofton's formula is unique. The answer is negative: we

The Loomis-Whitney inequality states that the volume of a convex body is bounded by the product of volumes of its projections onto orthogonal hyperplanes. We provide an extension of both this fact and a generalization of this fact due to Ball to the context of q−concave, 1q−homogeneous measures.

We study the longest increasing subsequence problem for random permutations avoiding the pattern 312 and another pattern τ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average length of the longest increasing subsequences for such permutation classes specifically when the pattern τ is monotone increasing or decreasing, or any pattern of length four

We establish a q-analogue of Sun–Zhao's congruence on harmonic sums. Based on this q-congruence and a q-series identity, we prove a congruence conjecture on sums of central q-binomial coefficients, which was recently proposed by Guo. We also deduce a q-analogue of a congruence due to Apagodu and Zeilberger from Guo's q-congruence.

Let Ω be a bounded convex domain in Rn (n≥2). In this work, we prove that if there exists an integrable function f such that it's Radon transform over (n−1)-dimensional hyperplanes intersecting the domain Ω is a function G depending on the distance to the nearest parallel supporting hyperplane to Ω, then Ω is a ball and f is radial depending on certain assumptions on G. As a consequence we show that

Our main contribution here is the discovery of a new family of standard Young tableaux Tnk which are in bijection with the family Dm,n of Rational Dyck paths for m=k×n±1 (the so called “Fuss” case). Using this family we give a new proof of the invertibility of the sweep map in the Fuss case by means of a very simple explicit algorithm. This new algorithm has running time O(m+n). It is independent of

For n≥3, let r=r(n)≥3 be an integer. A hypergraph is r-uniform if each edge is a set of r vertices, and is said to be linear if two edges intersect in at most one vertex. In this paper, the number of linear r-uniform hypergraphs on n→∞ vertices is determined asymptotically when the number of edges is m(n)=o(r−3n3/2). As one application, we find the probability of linearity for the independent-edge

We derive a formula expressing the joint distribution of the cyclic valley number and excedance number statistics over a fixed conjugacy class of the symmetric group in terms of Eulerian polynomials. Our proof uses a slight extension of Sun and Wang's cyclic valley-hopping action as well as a formula of Brenti. Along the way, we give a new proof for the γ-positivity of the excedance number distribution

In this paper, by applying a range of classic summation and transformation formulas for basic hypergeometric series, we obtain a three-term identity for partial theta functions. It extends the Andrews–Warnaar partial theta function identity, and also unifies several results on partial theta functions due to Ramanujan, Kim and Lovejoy. We also establish a two-term version of the extension, which can

For any quiver mutation sequence, we define a pair of matrices that describe a fixed point equation of a cluster transformation determined from the mutation sequence. We give an explicit relationship between this pair of matrices and the Jacobian matrix of the cluster transformation. Furthermore, we show that this relationship reduces to a relationship between the pair of matrices and the C-matrix

Given an edge-weighted tree T with n leaves, sample the leaves uniformly at random without replacement and let Wk , 2 ≤ k ≤ n, be the length of the subtree spanned by the first k leaves. We consider the question, "Can T be identified (up to isomorphism) by the joint probability distribution of the random vector (W2, …, Wn )?" We show that if T is known a priori to belong to one of various families

In mathematical phylogenetics, given a rooted binary leaf-labeled gene tree topology G and a rooted binary leaf-labeled species tree topology S with the same leaf labels, a coalescent history represents a possible mapping of the list of gene tree coalescences to the associated branches of the species tree on which those coalescences take place. For certain families of ordered pairs (G, S), the number

In this paper we discuss the question of how to decide when a general chemical reaction system is incapable of admitting multiple equilibria, regardless of parameter values such as reaction rate constants, and regardless of the type of chemical kinetics, such as mass-action kinetics, Michaelis-Menten kinetics, etc. Our results relate previously described linear algebraic and graph-theoretic conditions