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

The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…

The property of linear discrete-time time-invariant system operators mapping inputs with at most $k-1$ sign changes to outputs with at most $k-1$ sign changes is investigated. We show that this property is tractable via the notion of…

In this short note we will prove that non-vanishing determinant (NVD) criterion is not enough for an asymmetric space-time block code (STBC) to achieve the optimal diversity-multiplexing gain trade-off (DMT). This result is in contrast to…

Econophysics and econometrics agree that there is a correlation between volume and volatility in a time series. Using empirical data and their distributions, we further investigate this correlation and discover new ways that volatility and…

Let $q$ be a prime power and $k$ be a natural number. What are the possible cardinalities of point sets ${S}$ in a projective plane of order $q$, which do not intersect any line at exactly $k$ points? This problem and its variants have been…

We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…

The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…

Finding classical canonical observables consists of taking a function space over phase space. For constrained theories, these functions must form zero brackets with a closed algebraic structure of first-class constraints. This brackets…

This research critically analyses blockchain scaling solutions based on their ability to realistically balance the properties of the blockchain trilemma. We have concluded this research by outlining a gap in the current body of literature…

In this note six Steiner systems $S(2,8,225)$ and four Steiner systems $S(2,9,289)$ are presented. This resolves two of $129$ undecided cases for block designs with block length $8$ and $9$, mentioned in Handbook of Combinatorial Designs.

The objective of this paper is the construction of new indicators that can be useful to operate in the cryptocurrency market. These indicators are based on public data obtained from the blockchain network, specifically from the nodes that…

The Lucas sequence is a sequence of polynomials in s, and t defined recursively by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. On specialization of s and t one can recover the Fibonacci numbers, the nonnegative integers, and the…

The central topic is this question: is a given $k$-\'etale algebra $\prod_lE_l/k$ the specialization of a given $k$-cover $f:X\rightarrow B$ at some point $t_0\in B(k)$? Our main tool is a {\it twisting lemma} that reduces the problem to…

Block encodings are a fundamental primitive in quantum algorithms, but can often have large ancilla overhead. In this work, we introduce novel techniques for reducing this overhead in two distinct ways. In Part I, we prove the existence of…

We investigate the use of the normalized imbalance between option volumes corresponding to positive and negative market views, as a predictor for directional price movements in the spot market. Via a nonlinear analysis, and using a…

In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…

A partial transversal $T$ of a Latin square $L$ is a set of entries of $L$ in which each row, column and symbol is represented at most once. A partial transversal is maximal if it is not contained in a larger partial transversal. Any…

We define and study translations between the maximal class of analytic display calculi for tense logics and labeled sequent calculi, thus solving an open problem about the translatability of proofs between the two formalisms. In particular,…

We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku…

In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…