Related papers: A continuous analogue of lattice path enumeration
We introduce notions of continuous orbit equivalence and strong (respective, weak) continuous orbit equivalence for automorphism systems of \'{e}tale equivalence relations, and characterize them in terms of the semi-direct product…
In this article, we consider nonlinear complementarity problem. We introduce a new homotopy function for finding the solution of nonlinear complementarity problem through the trajectory . We show that the homotopy path approaching the…
Lanczos-type algorithms are efficient and easy to implement. Unfortunately they breakdown frequently and well before convergence has been achieved. These algorithms are typically based on recurrence relations which involve formal orthogonal…
We explain connections among several, a priori unrelated, areas of mathematics: combinatorics, algebraic statistics, topology and enumerative algebraic geometry. Our focus is on discrete invariants, strongly related to the theory of…
We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…
We examine the lattice generated by two pairs of supplementary vector subspaces of a finite-dimensional vector space by intersection and sum, with the aim of applying the results to the study of representations admitting two pairs of…
Every adapted absolutely continuous process has a predictable density. The set of adapted absolutely continuous processes equals the set of time integrals of progressive or predictable pathwise locally integrable processes.
A lattice system is derived which amounts to a higher-rank analogue of the Q3 equation, the latter being an integrable partial difference equation which has appeared in the ABS list of multidimensionally consistent quadrilateral lattice…
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…
In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…
Diagram chasing is not an easy task. The coherence holds in a generalized sense if we have a mechanical method to judge whether given two morphisms are equal to each other. A simple way to this end is to reform a concerned category into a…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
Enumeration of planar lattice walks is a classical topic in combinatorics, at the cross-roads of several domains (e.g., probability, statistical physics, computer science). The aim of this paper is to propose a new approach to obtain some…
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We…
In this article we investigate the lattices of Dyck paths of type $A$ and $B$ under dominance order, and explicitly describe their Heyting algebra structure. This means that each Dyck path of either type has a relative pseudocomplement with…