相关论文: Possible volumes of t-(v, t + 1) Latin trades

In the Token Sliding problem we are given a graph $G$ and two independent sets $I_s$ and $I_t$ in $G$ of size $k \geq 1$. The goal is to decide whether there exists a sequence $\langle I_1, I_2, \ldots, I_\ell \rangle$ of independent sets…

A dynamic herding model with interactions of trading volumes is introduced. At time $t$, an agent trades with a probability, which depends on the ratio of the total trading volume at time $t-1$ to its own trading volume at its last trade.…

A $k$-plex of a latin square is a collection of cells representing each row, column, and symbol precisely $k$ times. The classic case of $k=1$ is more commonly known as a transversal. We introduce the concept of a $k$-weight, an integral…

Designs for Order-of-Addition (OofA) experiments have received growing attention due to their impact on responses based on the sequence of component addition. In certain cases, these experiments involve heterogeneous groups of units, which…

We (1) determine the number of Latin rectangles with 11 columns and each possible number of rows, including the Latin squares of order~11, (2) answer some questions of Alter by showing that the number of reduced Latin squares of order $n$…

We study the relationship between price spread, volatility and trading volume. We find that spread forms as a result of interplay between order liquidity and order impact. When trading volume is small adding more liquidity helps improve…

Consider families of $k$-subsets (or blocks) on a ground set of size $v$. Recall that if all $t$-subsets occur with the same frequency $\lambda$, one obtains a $t$-design with index $\lambda$. On the other hand, if all $t$-subsets occur…

A combinatorial trade is a pair of sets of blocks of elements that can be exchanged while preserving relevant subset intersection constraints. The class of balanced and swap-robust minimal trades was proposed in [1] for exchanging blocks of…

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

We revisit the visible points of a lattice in Euclidean $n$-space together with their generalisations, the $k$th-power-free points of a lattice, and study the corresponding dynamical system that arises via the closure of the lattice…

A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT,…

We introduce a new type of $n$-dimensional generalization of symmetric $(v,k,\lambda)$ block designs. We prove upper bounds on the dimension $n$ in terms of $v$ and $k$. We also define the corresponding concept of $n$-dimensional difference…

We first discuss how open/closed chord diagrams, both with and without marked points, act on appropriate Hochschild complexes possibly coupled with the two-sided cobar complex. Then, in the main part of the paper, we introduce the notion of…

Recently Ott, Tomforde and Willis introduced a notion of one-sided shifts over infinite alphabets and proposed a definition for sliding block codes between such shift spaces. In this work we propose a more general definition for sliding…

Fisher proved in 1940 that any $2$-$(v,k,\lambda)$ design with $v>k$ has at least $v$ blocks. In 1975 Ray-Chaudhuri and Wilson generalised this result by showing that every $t$-$(v,k,\lambda)$ design with $v \geq k+\lfloor t/2 \rfloor$ has…

The paper contains a development of the previously proposed generalized lattice model (GLM). In contrast to usual lattice models, the difference of the specific atomic volumes of the components is taken in account in GLM. In addition to…

Determining the number of embeddings of Laman graph frameworks is an open problem which corresponds to understanding the solutions of the resulting systems of equations. In this paper we investigate the bounds which can be obtained from the…

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We…

We give an overview of certain aspects of tractability analysis of multivariate problems. This paper is not intended to give a complete account of the subject, but provides an insight into how the theory works for particular types of…

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…