相关论文: Possible volumes of t-(v, t + 1) Latin trades
A $k$-plex in a latin square of order $n$ is a selection of $kn$ entries that includes $k$ representatives from each row and column and $k$ occurrences of each symbol. A $1$-plex is also known as a transversal. It is well known that if $n$…
We show that the volume of any Montesinos link can be bounded above and below in terms of the combinatorics of its diagram. This was known for Montesinos links with at most two tangles, and those with at least five tangles. We complete the…
Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.
A Latin square $L(n,k)$ is a square of order $n$ with its entries colored with $k$ colors so that all the entries in a row or column have different colors. Let $d(L(n,k))$ be the minimal number of colored entries of an $n \times n$ square…
A subset $S$ of $k$-ary $n$-dimensional hypercube is called latin bitrade if $|S\cap F|\in\{0,2\} $ for each 1-face $F$. We find all admissible small (less than $2^{n+1}$) cardinalities of latin bitrades. A subset $M$ of $k$-ary…
We investigate the upper chromatic number of the hypergraph formed by the points and the $k$-dimensional subspaces of $\mathrm{PG}(n,q)$; that is, the most number of colors that can be used to color the points so that every $k$-subspace…
In this work, we consider a restricted case of the well studied Sorting by Block Interchanges problem. We put an upper bound k on the length of the blocks (substrings) to be interchanged at each step. We call the problem Sorting by k-Block…
The critical point between varieties A and B of algebras is defined as the least cardinality of the semilattice of compact congruences of a member of A but of no member of B, if it exists. The study of critical points gives rise to a whole…
In this article we analyse linear correlation and non-linear dependence of traded volume, $v$, of the 30 constituents of Dow Jones Industrial Average at different value scales. Specifically, we have raised $v$ to some real value $\alpha $…
Blockchain design involves many tradeoffs, and much debate has focused on tradeoffs related to scaling parameters such as blocksize. To address some of the confusion around this subject, we present a probability proof of the DCS Triangle.…
We prove that for any $K$ and $d$, there exist, for all sufficiently large admissible $v$, a pairwise balanced design PBD$(v,K)$ of dimension $d$ for which all $d$-point-generated flats are bounded by a constant independent of $v$. We also…
We develop a formalism for reasoning about trading on decentralized exchanges on blockchains and a formulation of a particular form of maximal extractable value (MEV) that represents the total arbitrage opportunity extractable from on-chain…
For an arbitrary field $K$ and $K$-variety $V$, we introduce the \'etale-open topology on the set $V(K)$ of $K$-points of $V$. This topology agrees with the Zariski topology, Euclidean topology, or valuation topology when $K$ is separably…
We use the theory of vertex operator algebras and intertwining operators to obtain systems of q-difference equations satisfied by the graded dimensions of the principal subspaces of certain level k standard modules for \hat{\goth{sl}(3)}.…
We show that the volumes of certain hyperbolic A-adequate links can be bounded (above and) below in terms of two diagrammatic quantities: the twist number and the number of certain alternating tangles in an A-adequate diagram. We then…
The study of the additive volume of sets can be reduced to the case of one-dimensional sets. The exact values of the volume of extremal sets are given as a conjecture.
Given an STS(v), we ask if there is a permutation of the points of the design such that no $\ell$ consecutive points in this permutation contain a block of the design. Results are obtained in the cases $\ell = 3,4$.
In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of continuous numerical problems $S=(S_d)_{d\in\mathbb{N}}$ in…
A latin bitrade $(T^{\diamond}, T^{\otimes})$ is a pair of partial latin squares which defines the difference between two arbitrary latin squares $L^{\diamond} \supseteq T^{\diamond}$ and $L^{\diamond} \supseteq T^{\otimes}$ of the same…
In this note, we study two generalizations of the Catalan numbers, namely the $s$-Catalan numbers and the spin $s$-Catalan numbers. These numbers first appeared in relation to quantum physics problems about spin multiplicities. We give a…