SearcharxivSearch

arXiv subjects

Yuhi Kamio

Publications and source records attributed to Yuhi Kamio.

7 recordsLinked to original sources

Binary Caps and LCD Codes with Large Dimensions

We establish a connection between linear complementary dual (LCD) codes and caps in projective space. Using this framework and the structure theory of maximal caps, we derive nonexistence theorems for LCD codes with minimum distance at least $4$, providing computation-free proofs that were previously obtained only through exhaustive search. As an application, we completely determine the optimal minimum distances for codimensions $7$ and $8$ for the first time.

cs.IT

Lawvere's fourth open problem: Levels in the topos of symmetric simplicial sets

In the topos of simplicial sets, it makes sense to ask the following question about a given natural number $n$: what is the minimum value $m$ such that $n$-skeletality implies $m$-coskeletality? This is an instance of the Aufhebung relation in the sense of Lawvere, who introduced this notion for an arbitrary Grothendieck topos $\mathcal{E}$ in place of $\mathbf{sSet}$, and levels/essential subtopoi in place of dimensions. We compute this Aufhebung relation for the topos of symmetric simplicial sets. In particular, we show that it is given by $2l-1$ for the level labelled by $l\geq 3$, which coincides with the previously known case of simplicial sets. This result provides a solution to the fourth of the seven open problems in topos theory posed by Lawvere in 2009.

math.CT

Solution to Lawvere's first problem: a Grothendieck topos that has proper class many quotient topoi

This paper solves the first of the open problems in topos theory posted by William Lawvere, concerning the existence of a Grothendieck topos that has proper class many quotient topoi. This paper concretely constructs such Grothendieck topoi, including the presheaf topos on the free monoid generated by countably infinitely many elements PSh(M_{\omega}). Utilizing the combinatorics of the classifying topos of the theory of inhabited objects and with the help of a system of pairing functions, the problem is reduced to a theorem of Vopenka, Pultr, and Hedrlin, which states that any set admits a rigid relational structure.

math.CT

The bounds of rigid sphere design

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only finitely many rigid t-designs on Sd, up to orthogonal transformations.

math.CO

Quadratic residues and domino tilings

The formula for the number of domino tilings due to Kasteleyn and Temperley-Fisher is strikingly similar to Eisenstein's formula for the Legendre symbol. We study the connection between these two concepts and prove a formula which expresses the Jacobi symbol in terms of domino tilings.

math.NT

Quotient toposes of discrete dynamical systems

This paper gives a classification of classes of discrete dynamical systems (a set equipped with an endofunction) closed under finite limits and small colimits. The conclusion is simple: they bijectively correspond to the ideals of the product poset $\mathbb{N} \times \mathbb{N}$, where the first $\mathbb{N}$ is ordered by the usual order and the second is by the divisibility. Our method is based on a detailed analysis of the behaviors of states, especially non-periodic behaviors, in discrete dynamical systems. Specifically, extending the fundamental quantity, time until entering a loop, to even those states that do not enter a loop plays a crucial role. Our classification is closely related to epimorphisms from $\mathbb{N}$ in the category of monoids. There are countably many injective epimorphisms from $\mathbb{N}$, including $\mathbb{N} \to \mathbb{Z}$. Those injective epimorphisms correspond to the non-periodic behaviors of states of discrete dynamical systems. We discuss this point at the end of the paper. This fun puzzle is motivated by an open problem in topos theory. Lawvere left open problems in topos theory on his webpage, and the first problem is called quotient toposes. The main theorem of this paper provides a non-trivial example of this problem, which is not implied by any known results. This paper also provides a theoretical framework to address the open problem. We define a preorder among the objects of a Grothendieck topos (which we have named generative order), which enables us to reduce calculations of quotient toposes to calculations of objects. Our method is its application to the topos of discrete dynamical systems.

math.CT