Related papers: A combinatorial problem related to the classical p…
An important yet challenging problem in numerical linear algebra is finding a principal submatrix with maximum determinant from a given symmetric positive semidefinite matrix. This problem arises in experimental design, statistics, and…
Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…
The problem of pattern selection arises when the evolution equations have many solutions, whereas observed patterns constitute a much more restricted set. An approach is advanced for treating the problem of pattern selection by defining the…
The work considers the set $\Lambda_n^k$ of all $n\times n$ binary matrices having the same number of $k$ units in each row and each column. The article specifically focuses on the matrices whose rows and columns are sorted…
The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…
A density matrix formulation of classical bipartite correlations is constructed. This leads to an understanding of the appearance of classical statistical correlations intertwined with the quantum correlations as well as a physical…
We consider complex polynomials $f(z) = z^\ell+c_1$ for $\ell \in 2\N$ and $c_1 \in \R$, and find some combinatorial types and values of $\ell$ such that there is no invariant probability measure equivalent to conformal measure on the Julia…
This paper studies the maximum cardinality matching problem in stochastically evolving graphs. We formally define the arrival-departure model with stochastic departures. There, a graph is sampled from a specific probability distribution and…
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such problem is maximum clique which -- under standard assumptions in complexity theory -- cannot be solved in…
The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, then |F| is at most $\binom{n-1}{k-1}$. The theorem also…
In this paper we study a question related to the classical Erd\H{o}s-Ko-Rado theorem, which states that any family of $k$-element subsets of the set $[n] = \{1,\ldots,n\}$ in which any two sets intersect, has cardinality at most…
In statistical physics, the challenging combinatorial enumeration of the configurations of a system subject to hard constraints (microcanonical ensemble) is mapped to a mathematically easier calculation where the constraints are softened…
In various situations, decision makers face experts that may provide conflicting advice. This advice may be in the form of probabilistic forecasts over critical future events. We consider a setting where the two forecasters provide their…
The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. Previously considered criteria for evaluating proposed mechanisms…
The $k$-subset sum problem over finite fields is a classical NP-complete problem.Motivated by coding theory applications, a more complex problem is the higher $m$-th moment $k$-subset sum problem over finite fields. We show that there is a…
Three events in a probability space form a conjunctive fork if they satisfy specific constraints on conditional independence and covariances. Patterns of conjunctive forks within collections of events are characterized by means of systems…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
The classical binomial process has been studied by \citet{jakeman} (and the references therein) and has been used to characterize a series of radiation states in quantum optics. In particular, he studied a classical birth-death process…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a…
A celebrated theorem of Kleitman in extremal combinatorics states that a collection of binary vectors in $\{0, 1\}^n$ with diameter $d$ has cardinality at most that of a Hamming ball of radius $d/2$. In this paper, we give an algebraic…