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

We determine explicitly the maximal dominant weights for the integrable highest weight $\hat{sl}(n)$-modules $V((k-1)\Lambda_0 + \Lambda_s)$, $0 \leq s \leq n-1$, $ k \geq 2$. We give a conjecture for the number of maximal dominant weights…

The longest common extension problem is to preprocess a given string of length $n$ into a data structure that uses $S(n)$ bits on top of the input and answers in $T(n)$ time the queries $\mathit{LCE}(i,j)$ computing the length of the…

The cross-blockchain transaction remains one of the most challenging problems in blockchains. The root cause of the challenge lies in the nondeterministic nature of blockchains: A $n$-party transaction across multiple blockchains might be…

Choices in the semantics and the signature of a theory are integral in determining how the theory is used and how challenging it is to reason over it. Our interest in this paper lies in the SMT theory of sequences. Various versions of it…

Smart contracts are crucial elements of decentralized technologies, but they face significant obstacles to trustworthiness due to security bugs and trapdoors. To address the core issue, we propose a technology that enables programmers to…

For positive integers $n$ and $k$ with $n \geq k$, an $(n,k,1)$-design is a pair $(V, \mathcal{B})$ where $V$ is a set of $n$ points and $\mathcal{B}$ is a collection of $k$-subsets of $V$ called blocks such that each pair of points occur…

Ivlev's pioneering work started in the 1970's showed a new and promissory way in the study of modal logic from the perspective of many-valued logics. Continuing our previous work on Ivlev-like non-normal modal logics with non-deterministic…

We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…

With the advent of decentralised digital currencies powered by blockchain technology, a new era of peer-to-peer transactions has commenced. The rapid growth of the cryptocurrency economy has led to increased use of transaction-enabling…

A Latin array is a matrix of symbols in which no symbol occurs more than once within a row or within a column. A diagonal of an $n\times n$ array is a selection of $n$ cells taken from different rows and columns of the array. The weight of…

Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist…

It is established that the logarithm of the number of latin $d$-cubes of order $n$ is $\Theta(n^{d}\ln n)$ and the logarithm of the number of pairs of orthogonal latin squares of order $n$ is $\Theta(n^2\ln n)$. Similar estimations are…

In this paper we show how to use elementary methods to prove that the volume of Sl_k R / Sl_k Z is zeta(2) * zeta(3) * ... * zeta(k) / k. Using a version of reduction theory presented in this paper, we can compute the volumes of certain…

Block-transitive Steiner $t$-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory,…

Consider the affine Lie algebra $\hat{s\ell}(n)$ with null root $\delta$, weight lattice $P$ and set of dominant weights $P^+$. Let $V(k\Lambda_0), \, k \in \mathbb{Z}_{\geq 1}$ denote the integrable highest weight $\hat{s\ell}(n)$-module…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…

In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming…

Constrained orthogonal polynomials have been recently introduced in the study of the Hohenberg-Kohn functional to provide basis functions satisfying particle number conservation for an expansion of the particle density. More generally, we…

Let $v\geq6$ be an integer with $v\equiv2 \pmod 4$. In this paper, we introduce a new partitioning of the set of all $3$-subsets of a $v$-set into some simple trades.