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

A latin bitrade (T1, T2) is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. A genus may be associated to a latin bitrade…

The present paper proposes a new framework for describing the stock price dynamics. In the traditional geometric Brownian motion model and its variants, volatility plays a vital role. The modern studies of asset pricing expand around…

Let $\Delta_{L,\rho_n}(t)$ be the twisted Alexander polynomial with respect to the representation given by the composition of the lift of the holonomy representation of a certain hyperbolic link $L$ and the $n$-dimensional irreducible…

This paper establishes an interesting link between $k$th price auctions and Catalan numbers by showing that for distributions that have linear density, the bid function at any symmetric, increasing equilibrium of a $k$th price auction with…

We recall the Alon-Tarsi conjecture on the number of even latin squares. We introduce a map which switches the parity of a latin square under certain requirements. An example is included.

Latin squares are well studied combinatorial objects. In this paper we generalize the concept and propose new objects like Latin triangles, free Latin squares, Latin tetrahedra, free Latin cubes, etc. We start with a classic definition of…

We provide improved space-time tradeoffs for permutation problems over additively idempotent semi-rings. In particular, there is an algorithm for the Traveling Salesperson Problem that solves $N$-vertex instances using space $S$ and time…

In this paper higher-order tangent numbers and higher-order secant numbers, ${\mathscr{T}(n,k)}_{n,k =0}^{\infty}$ and ${\mathscr{S}(n,k)}_{n,k =0}^{\infty}$, have been studied in detail. Several known results regarding $\mathscr{T}(n,k)$…

A latin bitrade is a pair of partial latin squares which are disjoint, occupy the same set of non-empty cells, and whose corresponding rows and columns contain the same set of entries. Dr\'apal (\cite{Dr9}) showed that a latin bitrade is…

Real-world contracts are often ambiguous. While recent work by D\"utting, Feldman, Peretz, and Samuelson (EC 2023, Econometrica 2024) demonstrates that ambiguous contracts can yield large gains for the principal, their optimal solutions…

This is the first in a series of papers in which we describe explicit structural properties of spaces of diagonal rectangular harmonic polynomials in $k$ sets of $n$ variables, both as $GL_k$-modules and $S_n$-modules, as well as some of…

We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…

We study approximations of compact linear multivariate operators defined over Hilbert spaces. We provide necessary and sufficient conditions on various notions of tractability. These conditions are mainly given in terms of sums of certain…

We empirically analyze the price and liquidity responses to trade signs, traded volumes and signed traded volumes. Utilizing the singular value decomposition, we explore the interconnections of price responses and of liquidity responses…

Designs of experiments for multivariate case are reviewed. Fast algorithm of construction of good Latin hypercube designs is developed.

Tight $2 s$-designs are the $2 s$-$(v, k, \lambda)$ designs whose sizes achieve the Fisher type lower bound ${v \choose s}$. Symmetric $2$-designs, the Witt $4$-$(23, 7, 1)$ design and the Witt $4$-$(23, 16, 52)$ design are tight designs.…

Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…

We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner $T(k-1,k,v)$ bitrades, extended $1$-perfect bitrades. For a distance-regular graph, we show a one-to-one…

Satisfiability Modulo Theory (SMT) has recently emerged as a powerful tool for solving various automated reasoning problems across diverse domains. Unlike traditional satisfiability methods confined to Boolean variables, SMT can reason on…

Sequential Latin hypercube designs have recently received great attention for computer experiments. Much of the work has been restricted to invariant spaces. The related systematic construction methods are inflexible while algorithmic…