Related papers: On the Refinement of Certain Statistics on Alterna…
A graph $G = (V, E)$ is said to be word-representable if a word $w$ can be formed using the letters of the alphabet $V$ such that for every pair of vertices $x$ and $y$, $xy \in E$ if and only if $x$ and $y$ alternate in $w$. Gaetz and Ji…
It was shown recently by the authors that, for any n, there is equality between the distributions of certain triplets of statistics on nxn alternating sign matrices (ASMs) and descending plane partitions (DPPs) with each part at most n. The…
We present a general theory for the full counting statistics of multiple Andreev reflections in incoherent superconducting-normal-superconducting contacts. The theory, based on a stochastic path integral approach, is applied to a…
Word matches are often used in sequence comparison methods, either as a measure of sequence similarity or in the first search steps of algorithms such as BLAST or BLAT. The D2 statistic is the number of matches of words of k letters between…
Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…
We prove an integral formula for continuous paths of rectangles inscribed in a piecewise smooth loop. We then use this integral formula to show that (with a very mild genericity hypothesis) the number of rectangle coincidences, informally…
A coloring $c$ of the vertices of a graph $G$ is nonrepetitive if there exists no path $v_1v_2\ldots v_{2l}$ for which $c(v_i)=c(v_{l+i})$ for all $1\le i\le l$. Given graphs $G$ and $H$ with $|V(H)|=k$, the lexicographic product $G[H]$ is…
The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its…
Recently, a new class of words, denoted by L_n, was shown to be in bijection with a subset of the Dyck paths of length 2n having cardinality given by the (n-1)-st Catalan number. Here, we consider statistics on L_n recording the number of…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We investigate the relations between different variants of the LZ77 parsing existing in the literature. All of them are defined as greedily constructed parsings encoding each phrase by reference to a string occurring earlier in the input.…
This dissertation explores the linguistic and computational aspects of the meaning relations that can hold between two or more complex linguistic expressions (phrases, clauses, sentences, paragraphs). In particular, it focuses on…
We give a simple combinatorial proof of a formula that extends a result by Grigorchuk (rediscovered by Cohen) relating cogrowth and spectral radius of random walks. Our main result is an explicit equation determining the number of `bumps'…
We consider vector spin glass models with self-overlap correction. Since the limit of free energy is an infimum, we use arguments analogous to those for generic models to show the following: 1) the averaged self-overlap converges; 2) the…
Solids with spatially varying photonic structure offer gaps to light of a wider range of frequencies than do simple photonic systems. We solve numerically the field distribution in a solid cholesteric with a linearly varying inverse pitch…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
Word-representable graphs are a subset of graphs that may be represented by a word $w$ over an alphabet composed of the vertices in the graph. In such graphs, an edge exists if and only if the occurrences of the corresponding vertices…
Identifying the relations that exist between words (or entities) is important for various natural language processing tasks such as, relational search, noun-modifier classification and analogy detection. A popular approach to represent the…
The findings of X-ray and neutron scattering experiments on amorphous systems are interpreted within the framework of the theory of Euclidean random matrices. This allows to take into account the topological nature of the disorder, a key…
An analytical formula for the occurence probability of Markovian stochastic paths with repeatedly visited and/or equal departure rates is derived. This formula is essential for an efficient investigation of the trajectories belonging to…